Average Error: 0.0 → 0.0
Time: 2.9s
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r86028 = x;
        double r86029 = r86028 * r86028;
        double r86030 = r86028 + r86029;
        return r86030;
}
↓
double f(double x) {
        double r86031 = x;
        double r86032 = r86031 * r86031;
        double r86033 = r86031 + r86032;
        return r86033;
}

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