Average Error: 0 → 0
Time: 932.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 r573004 = 1.0;
        double r573005 = 2.0;
        double r573006 = r573004 / r573005;
        double r573007 = x;
        double r573008 = y;
        double r573009 = r573007 + r573008;
        double r573010 = r573006 * r573009;
        return r573010;
}
↓
double f(double x, double y) {
        double r573011 = 1.0;
        double r573012 = 2.0;
        double r573013 = r573011 / r573012;
        double r573014 = x;
        double r573015 = y;
        double r573016 = r573014 + r573015;
        double r573017 = r573013 * r573016;
        return r573017;
}

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