Average Error: 0.0 → 0.0
Time: 2.3s
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 r200453 = x;
        double r200454 = r200453 * r200453;
        double r200455 = y;
        double r200456 = 4.0;
        double r200457 = r200455 * r200456;
        double r200458 = z;
        double r200459 = r200457 * r200458;
        double r200460 = r200454 - r200459;
        return r200460;
}
↓
double f(double x, double y, double z) {
        double r200461 = x;
        double r200462 = r200461 * r200461;
        double r200463 = y;
        double r200464 = 4.0;
        double r200465 = r200463 * r200464;
        double r200466 = z;
        double r200467 = r200465 * r200466;
        double r200468 = r200462 - r200467;
        return r200468;
}

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