Average Error: 0.0 → 0.0
Time: 2.4s
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r75725 = x;
        double r75726 = r75725 * r75725;
        double r75727 = r75725 + r75726;
        return r75727;
}
↓
double f(double x) {
        double r75728 = x;
        double r75729 = r75728 * r75728;
        double r75730 = r75728 + r75729;
        return r75730;
}

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