Average Error: 0.0 → 0.0
Time: 330.0ms
Precision: 64
\[0.0 \le x \le 2\]
\[x + x \cdot x\]
\[x + x \cdot x\]
x + x \cdot x
x + x \cdot x
double f(double x) {
        double r69890 = x;
        double r69891 = r69890 * r69890;
        double r69892 = r69890 + r69891;
        return r69892;
}

double f(double x) {
        double r69893 = x;
        double r69894 = r69893 * r69893;
        double r69895 = r69893 + r69894;
        return r69895;
}

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 + x\right) \cdot x\]

Derivation

  1. Initial program 0.0

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

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

Reproduce

herbie shell --seed 2020043 
(FPCore (x)
  :name "Expression 2, p15"
  :precision binary64
  :pre (<= 0.0 x 2)

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

  (+ x (* x x)))