Average Error: 0.0 → 0.0
Time: 7.2s
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 r753845 = x;
        double r753846 = r753845 * r753845;
        double r753847 = y;
        double r753848 = 4.0;
        double r753849 = r753847 * r753848;
        double r753850 = z;
        double r753851 = r753849 * r753850;
        double r753852 = r753846 - r753851;
        return r753852;
}
↓
double f(double x, double y, double z) {
        double r753853 = x;
        double r753854 = r753853 * r753853;
        double r753855 = y;
        double r753856 = 4.0;
        double r753857 = r753855 * r753856;
        double r753858 = z;
        double r753859 = r753857 * r753858;
        double r753860 = r753854 - r753859;
        return r753860;
}

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