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 r194892 = x;
        double r194893 = r194892 * r194892;
        double r194894 = y;
        double r194895 = 4.0;
        double r194896 = r194894 * r194895;
        double r194897 = z;
        double r194898 = r194896 * r194897;
        double r194899 = r194893 - r194898;
        return r194899;
}
↓
double f(double x, double y, double z) {
        double r194900 = x;
        double r194901 = r194900 * r194900;
        double r194902 = y;
        double r194903 = 4.0;
        double r194904 = r194902 * r194903;
        double r194905 = z;
        double r194906 = r194904 * r194905;
        double r194907 = r194901 - r194906;
        return r194907;
}

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