Average Error: 0 → 0
Time: 381.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 r722735 = 1.0;
        double r722736 = 2.0;
        double r722737 = r722735 / r722736;
        double r722738 = x;
        double r722739 = y;
        double r722740 = r722738 + r722739;
        double r722741 = r722737 * r722740;
        return r722741;
}
↓
double f(double x, double y) {
        double r722742 = 1.0;
        double r722743 = 2.0;
        double r722744 = r722742 / r722743;
        double r722745 = x;
        double r722746 = y;
        double r722747 = r722745 + r722746;
        double r722748 = r722744 * r722747;
        return r722748;
}

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