Average Error: 0.0 → 0.0
Time: 10.2s
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r130504 = x;
        double r130505 = r130504 * r130504;
        double r130506 = r130504 + r130505;
        return r130506;
}
↓
double f(double x) {
        double r130507 = x;
        double r130508 = r130507 * r130507;
        double r130509 = r130507 + r130508;
        return r130509;
}

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