Average Error: 0.0 → 0.0
Time: 1.1s
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 r137369 = x;
        double r137370 = y;
        double r137371 = r137369 * r137370;
        double r137372 = z;
        double r137373 = t;
        double r137374 = r137372 * r137373;
        double r137375 = r137371 + r137374;
        return r137375;
}
↓
double f(double x, double y, double z, double t) {
        double r137376 = x;
        double r137377 = y;
        double r137378 = r137376 * r137377;
        double r137379 = z;
        double r137380 = t;
        double r137381 = r137379 * r137380;
        double r137382 = r137378 + r137381;
        return r137382;
}

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