Average Error: 0 → 0
Time: 1.2s
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 r624568 = 1.0;
        double r624569 = 2.0;
        double r624570 = r624568 / r624569;
        double r624571 = x;
        double r624572 = y;
        double r624573 = r624571 + r624572;
        double r624574 = r624570 * r624573;
        return r624574;
}
↓
double f(double x, double y) {
        double r624575 = 1.0;
        double r624576 = 2.0;
        double r624577 = r624575 / r624576;
        double r624578 = x;
        double r624579 = y;
        double r624580 = r624578 + r624579;
        double r624581 = r624577 * r624580;
        return r624581;
}

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