Average Error: 0.0 → 0.0
Time: 613.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 r191167 = x;
        double r191168 = y;
        double r191169 = 4.0;
        double r191170 = r191168 * r191169;
        double r191171 = z;
        double r191172 = r191170 * r191171;
        double r191173 = r191167 - r191172;
        return r191173;
}
↓
double f(double x, double y, double z) {
        double r191174 = x;
        double r191175 = y;
        double r191176 = 4.0;
        double r191177 = r191175 * r191176;
        double r191178 = z;
        double r191179 = r191177 * r191178;
        double r191180 = r191174 - r191179;
        return r191180;
}

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