Average Error: 0 → 0
Time: 407.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 r799401 = 1.0;
        double r799402 = 2.0;
        double r799403 = r799401 / r799402;
        double r799404 = x;
        double r799405 = y;
        double r799406 = r799404 + r799405;
        double r799407 = r799403 * r799406;
        return r799407;
}
↓
double f(double x, double y) {
        double r799408 = 1.0;
        double r799409 = 2.0;
        double r799410 = r799408 / r799409;
        double r799411 = x;
        double r799412 = y;
        double r799413 = r799411 + r799412;
        double r799414 = r799410 * r799413;
        return r799414;
}

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