Average Error: 0.0 → 0.0
Time: 316.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r137666 = x;
        double r137667 = r137666 * r137666;
        double r137668 = 1.0;
        double r137669 = r137667 + r137668;
        return r137669;
}
↓
double f(double x) {
        double r137670 = x;
        double r137671 = r137670 * r137670;
        double r137672 = 1.0;
        double r137673 = r137671 + r137672;
        return r137673;
}

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