Average Error: 0.1 → 0.1
Time: 3.0s
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 r66613 = x;
        double r66614 = y;
        double r66615 = r66613 + r66614;
        double r66616 = z;
        double r66617 = r66615 - r66616;
        double r66618 = t;
        double r66619 = 2.0;
        double r66620 = r66618 * r66619;
        double r66621 = r66617 / r66620;
        return r66621;
}
↓
double f(double x, double y, double z, double t) {
        double r66622 = x;
        double r66623 = y;
        double r66624 = r66622 + r66623;
        double r66625 = t;
        double r66626 = 2.0;
        double r66627 = r66625 * r66626;
        double r66628 = r66624 / r66627;
        double r66629 = z;
        double r66630 = r66629 / r66627;
        double r66631 = r66628 - r66630;
        return r66631;
}

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{x + y}{t \cdot 2} - \frac{z}{t \cdot 2}\]

Reproduce

herbie shell --seed 2020062 +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)))