Average Error: 0.0 → 0.0
Time: 400.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r187944 = x;
        double r187945 = r187944 * r187944;
        double r187946 = 1.0;
        double r187947 = r187945 + r187946;
        return r187947;
}
↓
double f(double x) {
        double r187948 = x;
        double r187949 = r187948 * r187948;
        double r187950 = 1.0;
        double r187951 = r187949 + r187950;
        return r187951;
}

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