Average Error: 0.0 → 0.0
Time: 311.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r136876 = x;
        double r136877 = r136876 * r136876;
        double r136878 = 1.0;
        double r136879 = r136877 + r136878;
        return r136879;
}
↓
double f(double x) {
        double r136880 = x;
        double r136881 = r136880 * r136880;
        double r136882 = 1.0;
        double r136883 = r136881 + r136882;
        return r136883;
}

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 2020056 
(FPCore (x)
  :name "Graphics.Rasterific.Shading:$sradialGradientWithFocusShader from Rasterific-0.6.1, A"
  :precision binary64
  (+ (* x x) 1))