Average Error: 0.0 → 0.0
Time: 550.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r234011 = x;
        double r234012 = r234011 * r234011;
        double r234013 = 1.0;
        double r234014 = r234012 + r234013;
        return r234014;
}
↓
double f(double x) {
        double r234015 = x;
        double r234016 = r234015 * r234015;
        double r234017 = 1.0;
        double r234018 = r234016 + r234017;
        return r234018;
}

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