Average Error: 0.0 → 0.0
Time: 6.7s
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 r75944 = x;
        double r75945 = y;
        double r75946 = r75944 * r75945;
        double r75947 = 1.0;
        double r75948 = r75944 - r75947;
        double r75949 = z;
        double r75950 = r75948 * r75949;
        double r75951 = r75946 + r75950;
        return r75951;
}
↓
double f(double x, double y, double z) {
        double r75952 = x;
        double r75953 = y;
        double r75954 = r75952 * r75953;
        double r75955 = 1.0;
        double r75956 = r75952 - r75955;
        double r75957 = z;
        double r75958 = r75956 * r75957;
        double r75959 = r75954 + r75958;
        return r75959;
}

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