Average Error: 0.0 → 0.0
Time: 8.2s
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 r204162 = x;
        double r204163 = r204162 * r204162;
        double r204164 = y;
        double r204165 = 4.0;
        double r204166 = r204164 * r204165;
        double r204167 = z;
        double r204168 = r204166 * r204167;
        double r204169 = r204163 - r204168;
        return r204169;
}
↓
double f(double x, double y, double z) {
        double r204170 = x;
        double r204171 = r204170 * r204170;
        double r204172 = y;
        double r204173 = 4.0;
        double r204174 = r204172 * r204173;
        double r204175 = z;
        double r204176 = r204174 * r204175;
        double r204177 = r204171 - r204176;
        return r204177;
}

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