Average Error: 0.0 → 0.0
Time: 7.4s
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 r48576 = x;
        double r48577 = y;
        double r48578 = r48576 + r48577;
        double r48579 = z;
        double r48580 = r48578 - r48579;
        double r48581 = t;
        double r48582 = 2.0;
        double r48583 = r48581 * r48582;
        double r48584 = r48580 / r48583;
        return r48584;
}
↓
double f(double x, double y, double z, double t) {
        double r48585 = x;
        double r48586 = y;
        double r48587 = r48585 + r48586;
        double r48588 = z;
        double r48589 = r48587 - r48588;
        double r48590 = t;
        double r48591 = 2.0;
        double r48592 = r48590 * r48591;
        double r48593 = r48589 / r48592;
        return r48593;
}

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