Average Error: 0.0 → 0.0
Time: 4.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 r150745 = x;
        double r150746 = r150745 * r150745;
        double r150747 = y;
        double r150748 = 4.0;
        double r150749 = r150747 * r150748;
        double r150750 = z;
        double r150751 = r150749 * r150750;
        double r150752 = r150746 - r150751;
        return r150752;
}
↓
double f(double x, double y, double z) {
        double r150753 = x;
        double r150754 = r150753 * r150753;
        double r150755 = y;
        double r150756 = 4.0;
        double r150757 = r150755 * r150756;
        double r150758 = z;
        double r150759 = r150757 * r150758;
        double r150760 = r150754 - r150759;
        return r150760;
}

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