Average Error: 0.0 → 0.0
Time: 338.0ms
Precision: 64
\[x \cdot x + 1\]
\[x \cdot x + 1\]
x \cdot x + 1
x \cdot x + 1
double f(double x) {
        double r195503 = x;
        double r195504 = r195503 * r195503;
        double r195505 = 1.0;
        double r195506 = r195504 + r195505;
        return r195506;
}

double f(double x) {
        double r195507 = x;
        double r195508 = r195507 * r195507;
        double r195509 = 1.0;
        double r195510 = r195508 + r195509;
        return r195510;
}

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