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 r170534 = x;
        double r170535 = r170534 * r170534;
        double r170536 = 1.0;
        double r170537 = r170535 + r170536;
        return r170537;
}
↓
double f(double x) {
        double r170538 = x;
        double r170539 = r170538 * r170538;
        double r170540 = 1.0;
        double r170541 = r170539 + r170540;
        return r170541;
}

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