Average Error: 0.0 → 0.0
Time: 7.3s
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 r35605 = x;
        double r35606 = y;
        double r35607 = r35605 + r35606;
        double r35608 = z;
        double r35609 = r35607 - r35608;
        double r35610 = t;
        double r35611 = 2.0;
        double r35612 = r35610 * r35611;
        double r35613 = r35609 / r35612;
        return r35613;
}
↓
double f(double x, double y, double z, double t) {
        double r35614 = x;
        double r35615 = y;
        double r35616 = r35614 + r35615;
        double r35617 = z;
        double r35618 = r35616 - r35617;
        double r35619 = t;
        double r35620 = 2.0;
        double r35621 = r35619 * r35620;
        double r35622 = r35618 / r35621;
        return r35622;
}

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