Average Error: 0.0 → 0.0
Time: 2.3s
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 r26537 = x;
        double r26538 = r26537 * r26537;
        double r26539 = 2.0;
        double r26540 = r26538 * r26539;
        double r26541 = 1.0;
        double r26542 = r26540 - r26541;
        return r26542;
}
↓
double f(double x) {
        double r26543 = x;
        double r26544 = r26543 * r26543;
        double r26545 = 2.0;
        double r26546 = r26544 * r26545;
        double r26547 = 1.0;
        double r26548 = r26546 - r26547;
        return r26548;
}

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 2019199 
(FPCore (x)
  :name "Numeric.SpecFunctions:logGammaCorrection from math-functions-0.1.5.2"
  (- (* (* x x) 2.0) 1.0))