Average Error: 0.0 → 0.0
Time: 461.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 r32924 = x;
        double r32925 = r32924 * r32924;
        double r32926 = 2.0;
        double r32927 = r32925 * r32926;
        double r32928 = 1.0;
        double r32929 = r32927 - r32928;
        return r32929;
}
↓
double f(double x) {
        double r32930 = x;
        double r32931 = r32930 * r32930;
        double r32932 = 2.0;
        double r32933 = r32931 * r32932;
        double r32934 = 1.0;
        double r32935 = r32933 - r32934;
        return r32935;
}

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