Average Error: 0.0 → 0.0
Time: 2.7s
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 r123535 = x;
        double r123536 = r123535 * r123535;
        double r123537 = y;
        double r123538 = 4.0;
        double r123539 = r123537 * r123538;
        double r123540 = z;
        double r123541 = r123539 * r123540;
        double r123542 = r123536 - r123541;
        return r123542;
}
↓
double f(double x, double y, double z) {
        double r123543 = x;
        double r123544 = r123543 * r123543;
        double r123545 = y;
        double r123546 = 4.0;
        double r123547 = r123545 * r123546;
        double r123548 = z;
        double r123549 = r123547 * r123548;
        double r123550 = r123544 - r123549;
        return r123550;
}

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