Average Error: 0.0 → 0.0
Time: 437.0ms
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r142444 = x;
        double r142445 = r142444 * r142444;
        double r142446 = r142444 + r142445;
        return r142446;
}
↓
double f(double x) {
        double r142447 = x;
        double r142448 = r142447 * r142447;
        double r142449 = r142447 + r142448;
        return r142449;
}

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