Average Error: 0.0 → 0.0
Time: 675.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r101486 = x;
        double r101487 = r101486 * r101486;
        double r101488 = 1.0;
        double r101489 = r101487 + r101488;
        return r101489;
}
↓
double f(double x) {
        double r101490 = x;
        double r101491 = r101490 * r101490;
        double r101492 = 1.0;
        double r101493 = r101491 + r101492;
        return r101493;
}

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