Average Error: 0 → 0
Time: 1.2s
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 r581743 = 1.0;
        double r581744 = 2.0;
        double r581745 = r581743 / r581744;
        double r581746 = x;
        double r581747 = y;
        double r581748 = r581746 + r581747;
        double r581749 = r581745 * r581748;
        return r581749;
}
↓
double f(double x, double y) {
        double r581750 = 1.0;
        double r581751 = 2.0;
        double r581752 = r581750 / r581751;
        double r581753 = x;
        double r581754 = y;
        double r581755 = r581753 + r581754;
        double r581756 = r581752 * r581755;
        return r581756;
}

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