Average Error: 0 → 0
Time: 401.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 r760675 = 1.0;
        double r760676 = 2.0;
        double r760677 = r760675 / r760676;
        double r760678 = x;
        double r760679 = y;
        double r760680 = r760678 + r760679;
        double r760681 = r760677 * r760680;
        return r760681;
}
↓
double f(double x, double y) {
        double r760682 = 1.0;
        double r760683 = 2.0;
        double r760684 = r760682 / r760683;
        double r760685 = x;
        double r760686 = y;
        double r760687 = r760685 + r760686;
        double r760688 = r760684 * r760687;
        return r760688;
}

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