Average Error: 0.0 → 0.0
Time: 509.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 r29761 = x;
        double r29762 = r29761 * r29761;
        double r29763 = 2.0;
        double r29764 = r29762 * r29763;
        double r29765 = 1.0;
        double r29766 = r29764 - r29765;
        return r29766;
}
↓
double f(double x) {
        double r29767 = x;
        double r29768 = r29767 * r29767;
        double r29769 = 2.0;
        double r29770 = r29768 * r29769;
        double r29771 = 1.0;
        double r29772 = r29770 - r29771;
        return r29772;
}

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