Average Error: 0 → 0
Time: 924.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 r1803 = 1.0;
        double r1804 = 2.0;
        double r1805 = r1803 / r1804;
        double r1806 = x;
        double r1807 = y;
        double r1808 = r1806 + r1807;
        double r1809 = r1805 * r1808;
        return r1809;
}
↓
double f(double x, double y) {
        double r1810 = 1.0;
        double r1811 = 2.0;
        double r1812 = r1810 / r1811;
        double r1813 = x;
        double r1814 = y;
        double r1815 = r1813 + r1814;
        double r1816 = r1812 * r1815;
        return r1816;
}

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