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 r97508 = x;
        double r97509 = y;
        double r97510 = r97508 * r97509;
        double r97511 = 1.0;
        double r97512 = r97508 - r97511;
        double r97513 = z;
        double r97514 = r97512 * r97513;
        double r97515 = r97510 + r97514;
        return r97515;
}
↓
double f(double x, double y, double z) {
        double r97516 = x;
        double r97517 = y;
        double r97518 = r97516 * r97517;
        double r97519 = 1.0;
        double r97520 = r97516 - r97519;
        double r97521 = z;
        double r97522 = r97520 * r97521;
        double r97523 = r97518 + r97522;
        return r97523;
}

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