Average Error: 0.0 → 0.0
Time: 4.4s
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 r65979 = x;
        double r65980 = r65979 * r65979;
        double r65981 = 2.0;
        double r65982 = r65980 * r65981;
        double r65983 = 1.0;
        double r65984 = r65982 - r65983;
        return r65984;
}
↓
double f(double x) {
        double r65985 = x;
        double r65986 = r65985 * r65985;
        double r65987 = 2.0;
        double r65988 = r65986 * r65987;
        double r65989 = 1.0;
        double r65990 = r65988 - r65989;
        return r65990;
}

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