Average Error: 0.0 → 0.0
Time: 10.8s
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 r135201 = x;
        double r135202 = r135201 * r135201;
        double r135203 = y;
        double r135204 = 4.0;
        double r135205 = r135203 * r135204;
        double r135206 = z;
        double r135207 = r135205 * r135206;
        double r135208 = r135202 - r135207;
        return r135208;
}
↓
double f(double x, double y, double z) {
        double r135209 = x;
        double r135210 = r135209 * r135209;
        double r135211 = y;
        double r135212 = 4.0;
        double r135213 = r135211 * r135212;
        double r135214 = z;
        double r135215 = r135213 * r135214;
        double r135216 = r135210 - r135215;
        return r135216;
}

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