Average Error: 0.0 → 0.0
Time: 520.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 r28995 = x;
        double r28996 = r28995 * r28995;
        double r28997 = 2.0;
        double r28998 = r28996 * r28997;
        double r28999 = 1.0;
        double r29000 = r28998 - r28999;
        return r29000;
}
↓
double f(double x) {
        double r29001 = x;
        double r29002 = r29001 * r29001;
        double r29003 = 2.0;
        double r29004 = r29002 * r29003;
        double r29005 = 1.0;
        double r29006 = r29004 - r29005;
        return r29006;
}

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