Average Error: 0.0 → 0.0
Time: 2.0s
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 r166511 = x;
        double r166512 = r166511 * r166511;
        double r166513 = y;
        double r166514 = 4.0;
        double r166515 = r166513 * r166514;
        double r166516 = z;
        double r166517 = r166515 * r166516;
        double r166518 = r166512 - r166517;
        return r166518;
}
↓
double f(double x, double y, double z) {
        double r166519 = x;
        double r166520 = r166519 * r166519;
        double r166521 = y;
        double r166522 = 4.0;
        double r166523 = r166521 * r166522;
        double r166524 = z;
        double r166525 = r166523 * r166524;
        double r166526 = r166520 - r166525;
        return r166526;
}

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