Average Error: 0.1 → 0.1
Time: 9.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 r102873 = x;
        double r102874 = r102873 * r102873;
        double r102875 = y;
        double r102876 = 4.0;
        double r102877 = r102875 * r102876;
        double r102878 = z;
        double r102879 = r102877 * r102878;
        double r102880 = r102874 - r102879;
        return r102880;
}
↓
double f(double x, double y, double z) {
        double r102881 = x;
        double r102882 = r102881 * r102881;
        double r102883 = y;
        double r102884 = 4.0;
        double r102885 = r102883 * r102884;
        double r102886 = z;
        double r102887 = r102885 * r102886;
        double r102888 = r102882 - r102887;
        return r102888;
}

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