Average Error: 0.0 → 0.0
Time: 306.0ms
Precision: 64
\[x \cdot x + 1\]
\[x \cdot x + 1\]
x \cdot x + 1
x \cdot x + 1
double f(double x) {
        double r208070 = x;
        double r208071 = r208070 * r208070;
        double r208072 = 1.0;
        double r208073 = r208071 + r208072;
        return r208073;
}

double f(double x) {
        double r208074 = x;
        double r208075 = r208074 * r208074;
        double r208076 = 1.0;
        double r208077 = r208075 + r208076;
        return r208077;
}

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))