Average Error: 0.0 → 0.0
Time: 306.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r142087 = x;
        double r142088 = r142087 * r142087;
        double r142089 = 1.0;
        double r142090 = r142088 + r142089;
        return r142090;
}
↓
double f(double x) {
        double r142091 = x;
        double r142092 = r142091 * r142091;
        double r142093 = 1.0;
        double r142094 = r142092 + r142093;
        return r142094;
}

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