Average Error: 0.1 → 0.1
Time: 2.1s
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 r40456 = x;
        double r40457 = y;
        double r40458 = r40456 + r40457;
        double r40459 = z;
        double r40460 = r40458 - r40459;
        double r40461 = t;
        double r40462 = 2.0;
        double r40463 = r40461 * r40462;
        double r40464 = r40460 / r40463;
        return r40464;
}
↓
double f(double x, double y, double z, double t) {
        double r40465 = x;
        double r40466 = y;
        double r40467 = r40465 + r40466;
        double r40468 = z;
        double r40469 = r40467 - r40468;
        double r40470 = t;
        double r40471 = 2.0;
        double r40472 = r40470 * r40471;
        double r40473 = r40469 / r40472;
        return r40473;
}

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.1

    \[\frac{\left(x + y\right) - z}{t \cdot 2}\]

  2. Final simplification0.1

    \[\leadsto \frac{\left(x + y\right) - z}{t \cdot 2}\]

Reproduce

herbie shell --seed 2020003 
(FPCore (x y z t)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, B"
  :precision binary64
  (/ (- (+ x y) z) (* t 2)))