Average Error: 0.0 → 0.0
Time: 2.7s
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 r144868 = x;
        double r144869 = y;
        double r144870 = r144868 * r144869;
        double r144871 = 1.0;
        double r144872 = r144868 - r144871;
        double r144873 = z;
        double r144874 = r144872 * r144873;
        double r144875 = r144870 + r144874;
        return r144875;
}
↓
double f(double x, double y, double z) {
        double r144876 = x;
        double r144877 = y;
        double r144878 = r144876 * r144877;
        double r144879 = 1.0;
        double r144880 = r144876 - r144879;
        double r144881 = z;
        double r144882 = r144880 * r144881;
        double r144883 = r144878 + r144882;
        return r144883;
}

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 2020057 +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)))