Average Error: 0.1 → 0.1
Time: 11.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 r2426809 = x;
        double r2426810 = y;
        double r2426811 = r2426809 + r2426810;
        double r2426812 = z;
        double r2426813 = r2426811 - r2426812;
        double r2426814 = t;
        double r2426815 = 2.0;
        double r2426816 = r2426814 * r2426815;
        double r2426817 = r2426813 / r2426816;
        return r2426817;
}
↓
double f(double x, double y, double z, double t) {
        double r2426818 = y;
        double r2426819 = x;
        double r2426820 = r2426818 + r2426819;
        double r2426821 = t;
        double r2426822 = 2.0;
        double r2426823 = r2426821 * r2426822;
        double r2426824 = r2426820 / r2426823;
        double r2426825 = z;
        double r2426826 = r2426825 / r2426823;
        double r2426827 = r2426824 - r2426826;
        return r2426827;
}

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 2019174 +o rules:numerics
(FPCore (x y z t)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, B"
  (/ (- (+ x y) z) (* t 2.0)))