Average Error: 0.1 → 0.1
Time: 2.3s
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 r160829 = x;
        double r160830 = r160829 * r160829;
        double r160831 = y;
        double r160832 = 4.0;
        double r160833 = r160831 * r160832;
        double r160834 = z;
        double r160835 = r160833 * r160834;
        double r160836 = r160830 - r160835;
        return r160836;
}

double f(double x, double y, double z) {
        double r160837 = x;
        double r160838 = r160837 * r160837;
        double r160839 = y;
        double r160840 = 4.0;
        double r160841 = r160839 * r160840;
        double r160842 = z;
        double r160843 = r160841 * r160842;
        double r160844 = r160838 - r160843;
        return r160844;
}

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