Average Error: 0.1 → 0.1
Time: 3.1s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
↓
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
\frac{\left(x + y\right) - z}{t \cdot 2}
↓
\frac{\left(x + y\right) - z}{t \cdot 2}
double f(double x, double y, double z, double t) {
        double r56687 = x;
        double r56688 = y;
        double r56689 = r56687 + r56688;
        double r56690 = z;
        double r56691 = r56689 - r56690;
        double r56692 = t;
        double r56693 = 2.0;
        double r56694 = r56692 * r56693;
        double r56695 = r56691 / r56694;
        return r56695;
}
↓
double f(double x, double y, double z, double t) {
        double r56696 = x;
        double r56697 = y;
        double r56698 = r56696 + r56697;
        double r56699 = z;
        double r56700 = r56698 - r56699;
        double r56701 = t;
        double r56702 = 2.0;
        double r56703 = r56701 * r56702;
        double r56704 = r56700 / r56703;
        return r56704;
}

Error

Bits error versus x

Bits error versus y

Bits error versus z

Bits error versus t

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.1

    \[\frac{\left(x + y\right) - z}{t \cdot 2}\]

  2. Final simplification0.1

    \[\leadsto \frac{\left(x + y\right) - z}{t \cdot 2}\]

Reproduce

herbie shell --seed 2019346 
(FPCore (x y z t)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, B"
  :precision binary64
  (/ (- (+ x y) z) (* t 2)))