Average Error: 0.0 → 0.0
Time: 343.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r158247 = x;
        double r158248 = r158247 * r158247;
        double r158249 = 1.0;
        double r158250 = r158248 + r158249;
        return r158250;
}
↓
double f(double x) {
        double r158251 = x;
        double r158252 = r158251 * r158251;
        double r158253 = 1.0;
        double r158254 = r158252 + r158253;
        return r158254;
}

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