Average Error: 0.0 → 0.0
Time: 9.9s
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 r36983 = x;
        double r36984 = y;
        double r36985 = r36983 + r36984;
        double r36986 = z;
        double r36987 = r36985 - r36986;
        double r36988 = t;
        double r36989 = 2.0;
        double r36990 = r36988 * r36989;
        double r36991 = r36987 / r36990;
        return r36991;
}
↓
double f(double x, double y, double z, double t) {
        double r36992 = x;
        double r36993 = y;
        double r36994 = r36992 + r36993;
        double r36995 = z;
        double r36996 = r36994 - r36995;
        double r36997 = t;
        double r36998 = 2.0;
        double r36999 = r36997 * r36998;
        double r37000 = r36996 / r36999;
        return r37000;
}

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