Average Error: 0 → 0
Time: 575.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 r774574 = 1.0;
        double r774575 = 2.0;
        double r774576 = r774574 / r774575;
        double r774577 = x;
        double r774578 = y;
        double r774579 = r774577 + r774578;
        double r774580 = r774576 * r774579;
        return r774580;
}
↓
double f(double x, double y) {
        double r774581 = 1.0;
        double r774582 = 2.0;
        double r774583 = r774581 / r774582;
        double r774584 = x;
        double r774585 = y;
        double r774586 = r774584 + r774585;
        double r774587 = r774583 * r774586;
        return r774587;
}

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