Average Error: 0.0 → 0.0
Time: 751.0ms
Precision: 64
\[0 \le x \le 2\]
\[x + x \cdot x\]
\[x \cdot x + x\]
x + x \cdot x
x \cdot x + x
double f(double x) {
        double r4872943 = x;
        double r4872944 = r4872943 * r4872943;
        double r4872945 = r4872943 + r4872944;
        return r4872945;
}

double f(double x) {
        double r4872946 = x;
        double r4872947 = r4872946 * r4872946;
        double r4872948 = r4872947 + r4872946;
        return r4872948;
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0.0
Target0.0
Herbie0.0
\[\left(1.0 + x\right) \cdot x\]

Derivation

  1. Initial program 0.0

    \[x + x \cdot x\]
  2. Final simplification0.0

    \[\leadsto x \cdot x + x\]

Reproduce

herbie shell --seed 2019149 
(FPCore (x)
  :name "Expression 2, p15"
  :pre (<= 0 x 2)

  :herbie-target
  (* (+ 1.0 x) x)

  (+ x (* x x)))