Average Error: 0.0 → 0.0
Time: 1.8s
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 r196853 = x;
        double r196854 = r196853 * r196853;
        double r196855 = y;
        double r196856 = 4.0;
        double r196857 = r196855 * r196856;
        double r196858 = z;
        double r196859 = r196857 * r196858;
        double r196860 = r196854 - r196859;
        return r196860;
}
↓
double f(double x, double y, double z) {
        double r196861 = x;
        double r196862 = r196861 * r196861;
        double r196863 = y;
        double r196864 = 4.0;
        double r196865 = r196863 * r196864;
        double r196866 = z;
        double r196867 = r196865 * r196866;
        double r196868 = r196862 - r196867;
        return r196868;
}

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