Average Error: 0.0 → 0.0
Time: 12.8s
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 r120536 = x;
        double r120537 = y;
        double r120538 = r120536 * r120537;
        double r120539 = z;
        double r120540 = t;
        double r120541 = r120539 * r120540;
        double r120542 = r120538 + r120541;
        return r120542;
}
↓
double f(double x, double y, double z, double t) {
        double r120543 = x;
        double r120544 = y;
        double r120545 = r120543 * r120544;
        double r120546 = z;
        double r120547 = t;
        double r120548 = r120546 * r120547;
        double r120549 = r120545 + r120548;
        return r120549;
}

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 x \cdot y + z \cdot t\]

Reproduce

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