Average Error: 0.0 → 0.0
Time: 2.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 r48905 = x;
        double r48906 = r48905 * r48905;
        double r48907 = 2.0;
        double r48908 = r48906 * r48907;
        double r48909 = 1.0;
        double r48910 = r48908 - r48909;
        return r48910;
}
↓
double f(double x) {
        double r48911 = x;
        double r48912 = r48911 * r48911;
        double r48913 = 2.0;
        double r48914 = r48912 * r48913;
        double r48915 = 1.0;
        double r48916 = r48914 - r48915;
        return r48916;
}

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