Average Error: 0.0 → 0.0
Time: 8.1s
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 r32422 = x;
        double r32423 = y;
        double r32424 = r32422 + r32423;
        double r32425 = z;
        double r32426 = r32424 - r32425;
        double r32427 = t;
        double r32428 = 2.0;
        double r32429 = r32427 * r32428;
        double r32430 = r32426 / r32429;
        return r32430;
}
↓
double f(double x, double y, double z, double t) {
        double r32431 = x;
        double r32432 = y;
        double r32433 = r32431 + r32432;
        double r32434 = z;
        double r32435 = r32433 - r32434;
        double r32436 = t;
        double r32437 = 2.0;
        double r32438 = r32436 * r32437;
        double r32439 = r32435 / r32438;
        return r32439;
}

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