Average Error: 0.0 → 0.0
Time: 1.4s
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 r36742 = x;
        double r36743 = y;
        double r36744 = r36742 + r36743;
        double r36745 = z;
        double r36746 = r36744 - r36745;
        double r36747 = t;
        double r36748 = 2.0;
        double r36749 = r36747 * r36748;
        double r36750 = r36746 / r36749;
        return r36750;
}
↓
double f(double x, double y, double z, double t) {
        double r36751 = x;
        double r36752 = y;
        double r36753 = r36751 + r36752;
        double r36754 = t;
        double r36755 = 2.0;
        double r36756 = r36754 * r36755;
        double r36757 = r36753 / r36756;
        double r36758 = z;
        double r36759 = r36758 / r36756;
        double r36760 = r36757 - r36759;
        return r36760;
}

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