Average Error: 0.0 → 0.0
Time: 4.1s
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 r110984 = x;
        double r110985 = r110984 * r110984;
        double r110986 = y;
        double r110987 = 4.0;
        double r110988 = r110986 * r110987;
        double r110989 = z;
        double r110990 = r110988 * r110989;
        double r110991 = r110985 - r110990;
        return r110991;
}
↓
double f(double x, double y, double z) {
        double r110992 = x;
        double r110993 = r110992 * r110992;
        double r110994 = y;
        double r110995 = 4.0;
        double r110996 = r110994 * r110995;
        double r110997 = z;
        double r110998 = r110996 * r110997;
        double r110999 = r110993 - r110998;
        return r110999;
}

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