Average Error: 0.0 → 0.0
Time: 4.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 r209280 = x;
        double r209281 = y;
        double r209282 = r209280 * r209281;
        double r209283 = 1.0;
        double r209284 = r209280 - r209283;
        double r209285 = z;
        double r209286 = r209284 * r209285;
        double r209287 = r209282 + r209286;
        return r209287;
}
↓
double f(double x, double y, double z) {
        double r209288 = x;
        double r209289 = y;
        double r209290 = r209288 * r209289;
        double r209291 = 1.0;
        double r209292 = r209288 - r209291;
        double r209293 = z;
        double r209294 = r209292 * r209293;
        double r209295 = r209290 + r209294;
        return r209295;
}

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