Average Error: 0.0 → 0.0
Time: 746.0ms
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 r166991 = x;
        double r166992 = r166991 * r166991;
        double r166993 = y;
        double r166994 = 4.0;
        double r166995 = r166993 * r166994;
        double r166996 = z;
        double r166997 = r166995 * r166996;
        double r166998 = r166992 - r166997;
        return r166998;
}
↓
double f(double x, double y, double z) {
        double r166999 = x;
        double r167000 = r166999 * r166999;
        double r167001 = y;
        double r167002 = 4.0;
        double r167003 = r167001 * r167002;
        double r167004 = z;
        double r167005 = r167003 * r167004;
        double r167006 = r167000 - r167005;
        return r167006;
}

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