Average Error: 0.0 → 0.0
Time: 463.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 r34584 = x;
        double r34585 = r34584 * r34584;
        double r34586 = 2.0;
        double r34587 = r34585 * r34586;
        double r34588 = 1.0;
        double r34589 = r34587 - r34588;
        return r34589;
}
↓
double f(double x) {
        double r34590 = x;
        double r34591 = r34590 * r34590;
        double r34592 = 2.0;
        double r34593 = r34591 * r34592;
        double r34594 = 1.0;
        double r34595 = r34593 - r34594;
        return r34595;
}

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