Average Error: 0.0 → 0.0
Time: 5.1s
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 r187315 = x;
        double r187316 = y;
        double r187317 = r187315 * r187316;
        double r187318 = 1.0;
        double r187319 = r187315 - r187318;
        double r187320 = z;
        double r187321 = r187319 * r187320;
        double r187322 = r187317 + r187321;
        return r187322;
}
↓
double f(double x, double y, double z) {
        double r187323 = x;
        double r187324 = y;
        double r187325 = r187323 * r187324;
        double r187326 = 1.0;
        double r187327 = r187323 - r187326;
        double r187328 = z;
        double r187329 = r187327 * r187328;
        double r187330 = r187325 + r187329;
        return r187330;
}

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