Average Error: 0.0 → 0.0
Time: 332.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r147716 = x;
        double r147717 = r147716 * r147716;
        double r147718 = 1.0;
        double r147719 = r147717 + r147718;
        return r147719;
}
↓
double f(double x) {
        double r147720 = x;
        double r147721 = r147720 * r147720;
        double r147722 = 1.0;
        double r147723 = r147721 + r147722;
        return r147723;
}

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