Average Error: 0.1 → 0.1
Time: 16.1s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
↓
\[\frac{y + x}{t \cdot 2} - \frac{z}{t \cdot 2}\]
\frac{\left(x + y\right) - z}{t \cdot 2}
↓
\frac{y + x}{t \cdot 2} - \frac{z}{t \cdot 2}
double f(double x, double y, double z, double t) {
        double r2312344 = x;
        double r2312345 = y;
        double r2312346 = r2312344 + r2312345;
        double r2312347 = z;
        double r2312348 = r2312346 - r2312347;
        double r2312349 = t;
        double r2312350 = 2.0;
        double r2312351 = r2312349 * r2312350;
        double r2312352 = r2312348 / r2312351;
        return r2312352;
}
↓
double f(double x, double y, double z, double t) {
        double r2312353 = y;
        double r2312354 = x;
        double r2312355 = r2312353 + r2312354;
        double r2312356 = t;
        double r2312357 = 2.0;
        double r2312358 = r2312356 * r2312357;
        double r2312359 = r2312355 / r2312358;
        double r2312360 = z;
        double r2312361 = r2312360 / r2312358;
        double r2312362 = r2312359 - r2312361;
        return r2312362;
}

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. Using strategy rm

  3. Applied div-sub0.1

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

  4. Final simplification0.1

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

Reproduce

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