Average Error: 0.0 → 0.0
Time: 975.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r106729 = x;
        double r106730 = r106729 * r106729;
        double r106731 = 1.0;
        double r106732 = r106730 + r106731;
        return r106732;
}
↓
double f(double x) {
        double r106733 = x;
        double r106734 = r106733 * r106733;
        double r106735 = 1.0;
        double r106736 = r106734 + r106735;
        return r106736;
}

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 2019199 +o rules:numerics
(FPCore (x)
  :name "Graphics.Rasterific.Shading:$sradialGradientWithFocusShader from Rasterific-0.6.1, A"
  (+ (* x x) 1.0))