Average Error: 0.0 → 0.0
Time: 1.9s
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 r33934 = x;
        double r33935 = r33934 * r33934;
        double r33936 = 2.0;
        double r33937 = r33935 * r33936;
        double r33938 = 1.0;
        double r33939 = r33937 - r33938;
        return r33939;
}
↓
double f(double x) {
        double r33940 = x;
        double r33941 = r33940 * r33940;
        double r33942 = 2.0;
        double r33943 = r33941 * r33942;
        double r33944 = 1.0;
        double r33945 = r33943 - r33944;
        return r33945;
}

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