Average Error: 0.0 → 0.0
Time: 1.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 r120716 = x;
        double r120717 = y;
        double r120718 = r120716 * r120717;
        double r120719 = 1.0;
        double r120720 = r120716 - r120719;
        double r120721 = z;
        double r120722 = r120720 * r120721;
        double r120723 = r120718 + r120722;
        return r120723;
}
↓
double f(double x, double y, double z) {
        double r120724 = x;
        double r120725 = y;
        double r120726 = r120724 * r120725;
        double r120727 = 1.0;
        double r120728 = r120724 - r120727;
        double r120729 = z;
        double r120730 = r120728 * r120729;
        double r120731 = r120726 + r120730;
        return r120731;
}

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