Average Error: 0.0 → 0.0
Time: 2.9s
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 r138707 = x;
        double r138708 = y;
        double r138709 = r138707 * r138708;
        double r138710 = 1.0;
        double r138711 = r138707 - r138710;
        double r138712 = z;
        double r138713 = r138711 * r138712;
        double r138714 = r138709 + r138713;
        return r138714;
}
↓
double f(double x, double y, double z) {
        double r138715 = x;
        double r138716 = y;
        double r138717 = r138715 * r138716;
        double r138718 = 1.0;
        double r138719 = r138715 - r138718;
        double r138720 = z;
        double r138721 = r138719 * r138720;
        double r138722 = r138717 + r138721;
        return r138722;
}

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