Average Error: 0.0 → 0.0
Time: 336.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r141186 = x;
        double r141187 = r141186 * r141186;
        double r141188 = 1.0;
        double r141189 = r141187 + r141188;
        return r141189;
}
↓
double f(double x) {
        double r141190 = x;
        double r141191 = r141190 * r141190;
        double r141192 = 1.0;
        double r141193 = r141191 + r141192;
        return r141193;
}

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