Average Error: 0.0 → 0.0
Time: 6.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 r115081 = x;
        double r115082 = y;
        double r115083 = r115081 * r115082;
        double r115084 = 1.0;
        double r115085 = r115081 - r115084;
        double r115086 = z;
        double r115087 = r115085 * r115086;
        double r115088 = r115083 + r115087;
        return r115088;
}
↓
double f(double x, double y, double z) {
        double r115089 = x;
        double r115090 = y;
        double r115091 = r115089 * r115090;
        double r115092 = 1.0;
        double r115093 = r115089 - r115092;
        double r115094 = z;
        double r115095 = r115093 * r115094;
        double r115096 = r115091 + r115095;
        return r115096;
}

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