Average Error: 0.0 → 0.0
Time: 358.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r208291 = x;
        double r208292 = r208291 * r208291;
        double r208293 = 1.0;
        double r208294 = r208292 + r208293;
        return r208294;
}
↓
double f(double x) {
        double r208295 = x;
        double r208296 = r208295 * r208295;
        double r208297 = 1.0;
        double r208298 = r208296 + r208297;
        return r208298;
}

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