Average Error: 0.1 → 0.1
Time: 2.5s
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 r155682 = x;
        double r155683 = r155682 * r155682;
        double r155684 = y;
        double r155685 = 4.0;
        double r155686 = r155684 * r155685;
        double r155687 = z;
        double r155688 = r155686 * r155687;
        double r155689 = r155683 - r155688;
        return r155689;
}
↓
double f(double x, double y, double z) {
        double r155690 = x;
        double r155691 = r155690 * r155690;
        double r155692 = y;
        double r155693 = 4.0;
        double r155694 = r155692 * r155693;
        double r155695 = z;
        double r155696 = r155694 * r155695;
        double r155697 = r155691 - r155696;
        return r155697;
}

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.1

    \[x \cdot x - \left(y \cdot 4\right) \cdot z\]

  2. Final simplification0.1

    \[\leadsto x \cdot x - \left(y \cdot 4\right) \cdot z\]

Reproduce

herbie shell --seed 2020027 
(FPCore (x y z)
  :name "Graphics.Rasterific.QuadraticFormula:discriminant from Rasterific-0.6.1"
  :precision binary64
  (- (* x x) (* (* y 4) z)))