Average Error: 0.0 → 0.0
Time: 3.3s
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 r119492 = x;
        double r119493 = y;
        double r119494 = r119492 * r119493;
        double r119495 = z;
        double r119496 = t;
        double r119497 = r119495 * r119496;
        double r119498 = r119494 + r119497;
        return r119498;
}
↓
double f(double x, double y, double z, double t) {
        double r119499 = x;
        double r119500 = y;
        double r119501 = r119499 * r119500;
        double r119502 = z;
        double r119503 = t;
        double r119504 = r119502 * r119503;
        double r119505 = r119501 + r119504;
        return r119505;
}

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