Average Error: 0.0 → 0.0
Time: 309.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r136340 = x;
        double r136341 = r136340 * r136340;
        double r136342 = 1.0;
        double r136343 = r136341 + r136342;
        return r136343;
}
↓
double f(double x) {
        double r136344 = x;
        double r136345 = r136344 * r136344;
        double r136346 = 1.0;
        double r136347 = r136345 + r136346;
        return r136347;
}

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