Average Error: 0.0 → 0.0
Time: 2.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 r180294 = x;
        double r180295 = r180294 * r180294;
        double r180296 = y;
        double r180297 = 4.0;
        double r180298 = r180296 * r180297;
        double r180299 = z;
        double r180300 = r180298 * r180299;
        double r180301 = r180295 - r180300;
        return r180301;
}
↓
double f(double x, double y, double z) {
        double r180302 = x;
        double r180303 = r180302 * r180302;
        double r180304 = y;
        double r180305 = 4.0;
        double r180306 = r180304 * r180305;
        double r180307 = z;
        double r180308 = r180306 * r180307;
        double r180309 = r180303 - r180308;
        return r180309;
}

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 2019354 
(FPCore (x y z)
  :name "Graphics.Rasterific.QuadraticFormula:discriminant from Rasterific-0.6.1"
  :precision binary64
  (- (* x x) (* (* y 4) z)))