Average Error: 0 → 0
Time: 416.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 r909154 = 1.0;
        double r909155 = 2.0;
        double r909156 = r909154 / r909155;
        double r909157 = x;
        double r909158 = y;
        double r909159 = r909157 + r909158;
        double r909160 = r909156 * r909159;
        return r909160;
}
↓
double f(double x, double y) {
        double r909161 = 1.0;
        double r909162 = 2.0;
        double r909163 = r909161 / r909162;
        double r909164 = x;
        double r909165 = y;
        double r909166 = r909164 + r909165;
        double r909167 = r909163 * r909166;
        return r909167;
}

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