Average Error: 0 → 0
Time: 412.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 r980978 = 1.0;
        double r980979 = 2.0;
        double r980980 = r980978 / r980979;
        double r980981 = x;
        double r980982 = y;
        double r980983 = r980981 + r980982;
        double r980984 = r980980 * r980983;
        return r980984;
}
↓
double f(double x, double y) {
        double r980985 = 1.0;
        double r980986 = 2.0;
        double r980987 = r980985 / r980986;
        double r980988 = x;
        double r980989 = y;
        double r980990 = r980988 + r980989;
        double r980991 = r980987 * r980990;
        return r980991;
}

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