Average Error: 0.1 → 0.1
Time: 2.9s
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 r52460 = x;
        double r52461 = y;
        double r52462 = r52460 + r52461;
        double r52463 = z;
        double r52464 = r52462 - r52463;
        double r52465 = t;
        double r52466 = 2.0;
        double r52467 = r52465 * r52466;
        double r52468 = r52464 / r52467;
        return r52468;
}
↓
double f(double x, double y, double z, double t) {
        double r52469 = x;
        double r52470 = y;
        double r52471 = r52469 + r52470;
        double r52472 = z;
        double r52473 = r52471 - r52472;
        double r52474 = t;
        double r52475 = 2.0;
        double r52476 = r52474 * r52475;
        double r52477 = r52473 / r52476;
        return r52477;
}

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