Average Error: 0.1 → 0.1
Time: 2.9s
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 r52554 = x;
        double r52555 = y;
        double r52556 = r52554 + r52555;
        double r52557 = z;
        double r52558 = r52556 - r52557;
        double r52559 = t;
        double r52560 = 2.0;
        double r52561 = r52559 * r52560;
        double r52562 = r52558 / r52561;
        return r52562;
}
↓
double f(double x, double y, double z, double t) {
        double r52563 = x;
        double r52564 = y;
        double r52565 = r52563 + r52564;
        double r52566 = z;
        double r52567 = r52565 - r52566;
        double r52568 = t;
        double r52569 = 2.0;
        double r52570 = r52568 * r52569;
        double r52571 = r52567 / r52570;
        return r52571;
}

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.1

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

  2. Final simplification0.1

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

Reproduce

herbie shell --seed 2020001 +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)))