Average Error: 0 → 0
Time: 1.1s
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 r31601675 = 1.0;
        double r31601676 = 2.0;
        double r31601677 = r31601675 / r31601676;
        double r31601678 = x;
        double r31601679 = y;
        double r31601680 = r31601678 + r31601679;
        double r31601681 = r31601677 * r31601680;
        return r31601681;
}
↓
double f(double x, double y) {
        double r31601682 = 1.0;
        double r31601683 = 2.0;
        double r31601684 = r31601682 / r31601683;
        double r31601685 = x;
        double r31601686 = y;
        double r31601687 = r31601685 + r31601686;
        double r31601688 = r31601684 * r31601687;
        return r31601688;
}

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 2019169 
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, G"

  :herbie-target
  (/ (+ x y) 2.0)

  (* (/ 1.0 2.0) (+ x y)))