Average Error: 0 → 0
Time: 375.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 r813744 = 1.0;
        double r813745 = 2.0;
        double r813746 = r813744 / r813745;
        double r813747 = x;
        double r813748 = y;
        double r813749 = r813747 + r813748;
        double r813750 = r813746 * r813749;
        return r813750;
}
↓
double f(double x, double y) {
        double r813751 = 1.0;
        double r813752 = 2.0;
        double r813753 = r813751 / r813752;
        double r813754 = x;
        double r813755 = y;
        double r813756 = r813754 + r813755;
        double r813757 = r813753 * r813756;
        return r813757;
}

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