Average Error: 0.0 → 0.0
Time: 756.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r113723 = x;
        double r113724 = r113723 * r113723;
        double r113725 = 1.0;
        double r113726 = r113724 + r113725;
        return r113726;
}
↓
double f(double x) {
        double r113727 = x;
        double r113728 = r113727 * r113727;
        double r113729 = 1.0;
        double r113730 = r113728 + r113729;
        return r113730;
}

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