Average Error: 0.1 → 0.1
Time: 14.2s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
↓
\[\frac{y + x}{t \cdot 2} - \frac{z}{t \cdot 2}\]
\frac{\left(x + y\right) - z}{t \cdot 2}
↓
\frac{y + x}{t \cdot 2} - \frac{z}{t \cdot 2}
double f(double x, double y, double z, double t) {
        double r2133673 = x;
        double r2133674 = y;
        double r2133675 = r2133673 + r2133674;
        double r2133676 = z;
        double r2133677 = r2133675 - r2133676;
        double r2133678 = t;
        double r2133679 = 2.0;
        double r2133680 = r2133678 * r2133679;
        double r2133681 = r2133677 / r2133680;
        return r2133681;
}
↓
double f(double x, double y, double z, double t) {
        double r2133682 = y;
        double r2133683 = x;
        double r2133684 = r2133682 + r2133683;
        double r2133685 = t;
        double r2133686 = 2.0;
        double r2133687 = r2133685 * r2133686;
        double r2133688 = r2133684 / r2133687;
        double r2133689 = z;
        double r2133690 = r2133689 / r2133687;
        double r2133691 = r2133688 - r2133690;
        return r2133691;
}

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. Using strategy rm

  3. Applied div-sub0.1

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

  4. Final simplification0.1

    \[\leadsto \frac{y + x}{t \cdot 2} - \frac{z}{t \cdot 2}\]

Reproduce

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