Average Error: 0.0 → 0.0
Time: 1.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 r25638 = x;
        double r25639 = r25638 * r25638;
        double r25640 = 2.0;
        double r25641 = r25639 * r25640;
        double r25642 = 1.0;
        double r25643 = r25641 - r25642;
        return r25643;
}
↓
double f(double x) {
        double r25644 = x;
        double r25645 = r25644 * r25644;
        double r25646 = 2.0;
        double r25647 = r25645 * r25646;
        double r25648 = 1.0;
        double r25649 = r25647 - r25648;
        return r25649;
}

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