Average Error: 0.0 → 0.0
Time: 2.5s
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 r207301 = x;
        double r207302 = r207301 * r207301;
        double r207303 = y;
        double r207304 = 4.0;
        double r207305 = r207303 * r207304;
        double r207306 = z;
        double r207307 = r207305 * r207306;
        double r207308 = r207302 - r207307;
        return r207308;
}
↓
double f(double x, double y, double z) {
        double r207309 = x;
        double r207310 = r207309 * r207309;
        double r207311 = y;
        double r207312 = 4.0;
        double r207313 = r207311 * r207312;
        double r207314 = z;
        double r207315 = r207313 * r207314;
        double r207316 = r207310 - r207315;
        return r207316;
}

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)))