Average Error: 0.0 → 0.0
Time: 548.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r194110 = x;
        double r194111 = r194110 * r194110;
        double r194112 = 1.0;
        double r194113 = r194111 + r194112;
        return r194113;
}
↓
double f(double x) {
        double r194114 = x;
        double r194115 = r194114 * r194114;
        double r194116 = 1.0;
        double r194117 = r194115 + r194116;
        return r194117;
}

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