Average Error: 0 → 0
Time: 368.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 r696646 = 1.0;
        double r696647 = 2.0;
        double r696648 = r696646 / r696647;
        double r696649 = x;
        double r696650 = y;
        double r696651 = r696649 + r696650;
        double r696652 = r696648 * r696651;
        return r696652;
}
↓
double f(double x, double y) {
        double r696653 = 1.0;
        double r696654 = 2.0;
        double r696655 = r696653 / r696654;
        double r696656 = x;
        double r696657 = y;
        double r696658 = r696656 + r696657;
        double r696659 = r696655 * r696658;
        return r696659;
}

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