Average Error: 0 → 0
Time: 934.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 r491876 = 1.0;
        double r491877 = 2.0;
        double r491878 = r491876 / r491877;
        double r491879 = x;
        double r491880 = y;
        double r491881 = r491879 + r491880;
        double r491882 = r491878 * r491881;
        return r491882;
}
↓
double f(double x, double y) {
        double r491883 = 1.0;
        double r491884 = 2.0;
        double r491885 = r491883 / r491884;
        double r491886 = x;
        double r491887 = y;
        double r491888 = r491886 + r491887;
        double r491889 = r491885 * r491888;
        return r491889;
}

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