Average Error: 0.0 → 0.0
Time: 605.0ms
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r93442 = x;
        double r93443 = r93442 * r93442;
        double r93444 = r93442 + r93443;
        return r93444;
}
↓
double f(double x) {
        double r93445 = x;
        double r93446 = r93445 * r93445;
        double r93447 = r93445 + r93446;
        return r93447;
}

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