Average Error: 0.0 → 0.0
Time: 481.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r130909 = x;
        double r130910 = r130909 * r130909;
        double r130911 = 1.0;
        double r130912 = r130910 + r130911;
        return r130912;
}
↓
double f(double x) {
        double r130913 = x;
        double r130914 = r130913 * r130913;
        double r130915 = 1.0;
        double r130916 = r130914 + r130915;
        return r130916;
}

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