Average Error: 0.1 → 0.1
Time: 8.9s
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 r1458243 = x;
        double r1458244 = y;
        double r1458245 = r1458243 + r1458244;
        double r1458246 = z;
        double r1458247 = r1458245 - r1458246;
        double r1458248 = t;
        double r1458249 = 2.0;
        double r1458250 = r1458248 * r1458249;
        double r1458251 = r1458247 / r1458250;
        return r1458251;
}
↓
double f(double x, double y, double z, double t) {
        double r1458252 = y;
        double r1458253 = x;
        double r1458254 = r1458252 + r1458253;
        double r1458255 = z;
        double r1458256 = r1458254 - r1458255;
        double r1458257 = t;
        double r1458258 = 2.0;
        double r1458259 = r1458257 * r1458258;
        double r1458260 = r1458256 / r1458259;
        return r1458260;
}

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