Average Error: 0.0 → 0.0
Time: 486.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r159671 = x;
        double r159672 = r159671 * r159671;
        double r159673 = 1.0;
        double r159674 = r159672 + r159673;
        return r159674;
}
↓
double f(double x) {
        double r159675 = x;
        double r159676 = r159675 * r159675;
        double r159677 = 1.0;
        double r159678 = r159676 + r159677;
        return r159678;
}

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