Average Error: 0 → 0
Time: 372.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 r759728 = 1.0;
        double r759729 = 2.0;
        double r759730 = r759728 / r759729;
        double r759731 = x;
        double r759732 = y;
        double r759733 = r759731 + r759732;
        double r759734 = r759730 * r759733;
        return r759734;
}
↓
double f(double x, double y) {
        double r759735 = 1.0;
        double r759736 = 2.0;
        double r759737 = r759735 / r759736;
        double r759738 = x;
        double r759739 = y;
        double r759740 = r759738 + r759739;
        double r759741 = r759737 * r759740;
        return r759741;
}

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 2020049 
(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)))