Average Error: 0.1 → 0.1
Time: 2.4s
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 r231353 = x;
        double r231354 = r231353 * r231353;
        double r231355 = y;
        double r231356 = 4.0;
        double r231357 = r231355 * r231356;
        double r231358 = z;
        double r231359 = r231357 * r231358;
        double r231360 = r231354 - r231359;
        return r231360;
}
↓
double f(double x, double y, double z) {
        double r231361 = x;
        double r231362 = r231361 * r231361;
        double r231363 = y;
        double r231364 = 4.0;
        double r231365 = r231363 * r231364;
        double r231366 = z;
        double r231367 = r231365 * r231366;
        double r231368 = r231362 - r231367;
        return r231368;
}

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.1

    \[x \cdot x - \left(y \cdot 4\right) \cdot z\]

  2. Final simplification0.1

    \[\leadsto x \cdot x - \left(y \cdot 4\right) \cdot z\]

Reproduce

herbie shell --seed 2020081 +o rules:numerics
(FPCore (x y z)
  :name "Graphics.Rasterific.QuadraticFormula:discriminant from Rasterific-0.6.1"
  :precision binary64
  (- (* x x) (* (* y 4) z)))