Average Error: 0.0 → 0.0
Time: 10.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 r110224 = x;
        double r110225 = y;
        double r110226 = r110224 * r110225;
        double r110227 = 1.0;
        double r110228 = r110224 - r110227;
        double r110229 = z;
        double r110230 = r110228 * r110229;
        double r110231 = r110226 + r110230;
        return r110231;
}
↓
double f(double x, double y, double z) {
        double r110232 = x;
        double r110233 = y;
        double r110234 = r110232 * r110233;
        double r110235 = 1.0;
        double r110236 = r110232 - r110235;
        double r110237 = z;
        double r110238 = r110236 * r110237;
        double r110239 = r110234 + r110238;
        return r110239;
}

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