Average Error: 0.0 → 0.0
Time: 4.3s
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 r38237 = x;
        double r38238 = y;
        double r38239 = r38237 + r38238;
        double r38240 = z;
        double r38241 = r38239 - r38240;
        double r38242 = t;
        double r38243 = 2.0;
        double r38244 = r38242 * r38243;
        double r38245 = r38241 / r38244;
        return r38245;
}
↓
double f(double x, double y, double z, double t) {
        double r38246 = x;
        double r38247 = y;
        double r38248 = r38246 + r38247;
        double r38249 = z;
        double r38250 = r38248 - r38249;
        double r38251 = t;
        double r38252 = 2.0;
        double r38253 = r38251 * r38252;
        double r38254 = r38250 / r38253;
        return r38254;
}

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