Average Error: 0.0 → 0.0
Time: 3.8s
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 r42680 = x;
        double r42681 = y;
        double r42682 = r42680 + r42681;
        double r42683 = z;
        double r42684 = r42682 - r42683;
        double r42685 = t;
        double r42686 = 2.0;
        double r42687 = r42685 * r42686;
        double r42688 = r42684 / r42687;
        return r42688;
}
↓
double f(double x, double y, double z, double t) {
        double r42689 = x;
        double r42690 = y;
        double r42691 = r42689 + r42690;
        double r42692 = z;
        double r42693 = r42691 - r42692;
        double r42694 = t;
        double r42695 = 2.0;
        double r42696 = r42694 * r42695;
        double r42697 = r42693 / r42696;
        return r42697;
}

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