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 r33879 = x;
        double r33880 = r33879 * r33879;
        double r33881 = 2.0;
        double r33882 = r33880 * r33881;
        double r33883 = 1.0;
        double r33884 = r33882 - r33883;
        return r33884;
}
↓
double f(double x) {
        double r33885 = x;
        double r33886 = r33885 * r33885;
        double r33887 = 2.0;
        double r33888 = r33886 * r33887;
        double r33889 = 1.0;
        double r33890 = r33888 - r33889;
        return r33890;
}

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 2019198 
(FPCore (x)
  :name "Numeric.SpecFunctions:logGammaCorrection from math-functions-0.1.5.2"
  (- (* (* x x) 2.0) 1.0))