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 r147246 = x;
        double r147247 = y;
        double r147248 = 4.0;
        double r147249 = r147247 * r147248;
        double r147250 = z;
        double r147251 = r147249 * r147250;
        double r147252 = r147246 - r147251;
        return r147252;
}
↓
double f(double x, double y, double z) {
        double r147253 = x;
        double r147254 = y;
        double r147255 = 4.0;
        double r147256 = r147254 * r147255;
        double r147257 = z;
        double r147258 = r147256 * r147257;
        double r147259 = r147253 - r147258;
        return r147259;
}

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