Average Error: 0.0 → 0.0
Time: 604.0ms
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r69524 = x;
        double r69525 = r69524 * r69524;
        double r69526 = r69524 + r69525;
        return r69526;
}
↓
double f(double x) {
        double r69527 = x;
        double r69528 = r69527 * r69527;
        double r69529 = r69527 + r69528;
        return r69529;
}

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