Average Error: 0.1 → 0.1
Time: 5.2s
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 r36499 = x;
        double r36500 = y;
        double r36501 = r36499 + r36500;
        double r36502 = z;
        double r36503 = r36501 - r36502;
        double r36504 = t;
        double r36505 = 2.0;
        double r36506 = r36504 * r36505;
        double r36507 = r36503 / r36506;
        return r36507;
}
↓
double f(double x, double y, double z, double t) {
        double r36508 = x;
        double r36509 = y;
        double r36510 = r36508 + r36509;
        double r36511 = z;
        double r36512 = r36510 - r36511;
        double r36513 = t;
        double r36514 = 2.0;
        double r36515 = r36513 * r36514;
        double r36516 = r36512 / r36515;
        return r36516;
}

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