Average Error: 0.0 → 0.0
Time: 3.2s
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 r172280 = x;
        double r172281 = y;
        double r172282 = r172280 * r172281;
        double r172283 = 1.0;
        double r172284 = r172280 - r172283;
        double r172285 = z;
        double r172286 = r172284 * r172285;
        double r172287 = r172282 + r172286;
        return r172287;
}
↓
double f(double x, double y, double z) {
        double r172288 = x;
        double r172289 = y;
        double r172290 = r172288 * r172289;
        double r172291 = 1.0;
        double r172292 = r172288 - r172291;
        double r172293 = z;
        double r172294 = r172292 * r172293;
        double r172295 = r172290 + r172294;
        return r172295;
}

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 2019354 
(FPCore (x y z)
  :name "Graphics.Rendering.Chart.Drawing:drawTextsR from Chart-1.5.3"
  :precision binary64
  (+ (* x y) (* (- x 1) z)))