Average Error: 0.0 → 0.0
Time: 761.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 r142575 = x;
        double r142576 = r142575 * r142575;
        double r142577 = y;
        double r142578 = 4.0;
        double r142579 = r142577 * r142578;
        double r142580 = z;
        double r142581 = r142579 * r142580;
        double r142582 = r142576 - r142581;
        return r142582;
}
↓
double f(double x, double y, double z) {
        double r142583 = x;
        double r142584 = r142583 * r142583;
        double r142585 = y;
        double r142586 = 4.0;
        double r142587 = r142585 * r142586;
        double r142588 = z;
        double r142589 = r142587 * r142588;
        double r142590 = r142584 - r142589;
        return r142590;
}

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