Average Error: 0.1 → 0.1
Time: 1.1s
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 r192462 = x;
        double r192463 = y;
        double r192464 = 4.0;
        double r192465 = r192463 * r192464;
        double r192466 = z;
        double r192467 = r192465 * r192466;
        double r192468 = r192462 - r192467;
        return r192468;
}

double f(double x, double y, double z) {
        double r192469 = x;
        double r192470 = y;
        double r192471 = 4.0;
        double r192472 = r192470 * r192471;
        double r192473 = z;
        double r192474 = r192472 * r192473;
        double r192475 = r192469 - r192474;
        return r192475;
}

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.1

    \[x - \left(y \cdot 4\right) \cdot z\]
  2. Final simplification0.1

    \[\leadsto x - \left(y \cdot 4\right) \cdot z\]

Reproduce

herbie shell --seed 2019294 
(FPCore (x y z)
  :name "Diagrams.Solve.Polynomial:quadForm from diagrams-solve-0.1, A"
  :precision binary64
  (- x (* (* y 4) z)))