Average Error: 0 → 0
Time: 896.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 r582150 = 1.0;
        double r582151 = 2.0;
        double r582152 = r582150 / r582151;
        double r582153 = x;
        double r582154 = y;
        double r582155 = r582153 + r582154;
        double r582156 = r582152 * r582155;
        return r582156;
}
↓
double f(double x, double y) {
        double r582157 = 1.0;
        double r582158 = 2.0;
        double r582159 = r582157 / r582158;
        double r582160 = x;
        double r582161 = y;
        double r582162 = r582160 + r582161;
        double r582163 = r582159 * r582162;
        return r582163;
}

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