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 r55658 = x;
        double r55659 = y;
        double r55660 = r55658 + r55659;
        double r55661 = z;
        double r55662 = r55660 - r55661;
        double r55663 = t;
        double r55664 = 2.0;
        double r55665 = r55663 * r55664;
        double r55666 = r55662 / r55665;
        return r55666;
}
↓
double f(double x, double y, double z, double t) {
        double r55667 = x;
        double r55668 = y;
        double r55669 = r55667 + r55668;
        double r55670 = t;
        double r55671 = 2.0;
        double r55672 = r55670 * r55671;
        double r55673 = r55669 / r55672;
        double r55674 = z;
        double r55675 = r55674 / r55672;
        double r55676 = r55673 - r55675;
        return r55676;
}

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