Average Error: 0.0 → 0.0
Time: 5.2s
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 r51417 = x;
        double r51418 = y;
        double r51419 = r51417 + r51418;
        double r51420 = z;
        double r51421 = r51419 - r51420;
        double r51422 = t;
        double r51423 = 2.0;
        double r51424 = r51422 * r51423;
        double r51425 = r51421 / r51424;
        return r51425;
}
↓
double f(double x, double y, double z, double t) {
        double r51426 = x;
        double r51427 = y;
        double r51428 = r51426 + r51427;
        double r51429 = z;
        double r51430 = r51428 - r51429;
        double r51431 = t;
        double r51432 = 2.0;
        double r51433 = r51431 * r51432;
        double r51434 = r51430 / r51433;
        return r51434;
}

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