Average Error: 0 → 0
Time: 980.0ms
Precision: 64
\[\frac{1.0}{2.0} \cdot \left(x + y\right)\]
↓
\[\frac{1.0}{2.0} \cdot \left(x + y\right)\]
\frac{1.0}{2.0} \cdot \left(x + y\right)
↓
\frac{1.0}{2.0} \cdot \left(x + y\right)
double f(double x, double y) {
        double r38829660 = 1.0;
        double r38829661 = 2.0;
        double r38829662 = r38829660 / r38829661;
        double r38829663 = x;
        double r38829664 = y;
        double r38829665 = r38829663 + r38829664;
        double r38829666 = r38829662 * r38829665;
        return r38829666;
}
↓
double f(double x, double y) {
        double r38829667 = 1.0;
        double r38829668 = 2.0;
        double r38829669 = r38829667 / r38829668;
        double r38829670 = x;
        double r38829671 = y;
        double r38829672 = r38829670 + r38829671;
        double r38829673 = r38829669 * r38829672;
        return r38829673;
}

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.0}\]

Derivation

  1. Initial program 0

    \[\frac{1.0}{2.0} \cdot \left(x + y\right)\]

  2. Final simplification0

    \[\leadsto \frac{1.0}{2.0} \cdot \left(x + y\right)\]

Reproduce

herbie shell --seed 2019162 
(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)))