Average Error: 0.0 → 0.0
Time: 545.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 r267529 = x;
        double r267530 = y;
        double r267531 = 4.0;
        double r267532 = r267530 * r267531;
        double r267533 = z;
        double r267534 = r267532 * r267533;
        double r267535 = r267529 - r267534;
        return r267535;
}
↓
double f(double x, double y, double z) {
        double r267536 = x;
        double r267537 = y;
        double r267538 = 4.0;
        double r267539 = r267537 * r267538;
        double r267540 = z;
        double r267541 = r267539 * r267540;
        double r267542 = r267536 - r267541;
        return r267542;
}

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