Average Error: 0.0 → 0.0
Time: 8.5s
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 r222270 = x;
        double r222271 = y;
        double r222272 = r222270 * r222271;
        double r222273 = 1.0;
        double r222274 = r222270 - r222273;
        double r222275 = z;
        double r222276 = r222274 * r222275;
        double r222277 = r222272 + r222276;
        return r222277;
}
↓
double f(double x, double y, double z) {
        double r222278 = x;
        double r222279 = y;
        double r222280 = r222278 * r222279;
        double r222281 = 1.0;
        double r222282 = r222278 - r222281;
        double r222283 = z;
        double r222284 = r222282 * r222283;
        double r222285 = r222280 + r222284;
        return r222285;
}

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)))