Average Error: 0 → 0
Time: 933.0ms
Precision: 64
\[\frac{1.0}{2.0} \cdot \left(x + y\right)\]
↓
\[\frac{1.0}{2.0} \cdot \left(x + y\right)\]
\frac{1.0}{2.0} \cdot \left(x + y\right)
↓
\frac{1.0}{2.0} \cdot \left(x + y\right)
double f(double x, double y) {
        double r34794433 = 1.0;
        double r34794434 = 2.0;
        double r34794435 = r34794433 / r34794434;
        double r34794436 = x;
        double r34794437 = y;
        double r34794438 = r34794436 + r34794437;
        double r34794439 = r34794435 * r34794438;
        return r34794439;
}
↓
double f(double x, double y) {
        double r34794440 = 1.0;
        double r34794441 = 2.0;
        double r34794442 = r34794440 / r34794441;
        double r34794443 = x;
        double r34794444 = y;
        double r34794445 = r34794443 + r34794444;
        double r34794446 = r34794442 * r34794445;
        return r34794446;
}

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.0}\]

Derivation

  1. Initial program 0

    \[\frac{1.0}{2.0} \cdot \left(x + y\right)\]

  2. Final simplification0

    \[\leadsto \frac{1.0}{2.0} \cdot \left(x + y\right)\]

Reproduce

herbie shell --seed 2019164 
(FPCore (x y)
  :name "Diagrams.Solve.Polynomial:cubForm  from diagrams-solve-0.1, G"

  :herbie-target
  (/ (+ x y) 2.0)

  (* (/ 1.0 2.0) (+ x y)))