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 r194028 = x;
        double r194029 = r194028 * r194028;
        double r194030 = y;
        double r194031 = 4.0;
        double r194032 = r194030 * r194031;
        double r194033 = z;
        double r194034 = r194032 * r194033;
        double r194035 = r194029 - r194034;
        return r194035;
}
↓
double f(double x, double y, double z) {
        double r194036 = x;
        double r194037 = r194036 * r194036;
        double r194038 = y;
        double r194039 = 4.0;
        double r194040 = r194038 * r194039;
        double r194041 = z;
        double r194042 = r194040 * r194041;
        double r194043 = r194037 - r194042;
        return r194043;
}

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