Average Error: 0.0 → 0.0
Time: 10.8s
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 r161217 = x;
        double r161218 = y;
        double r161219 = r161217 * r161218;
        double r161220 = 1.0;
        double r161221 = r161217 - r161220;
        double r161222 = z;
        double r161223 = r161221 * r161222;
        double r161224 = r161219 + r161223;
        return r161224;
}
↓
double f(double x, double y, double z) {
        double r161225 = x;
        double r161226 = y;
        double r161227 = r161225 * r161226;
        double r161228 = 1.0;
        double r161229 = r161225 - r161228;
        double r161230 = z;
        double r161231 = r161229 * r161230;
        double r161232 = r161227 + r161231;
        return r161232;
}

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)))