Average Error: 0.0 → 0.0
Time: 2.3s
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 r107910 = x;
        double r107911 = y;
        double r107912 = r107910 * r107911;
        double r107913 = 1.0;
        double r107914 = r107910 - r107913;
        double r107915 = z;
        double r107916 = r107914 * r107915;
        double r107917 = r107912 + r107916;
        return r107917;
}
↓
double f(double x, double y, double z) {
        double r107918 = x;
        double r107919 = y;
        double r107920 = r107918 * r107919;
        double r107921 = 1.0;
        double r107922 = r107918 - r107921;
        double r107923 = z;
        double r107924 = r107922 * r107923;
        double r107925 = r107920 + r107924;
        return r107925;
}

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