Average Error: 0 → 0
Time: 1.2s
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 r551520 = 1.0;
        double r551521 = 2.0;
        double r551522 = r551520 / r551521;
        double r551523 = x;
        double r551524 = y;
        double r551525 = r551523 + r551524;
        double r551526 = r551522 * r551525;
        return r551526;
}
↓
double f(double x, double y) {
        double r551527 = 1.0;
        double r551528 = 2.0;
        double r551529 = r551527 / r551528;
        double r551530 = x;
        double r551531 = y;
        double r551532 = r551530 + r551531;
        double r551533 = r551529 * r551532;
        return r551533;
}

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