Average Error: 0 → 0
Time: 1.3s
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 r510780 = 1.0;
        double r510781 = 2.0;
        double r510782 = r510780 / r510781;
        double r510783 = x;
        double r510784 = y;
        double r510785 = r510783 + r510784;
        double r510786 = r510782 * r510785;
        return r510786;
}
↓
double f(double x, double y) {
        double r510787 = 1.0;
        double r510788 = 2.0;
        double r510789 = r510787 / r510788;
        double r510790 = x;
        double r510791 = y;
        double r510792 = r510790 + r510791;
        double r510793 = r510789 * r510792;
        return r510793;
}

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