Average Error: 0 → 0
Time: 489.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 r692766 = 1.0;
        double r692767 = 2.0;
        double r692768 = r692766 / r692767;
        double r692769 = x;
        double r692770 = y;
        double r692771 = r692769 + r692770;
        double r692772 = r692768 * r692771;
        return r692772;
}
↓
double f(double x, double y) {
        double r692773 = 1.0;
        double r692774 = 2.0;
        double r692775 = r692773 / r692774;
        double r692776 = x;
        double r692777 = y;
        double r692778 = r692776 + r692777;
        double r692779 = r692775 * r692778;
        return r692779;
}

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