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 r38704 = x;
        double r38705 = y;
        double r38706 = r38704 + r38705;
        double r38707 = z;
        double r38708 = r38706 - r38707;
        double r38709 = t;
        double r38710 = 2.0;
        double r38711 = r38709 * r38710;
        double r38712 = r38708 / r38711;
        return r38712;
}
↓
double f(double x, double y, double z, double t) {
        double r38713 = x;
        double r38714 = y;
        double r38715 = r38713 + r38714;
        double r38716 = z;
        double r38717 = r38715 - r38716;
        double r38718 = t;
        double r38719 = 2.0;
        double r38720 = r38718 * r38719;
        double r38721 = r38717 / r38720;
        return r38721;
}

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