Average Error: 0.0 → 0.0
Time: 736.0ms
Precision: 64
\[x - \left(y \cdot 4\right) \cdot z\]
↓
\[x - \left(y \cdot 4\right) \cdot z\]
x - \left(y \cdot 4\right) \cdot z
↓
x - \left(y \cdot 4\right) \cdot z
double f(double x, double y, double z) {
        double r300571 = x;
        double r300572 = y;
        double r300573 = 4.0;
        double r300574 = r300572 * r300573;
        double r300575 = z;
        double r300576 = r300574 * r300575;
        double r300577 = r300571 - r300576;
        return r300577;
}
↓
double f(double x, double y, double z) {
        double r300578 = x;
        double r300579 = y;
        double r300580 = 4.0;
        double r300581 = r300579 * r300580;
        double r300582 = z;
        double r300583 = r300581 * r300582;
        double r300584 = r300578 - r300583;
        return r300584;
}

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 - \left(y \cdot 4\right) \cdot z\]

  2. Final simplification0.0

    \[\leadsto x - \left(y \cdot 4\right) \cdot z\]

Reproduce

herbie shell --seed 2020100 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, A"
  :precision binary64
  (- x (* (* y 4) z)))