Average Error: 0.0 → 0.0
Time: 13.9s
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 r57631 = x;
        double r57632 = y;
        double r57633 = r57631 + r57632;
        double r57634 = z;
        double r57635 = r57633 - r57634;
        double r57636 = t;
        double r57637 = 2.0;
        double r57638 = r57636 * r57637;
        double r57639 = r57635 / r57638;
        return r57639;
}
↓
double f(double x, double y, double z, double t) {
        double r57640 = x;
        double r57641 = y;
        double r57642 = r57640 + r57641;
        double r57643 = t;
        double r57644 = 2.0;
        double r57645 = r57643 * r57644;
        double r57646 = r57642 / r57645;
        double r57647 = z;
        double r57648 = r57647 / r57645;
        double r57649 = r57646 - r57648;
        return r57649;
}

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 2019325 +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)))