Average Error: 0.0 → 0.0
Time: 3.4s
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 r148574 = x;
        double r148575 = y;
        double r148576 = 4.0;
        double r148577 = r148575 * r148576;
        double r148578 = z;
        double r148579 = r148577 * r148578;
        double r148580 = r148574 - r148579;
        return r148580;
}
↓
double f(double x, double y, double z) {
        double r148581 = x;
        double r148582 = y;
        double r148583 = 4.0;
        double r148584 = r148582 * r148583;
        double r148585 = z;
        double r148586 = r148584 * r148585;
        double r148587 = r148581 - r148586;
        return r148587;
}

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