Average Error: 0.0 → 0.0
Time: 8.4s
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 r131297 = x;
        double r131298 = y;
        double r131299 = r131297 * r131298;
        double r131300 = 1.0;
        double r131301 = r131297 - r131300;
        double r131302 = z;
        double r131303 = r131301 * r131302;
        double r131304 = r131299 + r131303;
        return r131304;
}
↓
double f(double x, double y, double z) {
        double r131305 = x;
        double r131306 = y;
        double r131307 = r131305 * r131306;
        double r131308 = 1.0;
        double r131309 = r131305 - r131308;
        double r131310 = z;
        double r131311 = r131309 * r131310;
        double r131312 = r131307 + r131311;
        return r131312;
}

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