Average Error: 0.0 → 0.0
Time: 582.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r105328 = x;
        double r105329 = r105328 * r105328;
        double r105330 = 1.0;
        double r105331 = r105329 + r105330;
        return r105331;
}
↓
double f(double x) {
        double r105332 = x;
        double r105333 = r105332 * r105332;
        double r105334 = 1.0;
        double r105335 = r105333 + r105334;
        return r105335;
}

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