Average Error: 0.1 → 0.1
Time: 16.0s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
↓
\[\frac{\left(y + x\right) - z}{t \cdot 2}\]
\frac{\left(x + y\right) - z}{t \cdot 2}
↓
\frac{\left(y + x\right) - z}{t \cdot 2}
double f(double x, double y, double z, double t) {
        double r2218504 = x;
        double r2218505 = y;
        double r2218506 = r2218504 + r2218505;
        double r2218507 = z;
        double r2218508 = r2218506 - r2218507;
        double r2218509 = t;
        double r2218510 = 2.0;
        double r2218511 = r2218509 * r2218510;
        double r2218512 = r2218508 / r2218511;
        return r2218512;
}
↓
double f(double x, double y, double z, double t) {
        double r2218513 = y;
        double r2218514 = x;
        double r2218515 = r2218513 + r2218514;
        double r2218516 = z;
        double r2218517 = r2218515 - r2218516;
        double r2218518 = t;
        double r2218519 = 2.0;
        double r2218520 = r2218518 * r2218519;
        double r2218521 = r2218517 / r2218520;
        return r2218521;
}

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(y + x\right) - z}{t \cdot 2}\]

Reproduce

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