Average Error: 0 → 0
Time: 766.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 r456998 = 1.0;
        double r456999 = 2.0;
        double r457000 = r456998 / r456999;
        double r457001 = x;
        double r457002 = y;
        double r457003 = r457001 + r457002;
        double r457004 = r457000 * r457003;
        return r457004;
}
↓
double f(double x, double y) {
        double r457005 = 1.0;
        double r457006 = 2.0;
        double r457007 = r457005 / r457006;
        double r457008 = x;
        double r457009 = y;
        double r457010 = r457008 + r457009;
        double r457011 = r457007 * r457010;
        return r457011;
}

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