Average Error: 0 → 0
Time: 913.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 r454759 = 1.0;
        double r454760 = 2.0;
        double r454761 = r454759 / r454760;
        double r454762 = x;
        double r454763 = y;
        double r454764 = r454762 + r454763;
        double r454765 = r454761 * r454764;
        return r454765;
}
↓
double f(double x, double y) {
        double r454766 = 1.0;
        double r454767 = 2.0;
        double r454768 = r454766 / r454767;
        double r454769 = x;
        double r454770 = y;
        double r454771 = r454769 + r454770;
        double r454772 = r454768 * r454771;
        return r454772;
}

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