Average Error: 0.0 → 0.0
Time: 4.0s
Precision: 64
\[x + x \cdot x\]
↓
\[x + x \cdot x\]
x + x \cdot x
↓
x + x \cdot x
double f(double x) {
        double r115436 = x;
        double r115437 = r115436 * r115436;
        double r115438 = r115436 + r115437;
        return r115438;
}
↓
double f(double x) {
        double r115439 = x;
        double r115440 = r115439 * r115439;
        double r115441 = r115439 + r115440;
        return r115441;
}

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