Average Error: 0.0 → 0.0
Time: 2.6s
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 r58663 = x;
        double r58664 = r58663 * r58663;
        double r58665 = 2.0;
        double r58666 = r58664 * r58665;
        double r58667 = 1.0;
        double r58668 = r58666 - r58667;
        return r58668;
}
↓
double f(double x) {
        double r58669 = x;
        double r58670 = r58669 * r58669;
        double r58671 = 2.0;
        double r58672 = r58670 * r58671;
        double r58673 = 1.0;
        double r58674 = r58672 - r58673;
        return r58674;
}

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