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 r47830 = x;
        double r47831 = y;
        double r47832 = r47830 + r47831;
        double r47833 = z;
        double r47834 = r47832 - r47833;
        double r47835 = t;
        double r47836 = 2.0;
        double r47837 = r47835 * r47836;
        double r47838 = r47834 / r47837;
        return r47838;
}
↓
double f(double x, double y, double z, double t) {
        double r47839 = x;
        double r47840 = y;
        double r47841 = r47839 + r47840;
        double r47842 = z;
        double r47843 = r47841 - r47842;
        double r47844 = t;
        double r47845 = 2.0;
        double r47846 = r47844 * r47845;
        double r47847 = r47843 / r47846;
        return r47847;
}

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