Average Error: 0.1 → 0.1
Time: 1.4s
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 r25290 = x;
        double r25291 = y;
        double r25292 = r25290 + r25291;
        double r25293 = z;
        double r25294 = r25292 - r25293;
        double r25295 = t;
        double r25296 = 2.0;
        double r25297 = r25295 * r25296;
        double r25298 = r25294 / r25297;
        return r25298;
}
↓
double f(double x, double y, double z, double t) {
        double r25299 = x;
        double r25300 = y;
        double r25301 = r25299 + r25300;
        double r25302 = z;
        double r25303 = r25301 - r25302;
        double r25304 = t;
        double r25305 = 2.0;
        double r25306 = r25304 * r25305;
        double r25307 = r25303 / r25306;
        return r25307;
}

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