Average Error: 0.0 → 0.0
Time: 1.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 r172403 = x;
        double r172404 = y;
        double r172405 = r172403 * r172404;
        double r172406 = 1.0;
        double r172407 = r172403 - r172406;
        double r172408 = z;
        double r172409 = r172407 * r172408;
        double r172410 = r172405 + r172409;
        return r172410;
}
↓
double f(double x, double y, double z) {
        double r172411 = x;
        double r172412 = y;
        double r172413 = r172411 * r172412;
        double r172414 = 1.0;
        double r172415 = r172411 - r172414;
        double r172416 = z;
        double r172417 = r172415 * r172416;
        double r172418 = r172413 + r172417;
        return r172418;
}

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