Average Error: 0.1 → 0.1
Time: 17.3s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2.0}\]
↓
\[\frac{\left(y + x\right) - z}{t \cdot 2.0}\]
\frac{\left(x + y\right) - z}{t \cdot 2.0}
↓
\frac{\left(y + x\right) - z}{t \cdot 2.0}
double f(double x, double y, double z, double t) {
        double r1886615 = x;
        double r1886616 = y;
        double r1886617 = r1886615 + r1886616;
        double r1886618 = z;
        double r1886619 = r1886617 - r1886618;
        double r1886620 = t;
        double r1886621 = 2.0;
        double r1886622 = r1886620 * r1886621;
        double r1886623 = r1886619 / r1886622;
        return r1886623;
}
↓
double f(double x, double y, double z, double t) {
        double r1886624 = y;
        double r1886625 = x;
        double r1886626 = r1886624 + r1886625;
        double r1886627 = z;
        double r1886628 = r1886626 - r1886627;
        double r1886629 = t;
        double r1886630 = 2.0;
        double r1886631 = r1886629 * r1886630;
        double r1886632 = r1886628 / r1886631;
        return r1886632;
}

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.0}\]

  2. Final simplification0.1

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

Reproduce

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