Average Error: 0.0 → 0.0
Time: 2.6s
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 r63622 = x;
        double r63623 = y;
        double r63624 = r63622 + r63623;
        double r63625 = z;
        double r63626 = r63624 - r63625;
        double r63627 = t;
        double r63628 = 2.0;
        double r63629 = r63627 * r63628;
        double r63630 = r63626 / r63629;
        return r63630;
}
↓
double f(double x, double y, double z, double t) {
        double r63631 = x;
        double r63632 = y;
        double r63633 = r63631 + r63632;
        double r63634 = z;
        double r63635 = r63633 - r63634;
        double r63636 = t;
        double r63637 = 2.0;
        double r63638 = r63636 * r63637;
        double r63639 = r63635 / r63638;
        return r63639;
}

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 2020047 
(FPCore (x y z t)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, B"
  :precision binary64
  (/ (- (+ x y) z) (* t 2)))