Average Error: 0.1 → 0.1
Time: 5.3s
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 r59276 = x;
        double r59277 = y;
        double r59278 = r59276 + r59277;
        double r59279 = z;
        double r59280 = r59278 - r59279;
        double r59281 = t;
        double r59282 = 2.0;
        double r59283 = r59281 * r59282;
        double r59284 = r59280 / r59283;
        return r59284;
}
↓
double f(double x, double y, double z, double t) {
        double r59285 = x;
        double r59286 = y;
        double r59287 = r59285 + r59286;
        double r59288 = z;
        double r59289 = r59287 - r59288;
        double r59290 = t;
        double r59291 = 2.0;
        double r59292 = r59290 * r59291;
        double r59293 = r59289 / r59292;
        return r59293;
}

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 2020089 
(FPCore (x y z t)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, B"
  :precision binary64
  (/ (- (+ x y) z) (* t 2)))