Average Error: 0 → 0
Time: 850.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 r34021958 = 1.0;
        double r34021959 = 2.0;
        double r34021960 = r34021958 / r34021959;
        double r34021961 = x;
        double r34021962 = y;
        double r34021963 = r34021961 + r34021962;
        double r34021964 = r34021960 * r34021963;
        return r34021964;
}
↓
double f(double x, double y) {
        double r34021965 = 1.0;
        double r34021966 = 2.0;
        double r34021967 = r34021965 / r34021966;
        double r34021968 = x;
        double r34021969 = y;
        double r34021970 = r34021968 + r34021969;
        double r34021971 = r34021967 * r34021970;
        return r34021971;
}

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