Average Error: 0.0 → 0.0
Time: 528.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r112192 = x;
        double r112193 = r112192 * r112192;
        double r112194 = 1.0;
        double r112195 = r112193 + r112194;
        return r112195;
}
↓
double f(double x) {
        double r112196 = x;
        double r112197 = r112196 * r112196;
        double r112198 = 1.0;
        double r112199 = r112197 + r112198;
        return r112199;
}

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