Average Error: 0.0 → 0.0
Time: 4.4s
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 r63418 = x;
        double r63419 = r63418 * r63418;
        double r63420 = 2.0;
        double r63421 = r63419 * r63420;
        double r63422 = 1.0;
        double r63423 = r63421 - r63422;
        return r63423;
}
↓
double f(double x) {
        double r63424 = x;
        double r63425 = r63424 * r63424;
        double r63426 = 2.0;
        double r63427 = r63425 * r63426;
        double r63428 = 1.0;
        double r63429 = r63427 - r63428;
        return r63429;
}

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 2019322 
(FPCore (x)
  :name "Numeric.SpecFunctions:logGammaCorrection from math-functions-0.1.5.2"
  :precision binary64
  (- (* (* x x) 2) 1))