Average Error: 0.0 → 0.0
Time: 670.0ms
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r88107 = x;
        double r88108 = r88107 * r88107;
        double r88109 = r88107 + r88108;
        return r88109;
}
↓
double f(double x) {
        double r88110 = x;
        double r88111 = r88110 * r88110;
        double r88112 = r88110 + r88111;
        return r88112;
}

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