Average Error: 0.1 → 0.1
Time: 6.7s
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 r29275 = x;
        double r29276 = y;
        double r29277 = r29275 + r29276;
        double r29278 = z;
        double r29279 = r29277 - r29278;
        double r29280 = t;
        double r29281 = 2.0;
        double r29282 = r29280 * r29281;
        double r29283 = r29279 / r29282;
        return r29283;
}
↓
double f(double x, double y, double z, double t) {
        double r29284 = x;
        double r29285 = y;
        double r29286 = r29284 + r29285;
        double r29287 = z;
        double r29288 = r29286 - r29287;
        double r29289 = t;
        double r29290 = 2.0;
        double r29291 = r29289 * r29290;
        double r29292 = r29288 / r29291;
        return r29292;
}

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