Average Error: 0.1 → 0.1
Time: 2.6s
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 r199785 = x;
        double r199786 = r199785 * r199785;
        double r199787 = y;
        double r199788 = 4.0;
        double r199789 = r199787 * r199788;
        double r199790 = z;
        double r199791 = r199789 * r199790;
        double r199792 = r199786 - r199791;
        return r199792;
}
↓
double f(double x, double y, double z) {
        double r199793 = x;
        double r199794 = r199793 * r199793;
        double r199795 = y;
        double r199796 = 4.0;
        double r199797 = r199795 * r199796;
        double r199798 = z;
        double r199799 = r199797 * r199798;
        double r199800 = r199794 - r199799;
        return r199800;
}

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