Average Error: 0.1 → 0.1
Time: 16.7s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
↓
\[\frac{y + \left(x - z\right)}{t \cdot 2}\]
\frac{\left(x + y\right) - z}{t \cdot 2}
↓
\frac{y + \left(x - z\right)}{t \cdot 2}
double f(double x, double y, double z, double t) {
        double r47043 = x;
        double r47044 = y;
        double r47045 = r47043 + r47044;
        double r47046 = z;
        double r47047 = r47045 - r47046;
        double r47048 = t;
        double r47049 = 2.0;
        double r47050 = r47048 * r47049;
        double r47051 = r47047 / r47050;
        return r47051;
}
↓
double f(double x, double y, double z, double t) {
        double r47052 = y;
        double r47053 = x;
        double r47054 = z;
        double r47055 = r47053 - r47054;
        double r47056 = r47052 + r47055;
        double r47057 = t;
        double r47058 = 2.0;
        double r47059 = r47057 * r47058;
        double r47060 = r47056 / r47059;
        return r47060;
}

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. Simplified0.1

    \[\leadsto \color{blue}{\frac{\left(x - z\right) + y}{t \cdot 2}}\]

  3. Final simplification0.1

    \[\leadsto \frac{y + \left(x - z\right)}{t \cdot 2}\]

Reproduce

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