Average Error: 0.0 → 0.0
Time: 5.1s
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 r6137406 = x;
        double r6137407 = y;
        double r6137408 = r6137406 * r6137407;
        double r6137409 = z;
        double r6137410 = t;
        double r6137411 = r6137409 * r6137410;
        double r6137412 = r6137408 + r6137411;
        return r6137412;
}
↓
double f(double x, double y, double z, double t) {
        double r6137413 = z;
        double r6137414 = t;
        double r6137415 = r6137413 * r6137414;
        double r6137416 = x;
        double r6137417 = y;
        double r6137418 = r6137416 * r6137417;
        double r6137419 = r6137415 + r6137418;
        return r6137419;
}

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 2019179 
(FPCore (x y z t)
  :name "Linear.V2:$cdot from linear-1.19.1.3, A"
  (+ (* x y) (* z t)))