Average Error: 0.0 → 0.0
Time: 615.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 r185165 = x;
        double r185166 = y;
        double r185167 = 4.0;
        double r185168 = r185166 * r185167;
        double r185169 = z;
        double r185170 = r185168 * r185169;
        double r185171 = r185165 - r185170;
        return r185171;
}
↓
double f(double x, double y, double z) {
        double r185172 = x;
        double r185173 = y;
        double r185174 = 4.0;
        double r185175 = r185173 * r185174;
        double r185176 = z;
        double r185177 = r185175 * r185176;
        double r185178 = r185172 - r185177;
        return r185178;
}

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