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 r155219 = x;
        double r155220 = y;
        double r155221 = 4.0;
        double r155222 = r155220 * r155221;
        double r155223 = z;
        double r155224 = r155222 * r155223;
        double r155225 = r155219 - r155224;
        return r155225;
}
↓
double f(double x, double y, double z) {
        double r155226 = x;
        double r155227 = y;
        double r155228 = 4.0;
        double r155229 = r155227 * r155228;
        double r155230 = z;
        double r155231 = r155229 * r155230;
        double r155232 = r155226 - r155231;
        return r155232;
}

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)))