Average Error: 0.0 → 0.0
Time: 464.0ms
Precision: 64
\[x \cdot x + 1\]
\[x \cdot x + 1\]
x \cdot x + 1
x \cdot x + 1
double f(double x) {
        double r168090 = x;
        double r168091 = r168090 * r168090;
        double r168092 = 1.0;
        double r168093 = r168091 + r168092;
        return r168093;
}

double f(double x) {
        double r168094 = x;
        double r168095 = r168094 * r168094;
        double r168096 = 1.0;
        double r168097 = r168095 + r168096;
        return r168097;
}

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