Average Error: 0.0 → 0.0
Time: 316.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r147253 = x;
        double r147254 = r147253 * r147253;
        double r147255 = 1.0;
        double r147256 = r147254 + r147255;
        return r147256;
}
↓
double f(double x) {
        double r147257 = x;
        double r147258 = r147257 * r147257;
        double r147259 = 1.0;
        double r147260 = r147258 + r147259;
        return r147260;
}

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