Average Error: 0 → 0
Time: 393.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 r754670 = 1.0;
        double r754671 = 2.0;
        double r754672 = r754670 / r754671;
        double r754673 = x;
        double r754674 = y;
        double r754675 = r754673 + r754674;
        double r754676 = r754672 * r754675;
        return r754676;
}
↓
double f(double x, double y) {
        double r754677 = 1.0;
        double r754678 = 2.0;
        double r754679 = r754677 / r754678;
        double r754680 = x;
        double r754681 = y;
        double r754682 = r754680 + r754681;
        double r754683 = r754679 * r754682;
        return r754683;
}

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