Average Error: 0.0 → 0.0
Time: 1.8s
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 r35149 = x;
        double r35150 = r35149 * r35149;
        double r35151 = 2.0;
        double r35152 = r35150 * r35151;
        double r35153 = 1.0;
        double r35154 = r35152 - r35153;
        return r35154;
}
↓
double f(double x) {
        double r35155 = x;
        double r35156 = r35155 * r35155;
        double r35157 = 2.0;
        double r35158 = r35156 * r35157;
        double r35159 = 1.0;
        double r35160 = r35158 - r35159;
        return r35160;
}

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