Average Error: 0.0 → 0.0
Time: 564.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r93843 = x;
        double r93844 = r93843 * r93843;
        double r93845 = 1.0;
        double r93846 = r93844 + r93845;
        return r93846;
}
↓
double f(double x) {
        double r93847 = x;
        double r93848 = r93847 * r93847;
        double r93849 = 1.0;
        double r93850 = r93848 + r93849;
        return r93850;
}

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