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 r45342 = x;
        double r45343 = r45342 * r45342;
        double r45344 = 2.0;
        double r45345 = r45343 * r45344;
        double r45346 = 1.0;
        double r45347 = r45345 - r45346;
        return r45347;
}
↓
double f(double x) {
        double r45348 = x;
        double r45349 = r45348 * r45348;
        double r45350 = 2.0;
        double r45351 = r45349 * r45350;
        double r45352 = 1.0;
        double r45353 = r45351 - r45352;
        return r45353;
}

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