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 r36369130 = 1.0;
        double r36369131 = 2.0;
        double r36369132 = r36369130 / r36369131;
        double r36369133 = x;
        double r36369134 = y;
        double r36369135 = r36369133 + r36369134;
        double r36369136 = r36369132 * r36369135;
        return r36369136;
}
↓
double f(double x, double y) {
        double r36369137 = 1.0;
        double r36369138 = 2.0;
        double r36369139 = r36369137 / r36369138;
        double r36369140 = x;
        double r36369141 = y;
        double r36369142 = r36369140 + r36369141;
        double r36369143 = r36369139 * r36369142;
        return r36369143;
}

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