Average Error: 0.0 → 0.0
Time: 954.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r131431 = x;
        double r131432 = r131431 * r131431;
        double r131433 = 1.0;
        double r131434 = r131432 + r131433;
        return r131434;
}
↓
double f(double x) {
        double r131435 = x;
        double r131436 = r131435 * r131435;
        double r131437 = 1.0;
        double r131438 = r131436 + r131437;
        return r131438;
}

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