Average Error: 0.0 → 0.0
Time: 2.1s
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 r207476 = x;
        double r207477 = y;
        double r207478 = r207476 * r207477;
        double r207479 = 1.0;
        double r207480 = r207476 - r207479;
        double r207481 = z;
        double r207482 = r207480 * r207481;
        double r207483 = r207478 + r207482;
        return r207483;
}
↓
double f(double x, double y, double z) {
        double r207484 = x;
        double r207485 = y;
        double r207486 = r207484 * r207485;
        double r207487 = 1.0;
        double r207488 = r207484 - r207487;
        double r207489 = z;
        double r207490 = r207488 * r207489;
        double r207491 = r207486 + r207490;
        return r207491;
}

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