Average Error: 0 → 0
Time: 1.0s
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 r412997 = 1.0;
        double r412998 = 2.0;
        double r412999 = r412997 / r412998;
        double r413000 = x;
        double r413001 = y;
        double r413002 = r413000 + r413001;
        double r413003 = r412999 * r413002;
        return r413003;
}
↓
double f(double x, double y) {
        double r413004 = 1.0;
        double r413005 = 2.0;
        double r413006 = r413004 / r413005;
        double r413007 = x;
        double r413008 = y;
        double r413009 = r413007 + r413008;
        double r413010 = r413006 * r413009;
        return r413010;
}

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