Average Error: 0.0 → 0.0
Time: 669.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 r69661 = x;
        double r69662 = r69661 * r69661;
        double r69663 = 2.0;
        double r69664 = r69662 * r69663;
        double r69665 = 1.0;
        double r69666 = r69664 - r69665;
        return r69666;
}
↓
double f(double x) {
        double r69667 = x;
        double r69668 = r69667 * r69667;
        double r69669 = 2.0;
        double r69670 = r69668 * r69669;
        double r69671 = 1.0;
        double r69672 = r69670 - r69671;
        return r69672;
}

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