Average Error: 0.0 → 0.0
Time: 12.4s
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 r141880 = x;
        double r141881 = r141880 * r141880;
        double r141882 = y;
        double r141883 = 4.0;
        double r141884 = r141882 * r141883;
        double r141885 = z;
        double r141886 = r141884 * r141885;
        double r141887 = r141881 - r141886;
        return r141887;
}
↓
double f(double x, double y, double z) {
        double r141888 = x;
        double r141889 = r141888 * r141888;
        double r141890 = y;
        double r141891 = 4.0;
        double r141892 = r141890 * r141891;
        double r141893 = z;
        double r141894 = r141892 * r141893;
        double r141895 = r141889 - r141894;
        return r141895;
}

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