Average Error: 0.0 → 0.0
Time: 3.9s
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r162622 = x;
        double r162623 = r162622 * r162622;
        double r162624 = 1.0;
        double r162625 = r162623 + r162624;
        return r162625;
}
↓
double f(double x) {
        double r162626 = x;
        double r162627 = r162626 * r162626;
        double r162628 = 1.0;
        double r162629 = r162627 + r162628;
        return r162629;
}

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