Average Error: 0.1 → 0.1
Time: 4.2s
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 r194464 = x;
        double r194465 = r194464 * r194464;
        double r194466 = y;
        double r194467 = 4.0;
        double r194468 = r194466 * r194467;
        double r194469 = z;
        double r194470 = r194468 * r194469;
        double r194471 = r194465 - r194470;
        return r194471;
}
↓
double f(double x, double y, double z) {
        double r194472 = x;
        double r194473 = r194472 * r194472;
        double r194474 = y;
        double r194475 = 4.0;
        double r194476 = r194474 * r194475;
        double r194477 = z;
        double r194478 = r194476 * r194477;
        double r194479 = r194473 - r194478;
        return r194479;
}

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