Average Error: 0.0 → 0.0
Time: 1.1s
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r208133 = x;
        double r208134 = r208133 * r208133;
        double r208135 = 1.0;
        double r208136 = r208134 + r208135;
        return r208136;
}
↓
double f(double x) {
        double r208137 = x;
        double r208138 = r208137 * r208137;
        double r208139 = 1.0;
        double r208140 = r208138 + r208139;
        return r208140;
}

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