Average Error: 0.0 → 0.0
Time: 10.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 r114920 = x;
        double r114921 = y;
        double r114922 = r114920 * r114921;
        double r114923 = 1.0;
        double r114924 = r114920 - r114923;
        double r114925 = z;
        double r114926 = r114924 * r114925;
        double r114927 = r114922 + r114926;
        return r114927;
}
↓
double f(double x, double y, double z) {
        double r114928 = x;
        double r114929 = y;
        double r114930 = r114928 * r114929;
        double r114931 = 1.0;
        double r114932 = r114928 - r114931;
        double r114933 = z;
        double r114934 = r114932 * r114933;
        double r114935 = r114930 + r114934;
        return r114935;
}

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