Average Error: 0 → 0
Time: 1.3s
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 r585008 = 1.0;
        double r585009 = 2.0;
        double r585010 = r585008 / r585009;
        double r585011 = x;
        double r585012 = y;
        double r585013 = r585011 + r585012;
        double r585014 = r585010 * r585013;
        return r585014;
}
↓
double f(double x, double y) {
        double r585015 = 1.0;
        double r585016 = 2.0;
        double r585017 = r585015 / r585016;
        double r585018 = x;
        double r585019 = y;
        double r585020 = r585018 + r585019;
        double r585021 = r585017 * r585020;
        return r585021;
}

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