Average Error: 0.0 → 0.0
Time: 639.0ms
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r10789 = x;
        double r10790 = r10789 * r10789;
        double r10791 = r10789 + r10790;
        return r10791;
}
↓
double f(double x) {
        double r10792 = x;
        double r10793 = r10792 * r10792;
        double r10794 = r10792 + r10793;
        return r10794;
}

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