Average Error: 0.0 → 0.0
Time: 14.1s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
↓
\[\frac{x + y}{t \cdot 2} - \frac{z}{t \cdot 2}\]
\frac{\left(x + y\right) - z}{t \cdot 2}
↓
\frac{x + y}{t \cdot 2} - \frac{z}{t \cdot 2}
double f(double x, double y, double z, double t) {
        double r48971 = x;
        double r48972 = y;
        double r48973 = r48971 + r48972;
        double r48974 = z;
        double r48975 = r48973 - r48974;
        double r48976 = t;
        double r48977 = 2.0;
        double r48978 = r48976 * r48977;
        double r48979 = r48975 / r48978;
        return r48979;
}
↓
double f(double x, double y, double z, double t) {
        double r48980 = x;
        double r48981 = y;
        double r48982 = r48980 + r48981;
        double r48983 = t;
        double r48984 = 2.0;
        double r48985 = r48983 * r48984;
        double r48986 = r48982 / r48985;
        double r48987 = z;
        double r48988 = r48987 / r48985;
        double r48989 = r48986 - r48988;
        return r48989;
}

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. Using strategy rm

  3. Applied div-sub0.0

    \[\leadsto \color{blue}{\frac{x + y}{t \cdot 2} - \frac{z}{t \cdot 2}}\]

  4. Final simplification0.0

    \[\leadsto \frac{x + y}{t \cdot 2} - \frac{z}{t \cdot 2}\]

Reproduce

herbie shell --seed 2019325 +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)))