Average Error: 0.1 → 0.1
Time: 4.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 r191956 = x;
        double r191957 = r191956 * r191956;
        double r191958 = y;
        double r191959 = 4.0;
        double r191960 = r191958 * r191959;
        double r191961 = z;
        double r191962 = r191960 * r191961;
        double r191963 = r191957 - r191962;
        return r191963;
}
↓
double f(double x, double y, double z) {
        double r191964 = x;
        double r191965 = r191964 * r191964;
        double r191966 = y;
        double r191967 = 4.0;
        double r191968 = r191966 * r191967;
        double r191969 = z;
        double r191970 = r191968 * r191969;
        double r191971 = r191965 - r191970;
        return r191971;
}

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