Average Error: 0.0 → 0.0
Time: 6.7s
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 r110757 = x;
        double r110758 = y;
        double r110759 = r110757 * r110758;
        double r110760 = z;
        double r110761 = t;
        double r110762 = r110760 * r110761;
        double r110763 = r110759 + r110762;
        return r110763;
}
↓
double f(double x, double y, double z, double t) {
        double r110764 = x;
        double r110765 = y;
        double r110766 = r110764 * r110765;
        double r110767 = z;
        double r110768 = t;
        double r110769 = r110767 * r110768;
        double r110770 = r110766 + r110769;
        return r110770;
}

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