Average Error: 0.0 → 0.0
Time: 512.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 r30328 = x;
        double r30329 = r30328 * r30328;
        double r30330 = 2.0;
        double r30331 = r30329 * r30330;
        double r30332 = 1.0;
        double r30333 = r30331 - r30332;
        return r30333;
}
↓
double f(double x) {
        double r30334 = x;
        double r30335 = r30334 * r30334;
        double r30336 = 2.0;
        double r30337 = r30335 * r30336;
        double r30338 = 1.0;
        double r30339 = r30337 - r30338;
        return r30339;
}

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