Average Error: 0.1 → 0.1
Time: 2.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 r35625 = x;
        double r35626 = y;
        double r35627 = r35625 + r35626;
        double r35628 = z;
        double r35629 = r35627 - r35628;
        double r35630 = t;
        double r35631 = 2.0;
        double r35632 = r35630 * r35631;
        double r35633 = r35629 / r35632;
        return r35633;
}
↓
double f(double x, double y, double z, double t) {
        double r35634 = x;
        double r35635 = y;
        double r35636 = r35634 + r35635;
        double r35637 = t;
        double r35638 = 2.0;
        double r35639 = r35637 * r35638;
        double r35640 = r35636 / r35639;
        double r35641 = z;
        double r35642 = r35641 / r35639;
        double r35643 = r35640 - r35642;
        return r35643;
}

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{x + y}{t \cdot 2} - \frac{z}{t \cdot 2}\]

Reproduce

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