Average Error: 0.0 → 0.0
Time: 334.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r141047 = x;
        double r141048 = r141047 * r141047;
        double r141049 = 1.0;
        double r141050 = r141048 + r141049;
        return r141050;
}
↓
double f(double x) {
        double r141051 = x;
        double r141052 = r141051 * r141051;
        double r141053 = 1.0;
        double r141054 = r141052 + r141053;
        return r141054;
}

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