Average Error: 0.0 → 0.0
Time: 1.4s
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 r43809 = x;
        double r43810 = r43809 * r43809;
        double r43811 = 2.0;
        double r43812 = r43810 * r43811;
        double r43813 = 1.0;
        double r43814 = r43812 - r43813;
        return r43814;
}
↓
double f(double x) {
        double r43815 = x;
        double r43816 = r43815 * r43815;
        double r43817 = 2.0;
        double r43818 = r43816 * r43817;
        double r43819 = 1.0;
        double r43820 = r43818 - r43819;
        return r43820;
}

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