Average Error: 0.0 → 0.0
Time: 434.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r147027 = x;
        double r147028 = r147027 * r147027;
        double r147029 = 1.0;
        double r147030 = r147028 + r147029;
        return r147030;
}
↓
double f(double x) {
        double r147031 = x;
        double r147032 = r147031 * r147031;
        double r147033 = 1.0;
        double r147034 = r147032 + r147033;
        return r147034;
}

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