Average Error: 0 → 0
Time: 391.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 r756426 = 1.0;
        double r756427 = 2.0;
        double r756428 = r756426 / r756427;
        double r756429 = x;
        double r756430 = y;
        double r756431 = r756429 + r756430;
        double r756432 = r756428 * r756431;
        return r756432;
}
↓
double f(double x, double y) {
        double r756433 = 1.0;
        double r756434 = 2.0;
        double r756435 = r756433 / r756434;
        double r756436 = x;
        double r756437 = y;
        double r756438 = r756436 + r756437;
        double r756439 = r756435 * r756438;
        return r756439;
}

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