Average Error: 0.0 → 0.0
Time: 1.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 r176432 = x;
        double r176433 = r176432 * r176432;
        double r176434 = y;
        double r176435 = 4.0;
        double r176436 = r176434 * r176435;
        double r176437 = z;
        double r176438 = r176436 * r176437;
        double r176439 = r176433 - r176438;
        return r176439;
}
↓
double f(double x, double y, double z) {
        double r176440 = x;
        double r176441 = r176440 * r176440;
        double r176442 = y;
        double r176443 = 4.0;
        double r176444 = r176442 * r176443;
        double r176445 = z;
        double r176446 = r176444 * r176445;
        double r176447 = r176441 - r176446;
        return r176447;
}

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