Average Error: 0.0 → 0.0
Time: 9.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 r139986 = x;
        double r139987 = y;
        double r139988 = r139986 * r139987;
        double r139989 = 1.0;
        double r139990 = r139986 - r139989;
        double r139991 = z;
        double r139992 = r139990 * r139991;
        double r139993 = r139988 + r139992;
        return r139993;
}
↓
double f(double x, double y, double z) {
        double r139994 = x;
        double r139995 = y;
        double r139996 = r139994 * r139995;
        double r139997 = 1.0;
        double r139998 = r139994 - r139997;
        double r139999 = z;
        double r140000 = r139998 * r139999;
        double r140001 = r139996 + r140000;
        return r140001;
}

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