Average Error: 0 → 0
Time: 900.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 r491651 = 1.0;
        double r491652 = 2.0;
        double r491653 = r491651 / r491652;
        double r491654 = x;
        double r491655 = y;
        double r491656 = r491654 + r491655;
        double r491657 = r491653 * r491656;
        return r491657;
}
↓
double f(double x, double y) {
        double r491658 = 1.0;
        double r491659 = 2.0;
        double r491660 = r491658 / r491659;
        double r491661 = x;
        double r491662 = y;
        double r491663 = r491661 + r491662;
        double r491664 = r491660 * r491663;
        return r491664;
}

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