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 r252546 = x;
        double r252547 = r252546 * r252546;
        double r252548 = y;
        double r252549 = 4.0;
        double r252550 = r252548 * r252549;
        double r252551 = z;
        double r252552 = r252550 * r252551;
        double r252553 = r252547 - r252552;
        return r252553;
}
↓
double f(double x, double y, double z) {
        double r252554 = x;
        double r252555 = r252554 * r252554;
        double r252556 = y;
        double r252557 = 4.0;
        double r252558 = r252556 * r252557;
        double r252559 = z;
        double r252560 = r252558 * r252559;
        double r252561 = r252555 - r252560;
        return r252561;
}

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