Average Error: 0.0 → 0.0
Time: 13.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 r50346 = x;
        double r50347 = y;
        double r50348 = r50346 + r50347;
        double r50349 = z;
        double r50350 = r50348 - r50349;
        double r50351 = t;
        double r50352 = 2.0;
        double r50353 = r50351 * r50352;
        double r50354 = r50350 / r50353;
        return r50354;
}
↓
double f(double x, double y, double z, double t) {
        double r50355 = x;
        double r50356 = y;
        double r50357 = r50355 + r50356;
        double r50358 = z;
        double r50359 = r50357 - r50358;
        double r50360 = t;
        double r50361 = 2.0;
        double r50362 = r50360 * r50361;
        double r50363 = r50359 / r50362;
        return r50363;
}

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. Using strategy rm

  3. Applied div-sub0.0

    \[\leadsto \color{blue}{\frac{x + y}{t \cdot 2} - \frac{z}{t \cdot 2}}\]
  4. Using strategy rm

  5. Applied sub-div0.0

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

  6. Final simplification0.0

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

Reproduce

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