Average Error: 0.0 → 0.0
Time: 6.9s
Precision: 64
\[x \cdot y + \left(x - 1\right) \cdot z\]
↓
\[x \cdot y + \left(x - 1\right) \cdot z\]
x \cdot y + \left(x - 1\right) \cdot z
↓
x \cdot y + \left(x - 1\right) \cdot z
double f(double x, double y, double z) {
        double r213055 = x;
        double r213056 = y;
        double r213057 = r213055 * r213056;
        double r213058 = 1.0;
        double r213059 = r213055 - r213058;
        double r213060 = z;
        double r213061 = r213059 * r213060;
        double r213062 = r213057 + r213061;
        return r213062;
}
↓
double f(double x, double y, double z) {
        double r213063 = x;
        double r213064 = y;
        double r213065 = r213063 * r213064;
        double r213066 = 1.0;
        double r213067 = r213063 - r213066;
        double r213068 = z;
        double r213069 = r213067 * r213068;
        double r213070 = r213065 + r213069;
        return r213070;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[x \cdot y + \left(x - 1\right) \cdot z\]

  2. Final simplification0.0

    \[\leadsto x \cdot y + \left(x - 1\right) \cdot z\]

Reproduce

herbie shell --seed 2020046 
(FPCore (x y z)
  :name "Graphics.Rendering.Chart.Drawing:drawTextsR from Chart-1.5.3"
  :precision binary64
  (+ (* x y) (* (- x 1) z)))