Average Error: 0.0 → 0.0
Time: 57.7s
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r5990566 = x;
        double r5990567 = r5990566 * r5990566;
        double r5990568 = r5990566 + r5990567;
        return r5990568;
}
↓
double f(double x) {
        double r5990569 = x;
        double r5990570 = r5990569 * r5990569;
        double r5990571 = r5990569 + r5990570;
        return r5990571;
}

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