Average Error: 0.0 → 0.0
Time: 620.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r140120 = x;
        double r140121 = r140120 * r140120;
        double r140122 = 1.0;
        double r140123 = r140121 + r140122;
        return r140123;
}
↓
double f(double x) {
        double r140124 = x;
        double r140125 = r140124 * r140124;
        double r140126 = 1.0;
        double r140127 = r140125 + r140126;
        return r140127;
}

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