Average Error: 0.0 → 0.0
Time: 2.2s
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 r321197 = x;
        double r321198 = y;
        double r321199 = 4.0;
        double r321200 = r321198 * r321199;
        double r321201 = z;
        double r321202 = r321200 * r321201;
        double r321203 = r321197 - r321202;
        return r321203;
}
↓
double f(double x, double y, double z) {
        double r321204 = x;
        double r321205 = y;
        double r321206 = 4.0;
        double r321207 = r321205 * r321206;
        double r321208 = z;
        double r321209 = r321207 * r321208;
        double r321210 = r321204 - r321209;
        return r321210;
}

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