Average Error: 0.0 → 0.0
Time: 309.0ms
Precision: 64
\[x \cdot x + 1\]
↓
\[x \cdot x + 1\]
x \cdot x + 1
↓
x \cdot x + 1
double f(double x) {
        double r163502 = x;
        double r163503 = r163502 * r163502;
        double r163504 = 1.0;
        double r163505 = r163503 + r163504;
        return r163505;
}
↓
double f(double x) {
        double r163506 = x;
        double r163507 = r163506 * r163506;
        double r163508 = 1.0;
        double r163509 = r163507 + r163508;
        return r163509;
}

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