Average Error: 0.0 → 0.0
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 r145677 = x;
        double r145678 = r145677 * r145677;
        double r145679 = y;
        double r145680 = 4.0;
        double r145681 = r145679 * r145680;
        double r145682 = z;
        double r145683 = r145681 * r145682;
        double r145684 = r145678 - r145683;
        return r145684;
}
↓
double f(double x, double y, double z) {
        double r145685 = x;
        double r145686 = r145685 * r145685;
        double r145687 = y;
        double r145688 = 4.0;
        double r145689 = r145687 * r145688;
        double r145690 = z;
        double r145691 = r145689 * r145690;
        double r145692 = r145686 - r145691;
        return r145692;
}

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