Average Error: 0.0 → 0.0
Time: 1.1s
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r14198 = x;
        double r14199 = r14198 * r14198;
        double r14200 = 1.0;
        double r14201 = r14199 + r14200;
        return r14201;
}
↓
double f(double x) {
        double r14202 = x;
        double r14203 = r14202 * r14202;
        double r14204 = 1.0;
        double r14205 = r14203 + r14204;
        return r14205;
}

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