Average Error: 0.0 → 0.0
Time: 5.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 r69355 = x;
        double r69356 = y;
        double r69357 = r69355 + r69356;
        double r69358 = z;
        double r69359 = r69357 - r69358;
        double r69360 = t;
        double r69361 = 2.0;
        double r69362 = r69360 * r69361;
        double r69363 = r69359 / r69362;
        return r69363;
}
↓
double f(double x, double y, double z, double t) {
        double r69364 = x;
        double r69365 = y;
        double r69366 = r69364 + r69365;
        double r69367 = z;
        double r69368 = r69366 - r69367;
        double r69369 = t;
        double r69370 = 2.0;
        double r69371 = r69369 * r69370;
        double r69372 = r69368 / r69371;
        return r69372;
}

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