Average Error: 0.0 → 0.0
Time: 12.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 r127510 = x;
        double r127511 = y;
        double r127512 = r127510 * r127511;
        double r127513 = 1.0;
        double r127514 = r127510 - r127513;
        double r127515 = z;
        double r127516 = r127514 * r127515;
        double r127517 = r127512 + r127516;
        return r127517;
}
↓
double f(double x, double y, double z) {
        double r127518 = x;
        double r127519 = y;
        double r127520 = r127518 * r127519;
        double r127521 = 1.0;
        double r127522 = r127518 - r127521;
        double r127523 = z;
        double r127524 = r127522 * r127523;
        double r127525 = r127520 + r127524;
        return r127525;
}

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