Average Error: 0.1 → 0.1
Time: 15.5s
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 r52236 = x;
        double r52237 = y;
        double r52238 = r52236 + r52237;
        double r52239 = z;
        double r52240 = r52238 - r52239;
        double r52241 = t;
        double r52242 = 2.0;
        double r52243 = r52241 * r52242;
        double r52244 = r52240 / r52243;
        return r52244;
}
↓
double f(double x, double y, double z, double t) {
        double r52245 = x;
        double r52246 = y;
        double r52247 = r52245 + r52246;
        double r52248 = z;
        double r52249 = r52247 - r52248;
        double r52250 = t;
        double r52251 = 2.0;
        double r52252 = r52250 * r52251;
        double r52253 = r52249 / r52252;
        return r52253;
}

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

  3. Applied *-un-lft-identity0.1

    \[\leadsto \color{blue}{1 \cdot \frac{\left(x + y\right) - z}{t \cdot 2}}\]

  4. Final simplification0.1

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

Reproduce

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