Average Error: 0.0 → 0.0
Time: 346.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r193031 = x;
        double r193032 = r193031 * r193031;
        double r193033 = 1.0;
        double r193034 = r193032 + r193033;
        return r193034;
}
↓
double f(double x) {
        double r193035 = x;
        double r193036 = r193035 * r193035;
        double r193037 = 1.0;
        double r193038 = r193036 + r193037;
        return r193038;
}

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