Average Error: 0 → 0
Time: 503.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 r885648 = 1.0;
        double r885649 = 2.0;
        double r885650 = r885648 / r885649;
        double r885651 = x;
        double r885652 = y;
        double r885653 = r885651 + r885652;
        double r885654 = r885650 * r885653;
        return r885654;
}
↓
double f(double x, double y) {
        double r885655 = 1.0;
        double r885656 = 2.0;
        double r885657 = r885655 / r885656;
        double r885658 = x;
        double r885659 = y;
        double r885660 = r885658 + r885659;
        double r885661 = r885657 * r885660;
        return r885661;
}

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