Average Error: 0.0 → 0.0
Time: 684.0ms
Precision: 64
\[x \cdot x + 1\]
\[x \cdot x + 1\]
x \cdot x + 1
x \cdot x + 1
double f(double x) {
        double r152957 = x;
        double r152958 = r152957 * r152957;
        double r152959 = 1.0;
        double r152960 = r152958 + r152959;
        return r152960;
}

double f(double x) {
        double r152961 = x;
        double r152962 = r152961 * r152961;
        double r152963 = 1.0;
        double r152964 = r152962 + r152963;
        return r152964;
}

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

    \[x \cdot x + 1\]
  2. Final simplification0.0

    \[\leadsto x \cdot x + 1\]

Reproduce

herbie shell --seed 2019209 
(FPCore (x)
  :name "Graphics.Rasterific.Shading:$sradialGradientWithFocusShader from Rasterific-0.6.1, A"
  :precision binary64
  (+ (* x x) 1))