Average Error: 0.0 → 0.0
Time: 6.9s
Precision: 64
\[x \cdot y + z \cdot t\]
↓
\[x \cdot y + z \cdot t\]
x \cdot y + z \cdot t
↓
x \cdot y + z \cdot t
double f(double x, double y, double z, double t) {
        double r120524 = x;
        double r120525 = y;
        double r120526 = r120524 * r120525;
        double r120527 = z;
        double r120528 = t;
        double r120529 = r120527 * r120528;
        double r120530 = r120526 + r120529;
        return r120530;
}
↓
double f(double x, double y, double z, double t) {
        double r120531 = x;
        double r120532 = y;
        double r120533 = r120531 * r120532;
        double r120534 = z;
        double r120535 = t;
        double r120536 = r120534 * r120535;
        double r120537 = r120533 + r120536;
        return r120537;
}

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. Simplified0.0

    \[\leadsto \color{blue}{z \cdot t + x \cdot y}\]

  3. Final simplification0.0

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

Reproduce

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