Average Error: 0.1 → 0.1
Time: 12.7s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2.0}\]
↓
\[\frac{\left(y + x\right) - z}{t \cdot 2.0}\]
\frac{\left(x + y\right) - z}{t \cdot 2.0}
↓
\frac{\left(y + x\right) - z}{t \cdot 2.0}
double f(double x, double y, double z, double t) {
        double r2762237 = x;
        double r2762238 = y;
        double r2762239 = r2762237 + r2762238;
        double r2762240 = z;
        double r2762241 = r2762239 - r2762240;
        double r2762242 = t;
        double r2762243 = 2.0;
        double r2762244 = r2762242 * r2762243;
        double r2762245 = r2762241 / r2762244;
        return r2762245;
}
↓
double f(double x, double y, double z, double t) {
        double r2762246 = y;
        double r2762247 = x;
        double r2762248 = r2762246 + r2762247;
        double r2762249 = z;
        double r2762250 = r2762248 - r2762249;
        double r2762251 = t;
        double r2762252 = 2.0;
        double r2762253 = r2762251 * r2762252;
        double r2762254 = r2762250 / r2762253;
        return r2762254;
}

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.0}\]

  2. Final simplification0.1

    \[\leadsto \frac{\left(y + x\right) - z}{t \cdot 2.0}\]

Reproduce

herbie shell --seed 2019162 +o rules:numerics
(FPCore (x y z t)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, B"
  (/ (- (+ x y) z) (* t 2.0)))