Average Error: 0.0 → 0.0
Time: 320.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r120846 = x;
        double r120847 = r120846 * r120846;
        double r120848 = 1.0;
        double r120849 = r120847 + r120848;
        return r120849;
}
↓
double f(double x) {
        double r120850 = x;
        double r120851 = r120850 * r120850;
        double r120852 = 1.0;
        double r120853 = r120851 + r120852;
        return r120853;
}

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