Average Error: 0.0 → 0.0
Time: 1.7s
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 r36725 = x;
        double r36726 = r36725 * r36725;
        double r36727 = 2.0;
        double r36728 = r36726 * r36727;
        double r36729 = 1.0;
        double r36730 = r36728 - r36729;
        return r36730;
}
↓
double f(double x) {
        double r36731 = x;
        double r36732 = r36731 * r36731;
        double r36733 = 2.0;
        double r36734 = r36732 * r36733;
        double r36735 = 1.0;
        double r36736 = r36734 - r36735;
        return r36736;
}

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