Average Error: 0.0 → 0.0
Time: 3.4s
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r119057 = x;
        double r119058 = r119057 * r119057;
        double r119059 = 1.0;
        double r119060 = r119058 + r119059;
        return r119060;
}
↓
double f(double x) {
        double r119061 = x;
        double r119062 = r119061 * r119061;
        double r119063 = 1.0;
        double r119064 = r119062 + r119063;
        return r119064;
}

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