Average Error: 0 → 0
Time: 385.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 r650752 = 1.0;
        double r650753 = 2.0;
        double r650754 = r650752 / r650753;
        double r650755 = x;
        double r650756 = y;
        double r650757 = r650755 + r650756;
        double r650758 = r650754 * r650757;
        return r650758;
}
↓
double f(double x, double y) {
        double r650759 = 1.0;
        double r650760 = 2.0;
        double r650761 = r650759 / r650760;
        double r650762 = x;
        double r650763 = y;
        double r650764 = r650762 + r650763;
        double r650765 = r650761 * r650764;
        return r650765;
}

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