Average Error: 0 → 0
Time: 1.2s
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 r477098 = 1.0;
        double r477099 = 2.0;
        double r477100 = r477098 / r477099;
        double r477101 = x;
        double r477102 = y;
        double r477103 = r477101 + r477102;
        double r477104 = r477100 * r477103;
        return r477104;
}
↓
double f(double x, double y) {
        double r477105 = 1.0;
        double r477106 = 2.0;
        double r477107 = r477105 / r477106;
        double r477108 = x;
        double r477109 = y;
        double r477110 = r477108 + r477109;
        double r477111 = r477107 * r477110;
        return r477111;
}

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