Average Error: 0.0 → 0.0
Time: 20.2s
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r12263450 = x;
        double r12263451 = r12263450 * r12263450;
        double r12263452 = r12263450 + r12263451;
        return r12263452;
}
↓
double f(double x) {
        double r12263453 = x;
        double r12263454 = r12263453 * r12263453;
        double r12263455 = r12263453 + r12263454;
        return r12263455;
}

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