Average Error: 0.0 → 0.0
Time: 760.0ms
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r202684 = x;
        double r202685 = r202684 * r202684;
        double r202686 = r202684 + r202685;
        return r202686;
}
↓
double f(double x) {
        double r202687 = x;
        double r202688 = r202687 * r202687;
        double r202689 = r202687 + r202688;
        return r202689;
}

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