Average Error: 0.0 → 0.0
Time: 318.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r190272 = x;
        double r190273 = r190272 * r190272;
        double r190274 = 1.0;
        double r190275 = r190273 + r190274;
        return r190275;
}
↓
double f(double x) {
        double r190276 = x;
        double r190277 = r190276 * r190276;
        double r190278 = 1.0;
        double r190279 = r190277 + r190278;
        return r190279;
}

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