Average Error: 0.0 → 0.0
Time: 2.8s
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 r178194 = x;
        double r178195 = r178194 * r178194;
        double r178196 = y;
        double r178197 = 4.0;
        double r178198 = r178196 * r178197;
        double r178199 = z;
        double r178200 = r178198 * r178199;
        double r178201 = r178195 - r178200;
        return r178201;
}
↓
double f(double x, double y, double z) {
        double r178202 = x;
        double r178203 = r178202 * r178202;
        double r178204 = y;
        double r178205 = 4.0;
        double r178206 = r178204 * r178205;
        double r178207 = z;
        double r178208 = r178206 * r178207;
        double r178209 = r178203 - r178208;
        return r178209;
}

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