Average Error: 0.0 → 0.0
Time: 6.3s
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r94339 = x;
        double r94340 = r94339 * r94339;
        double r94341 = r94339 + r94340;
        return r94341;
}
↓
double f(double x) {
        double r94342 = x;
        double r94343 = r94342 * r94342;
        double r94344 = r94342 + r94343;
        return r94344;
}

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