Average Error: 0.0 → 0.0
Time: 39.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 r7796479 = x;
        double r7796480 = y;
        double r7796481 = r7796479 * r7796480;
        double r7796482 = z;
        double r7796483 = t;
        double r7796484 = r7796482 * r7796483;
        double r7796485 = r7796481 + r7796484;
        return r7796485;
}
↓
double f(double x, double y, double z, double t) {
        double r7796486 = z;
        double r7796487 = t;
        double r7796488 = r7796486 * r7796487;
        double r7796489 = x;
        double r7796490 = y;
        double r7796491 = r7796489 * r7796490;
        double r7796492 = r7796488 + r7796491;
        return r7796492;
}

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