Average Error: 0.0 → 0.0
Time: 638.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 r209165 = x;
        double r209166 = y;
        double r209167 = 4.0;
        double r209168 = r209166 * r209167;
        double r209169 = z;
        double r209170 = r209168 * r209169;
        double r209171 = r209165 - r209170;
        return r209171;
}
↓
double f(double x, double y, double z) {
        double r209172 = x;
        double r209173 = y;
        double r209174 = 4.0;
        double r209175 = r209173 * r209174;
        double r209176 = z;
        double r209177 = r209175 * r209176;
        double r209178 = r209172 - r209177;
        return r209178;
}

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