Average Error: 0.0 → 0.0
Time: 8.3s
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 r219326 = x;
        double r219327 = y;
        double r219328 = r219326 * r219327;
        double r219329 = 1.0;
        double r219330 = r219326 - r219329;
        double r219331 = z;
        double r219332 = r219330 * r219331;
        double r219333 = r219328 + r219332;
        return r219333;
}
↓
double f(double x, double y, double z) {
        double r219334 = x;
        double r219335 = y;
        double r219336 = r219334 * r219335;
        double r219337 = 1.0;
        double r219338 = r219334 - r219337;
        double r219339 = z;
        double r219340 = r219338 * r219339;
        double r219341 = r219336 + r219340;
        return r219341;
}

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