Average Error: 0.0 → 0.0
Time: 7.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 r35636 = x;
        double r35637 = y;
        double r35638 = r35636 + r35637;
        double r35639 = z;
        double r35640 = r35638 - r35639;
        double r35641 = t;
        double r35642 = 2.0;
        double r35643 = r35641 * r35642;
        double r35644 = r35640 / r35643;
        return r35644;
}
↓
double f(double x, double y, double z, double t) {
        double r35645 = x;
        double r35646 = y;
        double r35647 = r35645 + r35646;
        double r35648 = z;
        double r35649 = r35647 - r35648;
        double r35650 = t;
        double r35651 = 2.0;
        double r35652 = r35650 * r35651;
        double r35653 = r35649 / r35652;
        return r35653;
}

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