Average Error: 0.1 → 0.1
Time: 8.5s
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 r47652 = x;
        double r47653 = y;
        double r47654 = r47652 + r47653;
        double r47655 = z;
        double r47656 = r47654 - r47655;
        double r47657 = t;
        double r47658 = 2.0;
        double r47659 = r47657 * r47658;
        double r47660 = r47656 / r47659;
        return r47660;
}
↓
double f(double x, double y, double z, double t) {
        double r47661 = x;
        double r47662 = y;
        double r47663 = r47661 + r47662;
        double r47664 = z;
        double r47665 = r47663 - r47664;
        double r47666 = t;
        double r47667 = 2.0;
        double r47668 = r47666 * r47667;
        double r47669 = r47665 / r47668;
        return r47669;
}

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