Average Error: 0.0 → 0.0
Time: 702.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r13394 = x;
        double r13395 = r13394 * r13394;
        double r13396 = 1.0;
        double r13397 = r13395 + r13396;
        return r13397;
}
↓
double f(double x) {
        double r13398 = x;
        double r13399 = r13398 * r13398;
        double r13400 = 1.0;
        double r13401 = r13399 + r13400;
        return r13401;
}

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