Average Error: 0.0 → 0.0
Time: 562.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 r290325 = x;
        double r290326 = y;
        double r290327 = 4.0;
        double r290328 = r290326 * r290327;
        double r290329 = z;
        double r290330 = r290328 * r290329;
        double r290331 = r290325 - r290330;
        return r290331;
}
↓
double f(double x, double y, double z) {
        double r290332 = x;
        double r290333 = y;
        double r290334 = 4.0;
        double r290335 = r290333 * r290334;
        double r290336 = z;
        double r290337 = r290335 * r290336;
        double r290338 = r290332 - r290337;
        return r290338;
}

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