Average Error: 0.0 → 0.0
Time: 710.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r106595 = x;
        double r106596 = r106595 * r106595;
        double r106597 = 1.0;
        double r106598 = r106596 + r106597;
        return r106598;
}
↓
double f(double x) {
        double r106599 = x;
        double r106600 = r106599 * r106599;
        double r106601 = 1.0;
        double r106602 = r106600 + r106601;
        return r106602;
}

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