Average Error: 0.0 → 0.0
Time: 4.5s
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 r36145 = x;
        double r36146 = r36145 * r36145;
        double r36147 = 2.0;
        double r36148 = r36146 * r36147;
        double r36149 = 1.0;
        double r36150 = r36148 - r36149;
        return r36150;
}
↓
double f(double x) {
        double r36151 = x;
        double r36152 = r36151 * r36151;
        double r36153 = 2.0;
        double r36154 = r36152 * r36153;
        double r36155 = 1.0;
        double r36156 = r36154 - r36155;
        return r36156;
}

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