Average Error: 0.0 → 0.0
Time: 308.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r155117 = x;
        double r155118 = r155117 * r155117;
        double r155119 = 1.0;
        double r155120 = r155118 + r155119;
        return r155120;
}
↓
double f(double x) {
        double r155121 = x;
        double r155122 = r155121 * r155121;
        double r155123 = 1.0;
        double r155124 = r155122 + r155123;
        return r155124;
}

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