Average Error: 0.0 → 0.0
Time: 3.6s
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 r146539 = x;
        double r146540 = y;
        double r146541 = 4.0;
        double r146542 = r146540 * r146541;
        double r146543 = z;
        double r146544 = r146542 * r146543;
        double r146545 = r146539 - r146544;
        return r146545;
}
↓
double f(double x, double y, double z) {
        double r146546 = x;
        double r146547 = y;
        double r146548 = 4.0;
        double r146549 = r146547 * r146548;
        double r146550 = z;
        double r146551 = r146549 * r146550;
        double r146552 = r146546 - r146551;
        return r146552;
}

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 2019323 +o rules:numerics
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, A"
  :precision binary64
  (- x (* (* y 4) z)))