Average Error: 0.0 → 0.0
Time: 328.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r237791 = x;
        double r237792 = r237791 * r237791;
        double r237793 = 1.0;
        double r237794 = r237792 + r237793;
        return r237794;
}
↓
double f(double x) {
        double r237795 = x;
        double r237796 = r237795 * r237795;
        double r237797 = 1.0;
        double r237798 = r237796 + r237797;
        return r237798;
}

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