Average Error: 0.0 → 0.0
Time: 602.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r111914 = x;
        double r111915 = r111914 * r111914;
        double r111916 = 1.0;
        double r111917 = r111915 + r111916;
        return r111917;
}
↓
double f(double x) {
        double r111918 = x;
        double r111919 = r111918 * r111918;
        double r111920 = 1.0;
        double r111921 = r111919 + r111920;
        return r111921;
}

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