Average Error: 0.0 → 0.0
Time: 476.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r186335 = x;
        double r186336 = r186335 * r186335;
        double r186337 = 1.0;
        double r186338 = r186336 + r186337;
        return r186338;
}
↓
double f(double x) {
        double r186339 = x;
        double r186340 = r186339 * r186339;
        double r186341 = 1.0;
        double r186342 = r186340 + r186341;
        return r186342;
}

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