Average Error: 0.0 → 0.0
Time: 491.0ms
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 r36094 = x;
        double r36095 = r36094 * r36094;
        double r36096 = 2.0;
        double r36097 = r36095 * r36096;
        double r36098 = 1.0;
        double r36099 = r36097 - r36098;
        return r36099;
}
↓
double f(double x) {
        double r36100 = x;
        double r36101 = r36100 * r36100;
        double r36102 = 2.0;
        double r36103 = r36101 * r36102;
        double r36104 = 1.0;
        double r36105 = r36103 - r36104;
        return r36105;
}

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