Average Error: 0.0 → 0.0
Time: 357.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r186694 = x;
        double r186695 = r186694 * r186694;
        double r186696 = 1.0;
        double r186697 = r186695 + r186696;
        return r186697;
}
↓
double f(double x) {
        double r186698 = x;
        double r186699 = r186698 * r186698;
        double r186700 = 1.0;
        double r186701 = r186699 + r186700;
        return r186701;
}

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