Average Error: 0 → 0
Time: 1.1s
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 r578046 = 1.0;
        double r578047 = 2.0;
        double r578048 = r578046 / r578047;
        double r578049 = x;
        double r578050 = y;
        double r578051 = r578049 + r578050;
        double r578052 = r578048 * r578051;
        return r578052;
}
↓
double f(double x, double y) {
        double r578053 = 1.0;
        double r578054 = 2.0;
        double r578055 = r578053 / r578054;
        double r578056 = x;
        double r578057 = y;
        double r578058 = r578056 + r578057;
        double r578059 = r578055 * r578058;
        return r578059;
}

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