Average Error: 0.1 → 0.1
Time: 21.3s
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 r53804 = x;
        double r53805 = y;
        double r53806 = r53804 + r53805;
        double r53807 = z;
        double r53808 = r53806 - r53807;
        double r53809 = t;
        double r53810 = 2.0;
        double r53811 = r53809 * r53810;
        double r53812 = r53808 / r53811;
        return r53812;
}
↓
double f(double x, double y, double z, double t) {
        double r53813 = x;
        double r53814 = y;
        double r53815 = r53813 + r53814;
        double r53816 = t;
        double r53817 = 2.0;
        double r53818 = r53816 * r53817;
        double r53819 = r53815 / r53818;
        double r53820 = z;
        double r53821 = r53820 / r53818;
        double r53822 = r53819 - r53821;
        return r53822;
}

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