Average Error: 0.1 → 0.1
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 r149780 = x;
        double r149781 = r149780 * r149780;
        double r149782 = y;
        double r149783 = 4.0;
        double r149784 = r149782 * r149783;
        double r149785 = z;
        double r149786 = r149784 * r149785;
        double r149787 = r149781 - r149786;
        return r149787;
}
↓
double f(double x, double y, double z) {
        double r149788 = x;
        double r149789 = r149788 * r149788;
        double r149790 = y;
        double r149791 = 4.0;
        double r149792 = r149790 * r149791;
        double r149793 = z;
        double r149794 = r149792 * r149793;
        double r149795 = r149789 - r149794;
        return r149795;
}

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