Average Error: 0 → 0
Time: 433.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 r656777 = 1.0;
        double r656778 = 2.0;
        double r656779 = r656777 / r656778;
        double r656780 = x;
        double r656781 = y;
        double r656782 = r656780 + r656781;
        double r656783 = r656779 * r656782;
        return r656783;
}
↓
double f(double x, double y) {
        double r656784 = 1.0;
        double r656785 = 2.0;
        double r656786 = r656784 / r656785;
        double r656787 = x;
        double r656788 = y;
        double r656789 = r656787 + r656788;
        double r656790 = r656786 * r656789;
        return r656790;
}

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