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 r119144 = x;
        double r119145 = r119144 * r119144;
        double r119146 = y;
        double r119147 = 4.0;
        double r119148 = r119146 * r119147;
        double r119149 = z;
        double r119150 = r119148 * r119149;
        double r119151 = r119145 - r119150;
        return r119151;
}
↓
double f(double x, double y, double z) {
        double r119152 = x;
        double r119153 = r119152 * r119152;
        double r119154 = y;
        double r119155 = 4.0;
        double r119156 = r119154 * r119155;
        double r119157 = z;
        double r119158 = r119156 * r119157;
        double r119159 = r119153 - r119158;
        return r119159;
}

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