Average Error: 0 → 0
Time: 399.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 r725105 = 1.0;
        double r725106 = 2.0;
        double r725107 = r725105 / r725106;
        double r725108 = x;
        double r725109 = y;
        double r725110 = r725108 + r725109;
        double r725111 = r725107 * r725110;
        return r725111;
}
↓
double f(double x, double y) {
        double r725112 = 1.0;
        double r725113 = 2.0;
        double r725114 = r725112 / r725113;
        double r725115 = x;
        double r725116 = y;
        double r725117 = r725115 + r725116;
        double r725118 = r725114 * r725117;
        return r725118;
}

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