Average Error: 0.0 → 0.0
Time: 612.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r880 = x;
        double r881 = r880 * r880;
        double r882 = 1.0;
        double r883 = r881 + r882;
        return r883;
}
↓
double f(double x) {
        double r884 = x;
        double r885 = r884 * r884;
        double r886 = 1.0;
        double r887 = r885 + r886;
        return r887;
}

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