Average Error: 0.0 → 0.0
Time: 3.3s
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 r99654 = x;
        double r99655 = r99654 * r99654;
        double r99656 = y;
        double r99657 = 4.0;
        double r99658 = r99656 * r99657;
        double r99659 = z;
        double r99660 = r99658 * r99659;
        double r99661 = r99655 - r99660;
        return r99661;
}
↓
double f(double x, double y, double z) {
        double r99662 = x;
        double r99663 = r99662 * r99662;
        double r99664 = y;
        double r99665 = 4.0;
        double r99666 = r99664 * r99665;
        double r99667 = z;
        double r99668 = r99666 * r99667;
        double r99669 = r99663 - r99668;
        return r99669;
}

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