Average Error: 0 → 0
Time: 369.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 r708875 = 1.0;
        double r708876 = 2.0;
        double r708877 = r708875 / r708876;
        double r708878 = x;
        double r708879 = y;
        double r708880 = r708878 + r708879;
        double r708881 = r708877 * r708880;
        return r708881;
}
↓
double f(double x, double y) {
        double r708882 = 1.0;
        double r708883 = 2.0;
        double r708884 = r708882 / r708883;
        double r708885 = x;
        double r708886 = y;
        double r708887 = r708885 + r708886;
        double r708888 = r708884 * r708887;
        return r708888;
}

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