Average Error: 0.0 → 0.0
Time: 2.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 r59809 = x;
        double r59810 = y;
        double r59811 = r59809 + r59810;
        double r59812 = z;
        double r59813 = r59811 - r59812;
        double r59814 = t;
        double r59815 = 2.0;
        double r59816 = r59814 * r59815;
        double r59817 = r59813 / r59816;
        return r59817;
}
↓
double f(double x, double y, double z, double t) {
        double r59818 = x;
        double r59819 = y;
        double r59820 = r59818 + r59819;
        double r59821 = t;
        double r59822 = 2.0;
        double r59823 = r59821 * r59822;
        double r59824 = r59820 / r59823;
        double r59825 = z;
        double r59826 = r59825 / r59823;
        double r59827 = r59824 - r59826;
        return r59827;
}

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