Average Error: 0 → 0
Time: 432.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 r735071 = 1.0;
        double r735072 = 2.0;
        double r735073 = r735071 / r735072;
        double r735074 = x;
        double r735075 = y;
        double r735076 = r735074 + r735075;
        double r735077 = r735073 * r735076;
        return r735077;
}
↓
double f(double x, double y) {
        double r735078 = 1.0;
        double r735079 = 2.0;
        double r735080 = r735078 / r735079;
        double r735081 = x;
        double r735082 = y;
        double r735083 = r735081 + r735082;
        double r735084 = r735080 * r735083;
        return r735084;
}

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