Average Error: 0.0 → 0.0
Time: 2.5s
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 r60085 = x;
        double r60086 = r60085 * r60085;
        double r60087 = 2.0;
        double r60088 = r60086 * r60087;
        double r60089 = 1.0;
        double r60090 = r60088 - r60089;
        return r60090;
}
↓
double f(double x) {
        double r60091 = x;
        double r60092 = r60091 * r60091;
        double r60093 = 2.0;
        double r60094 = r60092 * r60093;
        double r60095 = 1.0;
        double r60096 = r60094 - r60095;
        return r60096;
}

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