Average Error: 0.0 → 0.0
Time: 5.3s
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 r212195 = x;
        double r212196 = y;
        double r212197 = r212195 * r212196;
        double r212198 = 1.0;
        double r212199 = r212195 - r212198;
        double r212200 = z;
        double r212201 = r212199 * r212200;
        double r212202 = r212197 + r212201;
        return r212202;
}
↓
double f(double x, double y, double z) {
        double r212203 = x;
        double r212204 = y;
        double r212205 = r212203 * r212204;
        double r212206 = 1.0;
        double r212207 = r212203 - r212206;
        double r212208 = z;
        double r212209 = r212207 * r212208;
        double r212210 = r212205 + r212209;
        return r212210;
}

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