Average Error: 0.0 → 0.0
Time: 2.8s
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 r43577 = x;
        double r43578 = y;
        double r43579 = r43577 + r43578;
        double r43580 = z;
        double r43581 = r43579 - r43580;
        double r43582 = t;
        double r43583 = 2.0;
        double r43584 = r43582 * r43583;
        double r43585 = r43581 / r43584;
        return r43585;
}
↓
double f(double x, double y, double z, double t) {
        double r43586 = x;
        double r43587 = y;
        double r43588 = r43586 + r43587;
        double r43589 = t;
        double r43590 = 2.0;
        double r43591 = r43589 * r43590;
        double r43592 = r43588 / r43591;
        double r43593 = z;
        double r43594 = r43593 / r43591;
        double r43595 = r43592 - r43594;
        return r43595;
}

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