Average Error: 0.1 → 0.1
Time: 1.9s
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 r199450 = x;
        double r199451 = r199450 * r199450;
        double r199452 = y;
        double r199453 = 4.0;
        double r199454 = r199452 * r199453;
        double r199455 = z;
        double r199456 = r199454 * r199455;
        double r199457 = r199451 - r199456;
        return r199457;
}
↓
double f(double x, double y, double z) {
        double r199458 = x;
        double r199459 = r199458 * r199458;
        double r199460 = y;
        double r199461 = 4.0;
        double r199462 = r199460 * r199461;
        double r199463 = z;
        double r199464 = r199462 * r199463;
        double r199465 = r199459 - r199464;
        return r199465;
}

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