Average Error: 0.1 → 0.1
Time: 2.3s
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 r207952 = x;
        double r207953 = r207952 * r207952;
        double r207954 = y;
        double r207955 = 4.0;
        double r207956 = r207954 * r207955;
        double r207957 = z;
        double r207958 = r207956 * r207957;
        double r207959 = r207953 - r207958;
        return r207959;
}
↓
double f(double x, double y, double z) {
        double r207960 = x;
        double r207961 = r207960 * r207960;
        double r207962 = y;
        double r207963 = 4.0;
        double r207964 = r207962 * r207963;
        double r207965 = z;
        double r207966 = r207964 * r207965;
        double r207967 = r207961 - r207966;
        return r207967;
}

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