Average Error: 0.0 → 0.0
Time: 2.6s
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 r196608 = x;
        double r196609 = r196608 * r196608;
        double r196610 = y;
        double r196611 = 4.0;
        double r196612 = r196610 * r196611;
        double r196613 = z;
        double r196614 = r196612 * r196613;
        double r196615 = r196609 - r196614;
        return r196615;
}
↓
double f(double x, double y, double z) {
        double r196616 = x;
        double r196617 = r196616 * r196616;
        double r196618 = y;
        double r196619 = 4.0;
        double r196620 = r196618 * r196619;
        double r196621 = z;
        double r196622 = r196620 * r196621;
        double r196623 = r196617 - r196622;
        return r196623;
}

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