Average Error: 0.0 → 0.0
Time: 2.4s
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 r168090 = x;
        double r168091 = y;
        double r168092 = r168090 * r168091;
        double r168093 = 1.0;
        double r168094 = r168090 - r168093;
        double r168095 = z;
        double r168096 = r168094 * r168095;
        double r168097 = r168092 + r168096;
        return r168097;
}
↓
double f(double x, double y, double z) {
        double r168098 = x;
        double r168099 = y;
        double r168100 = r168098 * r168099;
        double r168101 = 1.0;
        double r168102 = r168098 - r168101;
        double r168103 = z;
        double r168104 = r168102 * r168103;
        double r168105 = r168100 + r168104;
        return r168105;
}

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