Average Error: 0.0 → 0.0
Time: 640.0ms
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r13035 = x;
        double r13036 = r13035 * r13035;
        double r13037 = r13035 + r13036;
        return r13037;
}
↓
double f(double x) {
        double r13038 = x;
        double r13039 = r13038 * r13038;
        double r13040 = r13038 + r13039;
        return r13040;
}

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 2019315 +o rules:numerics
(FPCore (x)
  :name "Main:bigenough1 from B"
  :precision binary64
  (+ x (* x x)))