Average Error: 0.0 → 0.0
Time: 693.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 r30980 = x;
        double r30981 = r30980 * r30980;
        double r30982 = 2.0;
        double r30983 = r30981 * r30982;
        double r30984 = 1.0;
        double r30985 = r30983 - r30984;
        return r30985;
}
↓
double f(double x) {
        double r30986 = x;
        double r30987 = r30986 * r30986;
        double r30988 = 2.0;
        double r30989 = r30987 * r30988;
        double r30990 = 1.0;
        double r30991 = r30989 - r30990;
        return r30991;
}

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