Average Error: 0.0 → 0.0
Time: 14.2s
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 r73679 = x;
        double r73680 = y;
        double r73681 = r73679 + r73680;
        double r73682 = z;
        double r73683 = r73681 - r73682;
        double r73684 = t;
        double r73685 = 2.0;
        double r73686 = r73684 * r73685;
        double r73687 = r73683 / r73686;
        return r73687;
}
↓
double f(double x, double y, double z, double t) {
        double r73688 = x;
        double r73689 = y;
        double r73690 = r73688 + r73689;
        double r73691 = t;
        double r73692 = 2.0;
        double r73693 = r73691 * r73692;
        double r73694 = r73690 / r73693;
        double r73695 = z;
        double r73696 = r73695 / r73693;
        double r73697 = r73694 - r73696;
        return r73697;
}

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