Average Error: 0.0 → 0.0
Time: 1.7s
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 r38577 = x;
        double r38578 = y;
        double r38579 = r38577 + r38578;
        double r38580 = z;
        double r38581 = r38579 - r38580;
        double r38582 = t;
        double r38583 = 2.0;
        double r38584 = r38582 * r38583;
        double r38585 = r38581 / r38584;
        return r38585;
}
↓
double f(double x, double y, double z, double t) {
        double r38586 = x;
        double r38587 = y;
        double r38588 = r38586 + r38587;
        double r38589 = z;
        double r38590 = r38588 - r38589;
        double r38591 = t;
        double r38592 = 2.0;
        double r38593 = r38591 * r38592;
        double r38594 = r38590 / r38593;
        return r38594;
}

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