Average Error: 0.1 → 0.1
Time: 8.9s
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 r1457046 = x;
        double r1457047 = y;
        double r1457048 = 4.0;
        double r1457049 = r1457047 * r1457048;
        double r1457050 = z;
        double r1457051 = r1457049 * r1457050;
        double r1457052 = r1457046 - r1457051;
        return r1457052;
}

double f(double x, double y, double z) {
        double r1457053 = x;
        double r1457054 = y;
        double r1457055 = 4.0;
        double r1457056 = r1457054 * r1457055;
        double r1457057 = z;
        double r1457058 = r1457056 * r1457057;
        double r1457059 = r1457053 - r1457058;
        return r1457059;
}

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