Average Error: 0.0 → 0.0
Time: 480.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 r34976 = x;
        double r34977 = r34976 * r34976;
        double r34978 = 2.0;
        double r34979 = r34977 * r34978;
        double r34980 = 1.0;
        double r34981 = r34979 - r34980;
        return r34981;
}
↓
double f(double x) {
        double r34982 = x;
        double r34983 = r34982 * r34982;
        double r34984 = 2.0;
        double r34985 = r34983 * r34984;
        double r34986 = 1.0;
        double r34987 = r34985 - r34986;
        return r34987;
}

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