Average Error: 0.0 → 0.0
Time: 5.0s
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 r272239 = x;
        double r272240 = y;
        double r272241 = 4.0;
        double r272242 = r272240 * r272241;
        double r272243 = z;
        double r272244 = r272242 * r272243;
        double r272245 = r272239 - r272244;
        return r272245;
}
↓
double f(double x, double y, double z) {
        double r272246 = x;
        double r272247 = y;
        double r272248 = 4.0;
        double r272249 = r272247 * r272248;
        double r272250 = z;
        double r272251 = r272249 * r272250;
        double r272252 = r272246 - r272251;
        return r272252;
}

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