Average Error: 0.0 → 0.0
Time: 9.6s
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 r31681 = x;
        double r31682 = y;
        double r31683 = r31681 + r31682;
        double r31684 = z;
        double r31685 = r31683 - r31684;
        double r31686 = t;
        double r31687 = 2.0;
        double r31688 = r31686 * r31687;
        double r31689 = r31685 / r31688;
        return r31689;
}
↓
double f(double x, double y, double z, double t) {
        double r31690 = x;
        double r31691 = y;
        double r31692 = r31690 + r31691;
        double r31693 = z;
        double r31694 = r31692 - r31693;
        double r31695 = t;
        double r31696 = 2.0;
        double r31697 = r31695 * r31696;
        double r31698 = r31694 / r31697;
        return r31698;
}

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.0

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

  2. Final simplification0.0

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

Reproduce

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