Average Error: 0.0 → 0.0
Time: 672.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r90094 = x;
        double r90095 = r90094 * r90094;
        double r90096 = 1.0;
        double r90097 = r90095 + r90096;
        return r90097;
}
↓
double f(double x) {
        double r90098 = x;
        double r90099 = r90098 * r90098;
        double r90100 = 1.0;
        double r90101 = r90099 + r90100;
        return r90101;
}

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