Average Error: 0.0 → 0.0
Time: 4.5s
Precision: 64
\[x \cdot x - \left(y \cdot 4\right) \cdot z\]
\[x \cdot x - \left(y \cdot 4\right) \cdot z\]
x \cdot x - \left(y \cdot 4\right) \cdot z
x \cdot x - \left(y \cdot 4\right) \cdot z
double f(double x, double y, double z) {
        double r156256 = x;
        double r156257 = r156256 * r156256;
        double r156258 = y;
        double r156259 = 4.0;
        double r156260 = r156258 * r156259;
        double r156261 = z;
        double r156262 = r156260 * r156261;
        double r156263 = r156257 - r156262;
        return r156263;
}

double f(double x, double y, double z) {
        double r156264 = x;
        double r156265 = r156264 * r156264;
        double r156266 = y;
        double r156267 = 4.0;
        double r156268 = r156266 * r156267;
        double r156269 = z;
        double r156270 = r156268 * r156269;
        double r156271 = r156265 - r156270;
        return r156271;
}

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 \cdot x - \left(y \cdot 4\right) \cdot z\]
  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2019323 
(FPCore (x y z)
  :name "Graphics.Rasterific.QuadraticFormula:discriminant from Rasterific-0.6.1"
  :precision binary64
  (- (* x x) (* (* y 4) z)))