Average Error: 0.0 → 0.0
Time: 1.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 r38173 = x;
        double r38174 = y;
        double r38175 = r38173 + r38174;
        double r38176 = z;
        double r38177 = r38175 - r38176;
        double r38178 = t;
        double r38179 = 2.0;
        double r38180 = r38178 * r38179;
        double r38181 = r38177 / r38180;
        return r38181;
}
↓
double f(double x, double y, double z, double t) {
        double r38182 = x;
        double r38183 = y;
        double r38184 = r38182 + r38183;
        double r38185 = z;
        double r38186 = r38184 - r38185;
        double r38187 = t;
        double r38188 = 2.0;
        double r38189 = r38187 * r38188;
        double r38190 = r38186 / r38189;
        return r38190;
}

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