Average Error: 0.0 → 0.0
Time: 382.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r141811 = x;
        double r141812 = r141811 * r141811;
        double r141813 = 1.0;
        double r141814 = r141812 + r141813;
        return r141814;
}
↓
double f(double x) {
        double r141815 = x;
        double r141816 = r141815 * r141815;
        double r141817 = 1.0;
        double r141818 = r141816 + r141817;
        return r141818;
}

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