Average Error: 0.0 → 0.0
Time: 41.6s
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 r3132998 = x;
        double r3132999 = y;
        double r3133000 = r3132998 + r3132999;
        double r3133001 = z;
        double r3133002 = r3133000 - r3133001;
        double r3133003 = t;
        double r3133004 = 2.0;
        double r3133005 = r3133003 * r3133004;
        double r3133006 = r3133002 / r3133005;
        return r3133006;
}
↓
double f(double x, double y, double z, double t) {
        double r3133007 = y;
        double r3133008 = x;
        double r3133009 = r3133007 + r3133008;
        double r3133010 = t;
        double r3133011 = 2.0;
        double r3133012 = r3133010 * r3133011;
        double r3133013 = r3133009 / r3133012;
        double r3133014 = z;
        double r3133015 = r3133014 / r3133012;
        double r3133016 = r3133013 - r3133015;
        return r3133016;
}

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)))