Average Error: 0.0 → 0.0
Time: 690.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 r36926 = x;
        double r36927 = r36926 * r36926;
        double r36928 = 2.0;
        double r36929 = r36927 * r36928;
        double r36930 = 1.0;
        double r36931 = r36929 - r36930;
        return r36931;
}
↓
double f(double x) {
        double r36932 = x;
        double r36933 = r36932 * r36932;
        double r36934 = 2.0;
        double r36935 = r36933 * r36934;
        double r36936 = 1.0;
        double r36937 = r36935 - r36936;
        return r36937;
}

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