Average Error: 0.0 → 0.0
Time: 1.5s
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 r237661 = x;
        double r237662 = y;
        double r237663 = r237661 * r237662;
        double r237664 = 1.0;
        double r237665 = r237661 - r237664;
        double r237666 = z;
        double r237667 = r237665 * r237666;
        double r237668 = r237663 + r237667;
        return r237668;
}
↓
double f(double x, double y, double z) {
        double r237669 = x;
        double r237670 = y;
        double r237671 = r237669 * r237670;
        double r237672 = 1.0;
        double r237673 = r237669 - r237672;
        double r237674 = z;
        double r237675 = r237673 * r237674;
        double r237676 = r237671 + r237675;
        return r237676;
}

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