Average Error: 0.0 → 0.0
Time: 6.8s
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 r45829 = x;
        double r45830 = r45829 * r45829;
        double r45831 = 2.0;
        double r45832 = r45830 * r45831;
        double r45833 = 1.0;
        double r45834 = r45832 - r45833;
        return r45834;
}
↓
double f(double x) {
        double r45835 = x;
        double r45836 = r45835 * r45835;
        double r45837 = 2.0;
        double r45838 = r45836 * r45837;
        double r45839 = 1.0;
        double r45840 = r45838 - r45839;
        return r45840;
}

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