Average Error: 0.0 → 0.0
Time: 495.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r199158 = x;
        double r199159 = r199158 * r199158;
        double r199160 = 1.0;
        double r199161 = r199159 + r199160;
        return r199161;
}
↓
double f(double x) {
        double r199162 = x;
        double r199163 = r199162 * r199162;
        double r199164 = 1.0;
        double r199165 = r199163 + r199164;
        return r199165;
}

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