Average Error: 0 → 0
Time: 420.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 r642059 = 1.0;
        double r642060 = 2.0;
        double r642061 = r642059 / r642060;
        double r642062 = x;
        double r642063 = y;
        double r642064 = r642062 + r642063;
        double r642065 = r642061 * r642064;
        return r642065;
}
↓
double f(double x, double y) {
        double r642066 = 1.0;
        double r642067 = 2.0;
        double r642068 = r642066 / r642067;
        double r642069 = x;
        double r642070 = y;
        double r642071 = r642069 + r642070;
        double r642072 = r642068 * r642071;
        return r642072;
}

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 2020002 +o rules:numerics
(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)))