Average Error: 0.0 → 0.0
Time: 2.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 r173003 = x;
        double r173004 = y;
        double r173005 = r173003 * r173004;
        double r173006 = z;
        double r173007 = t;
        double r173008 = r173006 * r173007;
        double r173009 = r173005 + r173008;
        return r173009;
}
↓
double f(double x, double y, double z, double t) {
        double r173010 = x;
        double r173011 = y;
        double r173012 = r173010 * r173011;
        double r173013 = z;
        double r173014 = t;
        double r173015 = r173013 * r173014;
        double r173016 = r173012 + r173015;
        return r173016;
}

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