Average Error: 0.0 → 0.0
Time: 708.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 r195559 = x;
        double r195560 = r195559 * r195559;
        double r195561 = y;
        double r195562 = 4.0;
        double r195563 = r195561 * r195562;
        double r195564 = z;
        double r195565 = r195563 * r195564;
        double r195566 = r195560 - r195565;
        return r195566;
}
↓
double f(double x, double y, double z) {
        double r195567 = x;
        double r195568 = r195567 * r195567;
        double r195569 = y;
        double r195570 = 4.0;
        double r195571 = r195569 * r195570;
        double r195572 = z;
        double r195573 = r195571 * r195572;
        double r195574 = r195568 - r195573;
        return r195574;
}

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