Average Error: 0.0 → 0.0
Time: 609.0ms
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r125084 = x;
        double r125085 = r125084 * r125084;
        double r125086 = r125084 + r125085;
        return r125086;
}
↓
double f(double x) {
        double r125087 = x;
        double r125088 = r125087 * r125087;
        double r125089 = r125087 + r125088;
        return r125089;
}

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