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

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