Average Error: 0.0 → 0.0
Time: 2.5s
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 r48525 = x;
        double r48526 = y;
        double r48527 = r48525 + r48526;
        double r48528 = z;
        double r48529 = r48527 - r48528;
        double r48530 = t;
        double r48531 = 2.0;
        double r48532 = r48530 * r48531;
        double r48533 = r48529 / r48532;
        return r48533;
}
↓
double f(double x, double y, double z, double t) {
        double r48534 = x;
        double r48535 = y;
        double r48536 = r48534 + r48535;
        double r48537 = t;
        double r48538 = 2.0;
        double r48539 = r48537 * r48538;
        double r48540 = r48536 / r48539;
        double r48541 = z;
        double r48542 = r48541 / r48539;
        double r48543 = r48540 - r48542;
        return r48543;
}

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 2020060 
(FPCore (x y z t)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, B"
  :precision binary64
  (/ (- (+ x y) z) (* t 2)))