Average Error: 0 → 0
Time: 852.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 r497999 = 1.0;
        double r498000 = 2.0;
        double r498001 = r497999 / r498000;
        double r498002 = x;
        double r498003 = y;
        double r498004 = r498002 + r498003;
        double r498005 = r498001 * r498004;
        return r498005;
}
↓
double f(double x, double y) {
        double r498006 = 1.0;
        double r498007 = 2.0;
        double r498008 = r498006 / r498007;
        double r498009 = x;
        double r498010 = y;
        double r498011 = r498009 + r498010;
        double r498012 = r498008 * r498011;
        return r498012;
}

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