Average Error: 0.0 → 0.0
Time: 16.4s
Precision: 64
\[x \cdot y + z \cdot t\]
↓
\[z \cdot t + x \cdot y\]
x \cdot y + z \cdot t
↓
z \cdot t + x \cdot y
double f(double x, double y, double z, double t) {
        double r7152587 = x;
        double r7152588 = y;
        double r7152589 = r7152587 * r7152588;
        double r7152590 = z;
        double r7152591 = t;
        double r7152592 = r7152590 * r7152591;
        double r7152593 = r7152589 + r7152592;
        return r7152593;
}
↓
double f(double x, double y, double z, double t) {
        double r7152594 = z;
        double r7152595 = t;
        double r7152596 = r7152594 * r7152595;
        double r7152597 = x;
        double r7152598 = y;
        double r7152599 = r7152597 * r7152598;
        double r7152600 = r7152596 + r7152599;
        return r7152600;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x \cdot y + z \cdot t\]

  2. Final simplification0.0

    \[\leadsto z \cdot t + x \cdot y\]

Reproduce

herbie shell --seed 2019171 
(FPCore (x y z t)
  :name "Linear.V2:$cdot from linear-1.19.1.3, A"
  (+ (* x y) (* z t)))