Average Error: 0 → 0
Time: 1.2s
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 r36682774 = 1.0;
        double r36682775 = 2.0;
        double r36682776 = r36682774 / r36682775;
        double r36682777 = x;
        double r36682778 = y;
        double r36682779 = r36682777 + r36682778;
        double r36682780 = r36682776 * r36682779;
        return r36682780;
}
↓
double f(double x, double y) {
        double r36682781 = 1.0;
        double r36682782 = 2.0;
        double r36682783 = r36682781 / r36682782;
        double r36682784 = x;
        double r36682785 = y;
        double r36682786 = r36682784 + r36682785;
        double r36682787 = r36682783 * r36682786;
        return r36682787;
}

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 2019170 
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, G"

  :herbie-target
  (/ (+ x y) 2.0)

  (* (/ 1.0 2.0) (+ x y)))