Average Error: 0.0 → 0.0
Time: 580.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 r36495 = x;
        double r36496 = r36495 * r36495;
        double r36497 = 2.0;
        double r36498 = r36496 * r36497;
        double r36499 = 1.0;
        double r36500 = r36498 - r36499;
        return r36500;
}
↓
double f(double x) {
        double r36501 = x;
        double r36502 = r36501 * r36501;
        double r36503 = 2.0;
        double r36504 = r36502 * r36503;
        double r36505 = 1.0;
        double r36506 = r36504 - r36505;
        return r36506;
}

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