Average Error: 0 → 0
Time: 406.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 r253896 = 1.0;
        double r253897 = 2.0;
        double r253898 = r253896 / r253897;
        double r253899 = x;
        double r253900 = y;
        double r253901 = r253899 + r253900;
        double r253902 = r253898 * r253901;
        return r253902;
}
↓
double f(double x, double y) {
        double r253903 = 1.0;
        double r253904 = 2.0;
        double r253905 = r253903 / r253904;
        double r253906 = x;
        double r253907 = y;
        double r253908 = r253906 + r253907;
        double r253909 = r253905 * r253908;
        return r253909;
}

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