Average Error: 0.0 → 0.0
Time: 1.1s
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r119202 = x;
        double r119203 = r119202 * r119202;
        double r119204 = r119202 + r119203;
        return r119204;
}
↓
double f(double x) {
        double r119205 = x;
        double r119206 = r119205 * r119205;
        double r119207 = r119205 + r119206;
        return r119207;
}

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