Average Error: 0 → 0
Time: 412.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 r825079 = 1.0;
        double r825080 = 2.0;
        double r825081 = r825079 / r825080;
        double r825082 = x;
        double r825083 = y;
        double r825084 = r825082 + r825083;
        double r825085 = r825081 * r825084;
        return r825085;
}
↓
double f(double x, double y) {
        double r825086 = 1.0;
        double r825087 = 2.0;
        double r825088 = r825086 / r825087;
        double r825089 = x;
        double r825090 = y;
        double r825091 = r825089 + r825090;
        double r825092 = r825088 * r825091;
        return r825092;
}

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