Average Error: 0 → 0
Time: 450.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 r744994 = 1.0;
        double r744995 = 2.0;
        double r744996 = r744994 / r744995;
        double r744997 = x;
        double r744998 = y;
        double r744999 = r744997 + r744998;
        double r745000 = r744996 * r744999;
        return r745000;
}
↓
double f(double x, double y) {
        double r745001 = 1.0;
        double r745002 = 2.0;
        double r745003 = r745001 / r745002;
        double r745004 = x;
        double r745005 = y;
        double r745006 = r745004 + r745005;
        double r745007 = r745003 * r745006;
        return r745007;
}

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