Average Error: 0.0 → 0.0
Time: 2.8s
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 r114448 = x;
        double r114449 = r114448 * r114448;
        double r114450 = y;
        double r114451 = 4.0;
        double r114452 = r114450 * r114451;
        double r114453 = z;
        double r114454 = r114452 * r114453;
        double r114455 = r114449 - r114454;
        return r114455;
}
↓
double f(double x, double y, double z) {
        double r114456 = x;
        double r114457 = r114456 * r114456;
        double r114458 = y;
        double r114459 = 4.0;
        double r114460 = r114458 * r114459;
        double r114461 = z;
        double r114462 = r114460 * r114461;
        double r114463 = r114457 - r114462;
        return r114463;
}

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