Average Error: 0.0 → 0.0
Time: 3.0s
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 r217461 = x;
        double r217462 = y;
        double r217463 = r217461 * r217462;
        double r217464 = 1.0;
        double r217465 = r217461 - r217464;
        double r217466 = z;
        double r217467 = r217465 * r217466;
        double r217468 = r217463 + r217467;
        return r217468;
}
↓
double f(double x, double y, double z) {
        double r217469 = x;
        double r217470 = y;
        double r217471 = r217469 * r217470;
        double r217472 = 1.0;
        double r217473 = r217469 - r217472;
        double r217474 = z;
        double r217475 = r217473 * r217474;
        double r217476 = r217471 + r217475;
        return r217476;
}

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