Average Error: 0.1 → 0.1
Time: 6.8s
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 r47630 = x;
        double r47631 = y;
        double r47632 = r47630 + r47631;
        double r47633 = z;
        double r47634 = r47632 - r47633;
        double r47635 = t;
        double r47636 = 2.0;
        double r47637 = r47635 * r47636;
        double r47638 = r47634 / r47637;
        return r47638;
}
↓
double f(double x, double y, double z, double t) {
        double r47639 = x;
        double r47640 = y;
        double r47641 = r47639 + r47640;
        double r47642 = z;
        double r47643 = r47641 - r47642;
        double r47644 = t;
        double r47645 = 2.0;
        double r47646 = r47644 * r47645;
        double r47647 = r47643 / r47646;
        return r47647;
}

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