Average Error: 0.0 → 0.0
Time: 313.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r228145 = x;
        double r228146 = r228145 * r228145;
        double r228147 = 1.0;
        double r228148 = r228146 + r228147;
        return r228148;
}
↓
double f(double x) {
        double r228149 = x;
        double r228150 = r228149 * r228149;
        double r228151 = 1.0;
        double r228152 = r228150 + r228151;
        return r228152;
}

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