Average Error: 0 → 0
Time: 769.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 r419284 = 1.0;
        double r419285 = 2.0;
        double r419286 = r419284 / r419285;
        double r419287 = x;
        double r419288 = y;
        double r419289 = r419287 + r419288;
        double r419290 = r419286 * r419289;
        return r419290;
}
↓
double f(double x, double y) {
        double r419291 = 1.0;
        double r419292 = 2.0;
        double r419293 = r419291 / r419292;
        double r419294 = x;
        double r419295 = y;
        double r419296 = r419294 + r419295;
        double r419297 = r419293 * r419296;
        return r419297;
}

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