Average Error: 0 → 0
Time: 500.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 r723133 = 1.0;
        double r723134 = 2.0;
        double r723135 = r723133 / r723134;
        double r723136 = x;
        double r723137 = y;
        double r723138 = r723136 + r723137;
        double r723139 = r723135 * r723138;
        return r723139;
}
↓
double f(double x, double y) {
        double r723140 = 1.0;
        double r723141 = 2.0;
        double r723142 = r723140 / r723141;
        double r723143 = x;
        double r723144 = y;
        double r723145 = r723143 + r723144;
        double r723146 = r723142 * r723145;
        return r723146;
}

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