Average Error: 0.0 → 0.0
Time: 5.9s
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 r39509 = x;
        double r39510 = y;
        double r39511 = r39509 + r39510;
        double r39512 = z;
        double r39513 = r39511 - r39512;
        double r39514 = t;
        double r39515 = 2.0;
        double r39516 = r39514 * r39515;
        double r39517 = r39513 / r39516;
        return r39517;
}
↓
double f(double x, double y, double z, double t) {
        double r39518 = x;
        double r39519 = y;
        double r39520 = r39518 + r39519;
        double r39521 = z;
        double r39522 = r39520 - r39521;
        double r39523 = t;
        double r39524 = 2.0;
        double r39525 = r39523 * r39524;
        double r39526 = r39522 / r39525;
        return r39526;
}

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.0

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

  2. Final simplification0.0

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

Reproduce

herbie shell --seed 2020046 
(FPCore (x y z t)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, B"
  :precision binary64
  (/ (- (+ x y) z) (* t 2)))