Average Error: 0 → 0
Time: 389.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 r1287006 = 1.0;
        double r1287007 = 2.0;
        double r1287008 = r1287006 / r1287007;
        double r1287009 = x;
        double r1287010 = y;
        double r1287011 = r1287009 + r1287010;
        double r1287012 = r1287008 * r1287011;
        return r1287012;
}
↓
double f(double x, double y) {
        double r1287013 = 1.0;
        double r1287014 = 2.0;
        double r1287015 = r1287013 / r1287014;
        double r1287016 = x;
        double r1287017 = y;
        double r1287018 = r1287016 + r1287017;
        double r1287019 = r1287015 * r1287018;
        return r1287019;
}

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 2020025 +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)))