Average Error: 0.0 → 0.0
Time: 1.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 r103336 = x;
        double r103337 = r103336 * r103336;
        double r103338 = y;
        double r103339 = 4.0;
        double r103340 = r103338 * r103339;
        double r103341 = z;
        double r103342 = r103340 * r103341;
        double r103343 = r103337 - r103342;
        return r103343;
}
↓
double f(double x, double y, double z) {
        double r103344 = x;
        double r103345 = r103344 * r103344;
        double r103346 = y;
        double r103347 = 4.0;
        double r103348 = r103346 * r103347;
        double r103349 = z;
        double r103350 = r103348 * r103349;
        double r103351 = r103345 - r103350;
        return r103351;
}

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