Average Error: 0.0 → 0.0
Time: 333.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r218060 = x;
        double r218061 = r218060 * r218060;
        double r218062 = 1.0;
        double r218063 = r218061 + r218062;
        return r218063;
}
↓
double f(double x) {
        double r218064 = x;
        double r218065 = r218064 * r218064;
        double r218066 = 1.0;
        double r218067 = r218065 + r218066;
        return r218067;
}

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