Average Error: 0.0 → 0.0
Time: 4.0s
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 r133412 = x;
        double r133413 = y;
        double r133414 = r133412 * r133413;
        double r133415 = z;
        double r133416 = t;
        double r133417 = r133415 * r133416;
        double r133418 = r133414 + r133417;
        return r133418;
}
↓
double f(double x, double y, double z, double t) {
        double r133419 = x;
        double r133420 = y;
        double r133421 = r133419 * r133420;
        double r133422 = z;
        double r133423 = t;
        double r133424 = r133422 * r133423;
        double r133425 = r133421 + r133424;
        return r133425;
}

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