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 r544095 = 1.0;
        double r544096 = 2.0;
        double r544097 = r544095 / r544096;
        double r544098 = x;
        double r544099 = y;
        double r544100 = r544098 + r544099;
        double r544101 = r544097 * r544100;
        return r544101;
}
↓
double f(double x, double y) {
        double r544102 = 1.0;
        double r544103 = 2.0;
        double r544104 = r544102 / r544103;
        double r544105 = x;
        double r544106 = y;
        double r544107 = r544105 + r544106;
        double r544108 = r544104 * r544107;
        return r544108;
}

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