Average Error: 0.0 → 0.0
Time: 951.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 r30799 = x;
        double r30800 = r30799 * r30799;
        double r30801 = 2.0;
        double r30802 = r30800 * r30801;
        double r30803 = 1.0;
        double r30804 = r30802 - r30803;
        return r30804;
}
↓
double f(double x) {
        double r30805 = x;
        double r30806 = r30805 * r30805;
        double r30807 = 2.0;
        double r30808 = r30806 * r30807;
        double r30809 = 1.0;
        double r30810 = r30808 - r30809;
        return r30810;
}

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