Average Error: 0.0 → 0.0
Time: 4.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 r181989 = x;
        double r181990 = r181989 * r181989;
        double r181991 = y;
        double r181992 = 4.0;
        double r181993 = r181991 * r181992;
        double r181994 = z;
        double r181995 = r181993 * r181994;
        double r181996 = r181990 - r181995;
        return r181996;
}
↓
double f(double x, double y, double z) {
        double r181997 = x;
        double r181998 = r181997 * r181997;
        double r181999 = y;
        double r182000 = 4.0;
        double r182001 = r181999 * r182000;
        double r182002 = z;
        double r182003 = r182001 * r182002;
        double r182004 = r181998 - r182003;
        return r182004;
}

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