Average Error: 0.1 → 0.1
Time: 641.0ms
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 r194492 = x;
        double r194493 = r194492 * r194492;
        double r194494 = y;
        double r194495 = 4.0;
        double r194496 = r194494 * r194495;
        double r194497 = z;
        double r194498 = r194496 * r194497;
        double r194499 = r194493 - r194498;
        return r194499;
}
↓
double f(double x, double y, double z) {
        double r194500 = x;
        double r194501 = r194500 * r194500;
        double r194502 = y;
        double r194503 = 4.0;
        double r194504 = r194502 * r194503;
        double r194505 = z;
        double r194506 = r194504 * r194505;
        double r194507 = r194501 - r194506;
        return r194507;
}

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