Average Error: 0.0 → 0.0
Time: 575.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 r60002 = x;
        double r60003 = r60002 * r60002;
        double r60004 = 2.0;
        double r60005 = r60003 * r60004;
        double r60006 = 1.0;
        double r60007 = r60005 - r60006;
        return r60007;
}
↓
double f(double x) {
        double r60008 = x;
        double r60009 = r60008 * r60008;
        double r60010 = 2.0;
        double r60011 = r60009 * r60010;
        double r60012 = 1.0;
        double r60013 = r60011 - r60012;
        return r60013;
}

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