Average Error: 0.0 → 0.0
Time: 4.5s
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 r147129 = x;
        double r147130 = r147129 * r147129;
        double r147131 = y;
        double r147132 = 4.0;
        double r147133 = r147131 * r147132;
        double r147134 = z;
        double r147135 = r147133 * r147134;
        double r147136 = r147130 - r147135;
        return r147136;
}
↓
double f(double x, double y, double z) {
        double r147137 = x;
        double r147138 = r147137 * r147137;
        double r147139 = y;
        double r147140 = 4.0;
        double r147141 = r147139 * r147140;
        double r147142 = z;
        double r147143 = r147141 * r147142;
        double r147144 = r147138 - r147143;
        return r147144;
}

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)))