Average Error: 0.0 → 0.0
Time: 3.2s
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 r186986 = x;
        double r186987 = y;
        double r186988 = r186986 * r186987;
        double r186989 = 1.0;
        double r186990 = r186986 - r186989;
        double r186991 = z;
        double r186992 = r186990 * r186991;
        double r186993 = r186988 + r186992;
        return r186993;
}
↓
double f(double x, double y, double z) {
        double r186994 = x;
        double r186995 = y;
        double r186996 = r186994 * r186995;
        double r186997 = 1.0;
        double r186998 = r186994 - r186997;
        double r186999 = z;
        double r187000 = r186998 * r186999;
        double r187001 = r186996 + r187000;
        return r187001;
}

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