Average Error: 0.1 → 0.1
Time: 4.6s
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 r48386 = x;
        double r48387 = y;
        double r48388 = r48386 + r48387;
        double r48389 = z;
        double r48390 = r48388 - r48389;
        double r48391 = t;
        double r48392 = 2.0;
        double r48393 = r48391 * r48392;
        double r48394 = r48390 / r48393;
        return r48394;
}
↓
double f(double x, double y, double z, double t) {
        double r48395 = x;
        double r48396 = y;
        double r48397 = r48395 + r48396;
        double r48398 = z;
        double r48399 = r48397 - r48398;
        double r48400 = t;
        double r48401 = 2.0;
        double r48402 = r48400 * r48401;
        double r48403 = r48399 / r48402;
        return r48403;
}

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