Average Error: 0.0 → 0.0
Time: 5.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 r737 = x;
        double r738 = r737 * r737;
        double r739 = y;
        double r740 = 4.0;
        double r741 = r739 * r740;
        double r742 = z;
        double r743 = r741 * r742;
        double r744 = r738 - r743;
        return r744;
}
↓
double f(double x, double y, double z) {
        double r745 = x;
        double r746 = r745 * r745;
        double r747 = y;
        double r748 = 4.0;
        double r749 = r747 * r748;
        double r750 = z;
        double r751 = r749 * r750;
        double r752 = r746 - r751;
        return r752;
}

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