Average Error: 0.1 → 0.1
Time: 4.1s
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 r125390 = x;
        double r125391 = r125390 * r125390;
        double r125392 = y;
        double r125393 = 4.0;
        double r125394 = r125392 * r125393;
        double r125395 = z;
        double r125396 = r125394 * r125395;
        double r125397 = r125391 - r125396;
        return r125397;
}
↓
double f(double x, double y, double z) {
        double r125398 = x;
        double r125399 = r125398 * r125398;
        double r125400 = y;
        double r125401 = 4.0;
        double r125402 = r125400 * r125401;
        double r125403 = z;
        double r125404 = r125402 * r125403;
        double r125405 = r125399 - r125404;
        return r125405;
}

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