Average Error: 0.0 → 0.0
Time: 4.9s
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 r230246 = x;
        double r230247 = y;
        double r230248 = 4.0;
        double r230249 = r230247 * r230248;
        double r230250 = z;
        double r230251 = r230249 * r230250;
        double r230252 = r230246 - r230251;
        return r230252;
}
↓
double f(double x, double y, double z) {
        double r230253 = x;
        double r230254 = y;
        double r230255 = 4.0;
        double r230256 = r230254 * r230255;
        double r230257 = z;
        double r230258 = r230256 * r230257;
        double r230259 = r230253 - r230258;
        return r230259;
}

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