Average Error: 0.0 → 0.0
Time: 2.5s
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 r136441 = x;
        double r136442 = y;
        double r136443 = r136441 * r136442;
        double r136444 = z;
        double r136445 = t;
        double r136446 = r136444 * r136445;
        double r136447 = r136443 + r136446;
        return r136447;
}
↓
double f(double x, double y, double z, double t) {
        double r136448 = x;
        double r136449 = y;
        double r136450 = r136448 * r136449;
        double r136451 = z;
        double r136452 = t;
        double r136453 = r136451 * r136452;
        double r136454 = r136450 + r136453;
        return r136454;
}

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