Average Error: 0 → 0
Time: 401.0ms
Precision: 64
\[\frac{1}{2} \cdot \left(x + y\right)\]
↓
\[\frac{1}{2} \cdot \left(x + y\right)\]
\frac{1}{2} \cdot \left(x + y\right)
↓
\frac{1}{2} \cdot \left(x + y\right)
double f(double x, double y) {
        double r650610 = 1.0;
        double r650611 = 2.0;
        double r650612 = r650610 / r650611;
        double r650613 = x;
        double r650614 = y;
        double r650615 = r650613 + r650614;
        double r650616 = r650612 * r650615;
        return r650616;
}
↓
double f(double x, double y) {
        double r650617 = 1.0;
        double r650618 = 2.0;
        double r650619 = r650617 / r650618;
        double r650620 = x;
        double r650621 = y;
        double r650622 = r650620 + r650621;
        double r650623 = r650619 * r650622;
        return r650623;
}

Error

Bits error versus x

Bits error versus y

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original0
Target0
Herbie0
\[\frac{x + y}{2}\]

Derivation

  1. Initial program 0

    \[\frac{1}{2} \cdot \left(x + y\right)\]

  2. Final simplification0

    \[\leadsto \frac{1}{2} \cdot \left(x + y\right)\]

Reproduce

herbie shell --seed 2020027 
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, G"
  :precision binary64

  :herbie-target
  (/ (+ x y) 2)

  (* (/ 1 2) (+ x y)))