Average Error: 0.0 → 0.0
Time: 4.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 r223456 = x;
        double r223457 = r223456 * r223456;
        double r223458 = y;
        double r223459 = 4.0;
        double r223460 = r223458 * r223459;
        double r223461 = z;
        double r223462 = r223460 * r223461;
        double r223463 = r223457 - r223462;
        return r223463;
}
↓
double f(double x, double y, double z) {
        double r223464 = x;
        double r223465 = r223464 * r223464;
        double r223466 = y;
        double r223467 = 4.0;
        double r223468 = r223466 * r223467;
        double r223469 = z;
        double r223470 = r223468 * r223469;
        double r223471 = r223465 - r223470;
        return r223471;
}

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