Average Error: 0.0 → 0.0
Time: 623.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r109807 = x;
        double r109808 = r109807 * r109807;
        double r109809 = 1.0;
        double r109810 = r109808 + r109809;
        return r109810;
}
↓
double f(double x) {
        double r109811 = x;
        double r109812 = r109811 * r109811;
        double r109813 = 1.0;
        double r109814 = r109812 + r109813;
        return r109814;
}

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