Average Error: 0 → 0
Time: 478.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 r1471724 = 1.0;
        double r1471725 = 2.0;
        double r1471726 = r1471724 / r1471725;
        double r1471727 = x;
        double r1471728 = y;
        double r1471729 = r1471727 + r1471728;
        double r1471730 = r1471726 * r1471729;
        return r1471730;
}
↓
double f(double x, double y) {
        double r1471731 = 1.0;
        double r1471732 = 2.0;
        double r1471733 = r1471731 / r1471732;
        double r1471734 = x;
        double r1471735 = y;
        double r1471736 = r1471734 + r1471735;
        double r1471737 = r1471733 * r1471736;
        return r1471737;
}

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