Average Error: 0.0 → 0.0
Time: 6.5s
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 r35573 = x;
        double r35574 = r35573 * r35573;
        double r35575 = 2.0;
        double r35576 = r35574 * r35575;
        double r35577 = 1.0;
        double r35578 = r35576 - r35577;
        return r35578;
}
↓
double f(double x) {
        double r35579 = x;
        double r35580 = r35579 * r35579;
        double r35581 = 2.0;
        double r35582 = r35580 * r35581;
        double r35583 = 1.0;
        double r35584 = r35582 - r35583;
        return r35584;
}

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