Average Error: 0.0 → 0.0
Time: 3.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 r161977 = x;
        double r161978 = r161977 * r161977;
        double r161979 = y;
        double r161980 = 4.0;
        double r161981 = r161979 * r161980;
        double r161982 = z;
        double r161983 = r161981 * r161982;
        double r161984 = r161978 - r161983;
        return r161984;
}
↓
double f(double x, double y, double z) {
        double r161985 = x;
        double r161986 = r161985 * r161985;
        double r161987 = y;
        double r161988 = 4.0;
        double r161989 = r161987 * r161988;
        double r161990 = z;
        double r161991 = r161989 * r161990;
        double r161992 = r161986 - r161991;
        return r161992;
}

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