Average Error: 0.0 → 0.0
Time: 414.0ms
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r94233 = x;
        double r94234 = r94233 * r94233;
        double r94235 = r94233 + r94234;
        return r94235;
}
↓
double f(double x) {
        double r94236 = x;
        double r94237 = r94236 * r94236;
        double r94238 = r94236 + r94237;
        return r94238;
}

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 + x \cdot x\]

  2. Final simplification0.0

    \[\leadsto x + x \cdot x\]

Reproduce

herbie shell --seed 2020020 +o rules:numerics
(FPCore (x)
  :name "Main:bigenough1 from B"
  :precision binary64
  (+ x (* x x)))