Average Error: 0.0 → 0.0
Time: 9.6s
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 r242640 = x;
        double r242641 = y;
        double r242642 = r242640 * r242641;
        double r242643 = 1.0;
        double r242644 = r242640 - r242643;
        double r242645 = z;
        double r242646 = r242644 * r242645;
        double r242647 = r242642 + r242646;
        return r242647;
}
↓
double f(double x, double y, double z) {
        double r242648 = x;
        double r242649 = y;
        double r242650 = r242648 * r242649;
        double r242651 = 1.0;
        double r242652 = r242648 - r242651;
        double r242653 = z;
        double r242654 = r242652 * r242653;
        double r242655 = r242650 + r242654;
        return r242655;
}

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