Average Error: 0.0 → 0.0
Time: 5.4s
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 r49918 = x;
        double r49919 = y;
        double r49920 = r49918 + r49919;
        double r49921 = z;
        double r49922 = r49920 - r49921;
        double r49923 = t;
        double r49924 = 2.0;
        double r49925 = r49923 * r49924;
        double r49926 = r49922 / r49925;
        return r49926;
}
↓
double f(double x, double y, double z, double t) {
        double r49927 = x;
        double r49928 = y;
        double r49929 = r49927 + r49928;
        double r49930 = z;
        double r49931 = r49929 - r49930;
        double r49932 = t;
        double r49933 = 2.0;
        double r49934 = r49932 * r49933;
        double r49935 = r49931 / r49934;
        return r49935;
}

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 2020047 +o rules:numerics
(FPCore (x y z t)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, B"
  :precision binary64
  (/ (- (+ x y) z) (* t 2)))