Average Error: 0.0 → 0.0
Time: 2.0s
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 r169065 = x;
        double r169066 = y;
        double r169067 = r169065 * r169066;
        double r169068 = 1.0;
        double r169069 = r169065 - r169068;
        double r169070 = z;
        double r169071 = r169069 * r169070;
        double r169072 = r169067 + r169071;
        return r169072;
}
↓
double f(double x, double y, double z) {
        double r169073 = x;
        double r169074 = y;
        double r169075 = r169073 * r169074;
        double r169076 = 1.0;
        double r169077 = r169073 - r169076;
        double r169078 = z;
        double r169079 = r169077 * r169078;
        double r169080 = r169075 + r169079;
        return r169080;
}

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