Average Error: 0.0 → 0.0
Time: 2.6s
Precision: 64
\[\left(x \cdot x\right) \cdot 2 - 1\]
↓
\[\left(x \cdot x\right) \cdot 2 - 1\]
\left(x \cdot x\right) \cdot 2 - 1
↓
\left(x \cdot x\right) \cdot 2 - 1
double f(double x) {
        double r13734 = x;
        double r13735 = r13734 * r13734;
        double r13736 = 2.0;
        double r13737 = r13735 * r13736;
        double r13738 = 1.0;
        double r13739 = r13737 - r13738;
        return r13739;
}
↓
double f(double x) {
        double r13740 = x;
        double r13741 = r13740 * r13740;
        double r13742 = 2.0;
        double r13743 = r13741 * r13742;
        double r13744 = 1.0;
        double r13745 = r13743 - r13744;
        return r13745;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[\left(x \cdot x\right) \cdot 2 - 1\]

  2. Final simplification0.0

    \[\leadsto \left(x \cdot x\right) \cdot 2 - 1\]

Reproduce

herbie shell --seed 2020045 
(FPCore (x)
  :name "Numeric.SpecFunctions:logGammaCorrection from math-functions-0.1.5.2"
  :precision binary64
  (- (* (* x x) 2) 1))