Average Error: 0 → 0
Time: 389.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 r726614 = 1.0;
        double r726615 = 2.0;
        double r726616 = r726614 / r726615;
        double r726617 = x;
        double r726618 = y;
        double r726619 = r726617 + r726618;
        double r726620 = r726616 * r726619;
        return r726620;
}
↓
double f(double x, double y) {
        double r726621 = 1.0;
        double r726622 = 2.0;
        double r726623 = r726621 / r726622;
        double r726624 = x;
        double r726625 = y;
        double r726626 = r726624 + r726625;
        double r726627 = r726623 * r726626;
        return r726627;
}

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 2020024 +o rules:numerics
(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)))