Average Error: 0.1 → 0.1
Time: 7.7s
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 r132888 = x;
        double r132889 = r132888 * r132888;
        double r132890 = y;
        double r132891 = 4.0;
        double r132892 = r132890 * r132891;
        double r132893 = z;
        double r132894 = r132892 * r132893;
        double r132895 = r132889 - r132894;
        return r132895;
}
↓
double f(double x, double y, double z) {
        double r132896 = x;
        double r132897 = r132896 * r132896;
        double r132898 = y;
        double r132899 = 4.0;
        double r132900 = r132898 * r132899;
        double r132901 = z;
        double r132902 = r132900 * r132901;
        double r132903 = r132897 - r132902;
        return r132903;
}

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.1

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

  2. Final simplification0.1

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

Reproduce

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