Average Error: 0 → 0
Time: 412.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 r703921 = 1.0;
        double r703922 = 2.0;
        double r703923 = r703921 / r703922;
        double r703924 = x;
        double r703925 = y;
        double r703926 = r703924 + r703925;
        double r703927 = r703923 * r703926;
        return r703927;
}
↓
double f(double x, double y) {
        double r703928 = 1.0;
        double r703929 = 2.0;
        double r703930 = r703928 / r703929;
        double r703931 = x;
        double r703932 = y;
        double r703933 = r703931 + r703932;
        double r703934 = r703930 * r703933;
        return r703934;
}

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