Average Error: 0.0 → 0.0
Time: 13.0s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
↓
\[\frac{x + y}{t \cdot 2} - \frac{z}{t \cdot 2}\]
\frac{\left(x + y\right) - z}{t \cdot 2}
↓
\frac{x + y}{t \cdot 2} - \frac{z}{t \cdot 2}
double f(double x, double y, double z, double t) {
        double r49604 = x;
        double r49605 = y;
        double r49606 = r49604 + r49605;
        double r49607 = z;
        double r49608 = r49606 - r49607;
        double r49609 = t;
        double r49610 = 2.0;
        double r49611 = r49609 * r49610;
        double r49612 = r49608 / r49611;
        return r49612;
}
↓
double f(double x, double y, double z, double t) {
        double r49613 = x;
        double r49614 = y;
        double r49615 = r49613 + r49614;
        double r49616 = t;
        double r49617 = 2.0;
        double r49618 = r49616 * r49617;
        double r49619 = r49615 / r49618;
        double r49620 = z;
        double r49621 = r49620 / r49618;
        double r49622 = r49619 - r49621;
        return r49622;
}

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

  3. Applied div-sub0.0

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

  4. Final simplification0.0

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

Reproduce

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