Average Error: 0.0 → 0.0
Time: 11.4s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2.0}\]
↓
\[\frac{y + x}{t \cdot 2.0} - \frac{z}{t \cdot 2.0}\]
\frac{\left(x + y\right) - z}{t \cdot 2.0}
↓
\frac{y + x}{t \cdot 2.0} - \frac{z}{t \cdot 2.0}
double f(double x, double y, double z, double t) {
        double r2502999 = x;
        double r2503000 = y;
        double r2503001 = r2502999 + r2503000;
        double r2503002 = z;
        double r2503003 = r2503001 - r2503002;
        double r2503004 = t;
        double r2503005 = 2.0;
        double r2503006 = r2503004 * r2503005;
        double r2503007 = r2503003 / r2503006;
        return r2503007;
}
↓
double f(double x, double y, double z, double t) {
        double r2503008 = y;
        double r2503009 = x;
        double r2503010 = r2503008 + r2503009;
        double r2503011 = t;
        double r2503012 = 2.0;
        double r2503013 = r2503011 * r2503012;
        double r2503014 = r2503010 / r2503013;
        double r2503015 = z;
        double r2503016 = r2503015 / r2503013;
        double r2503017 = r2503014 - r2503016;
        return r2503017;
}

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.0}\]
  2. Using strategy rm

  3. Applied div-sub0.0

    \[\leadsto \color{blue}{\frac{x + y}{t \cdot 2.0} - \frac{z}{t \cdot 2.0}}\]

  4. Final simplification0.0

    \[\leadsto \frac{y + x}{t \cdot 2.0} - \frac{z}{t \cdot 2.0}\]

Reproduce

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