Average Error: 0.1 → 0.1
Time: 2.2s
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 r48603 = x;
        double r48604 = y;
        double r48605 = r48603 + r48604;
        double r48606 = z;
        double r48607 = r48605 - r48606;
        double r48608 = t;
        double r48609 = 2.0;
        double r48610 = r48608 * r48609;
        double r48611 = r48607 / r48610;
        return r48611;
}
↓
double f(double x, double y, double z, double t) {
        double r48612 = x;
        double r48613 = y;
        double r48614 = r48612 + r48613;
        double r48615 = t;
        double r48616 = 2.0;
        double r48617 = r48615 * r48616;
        double r48618 = r48614 / r48617;
        double r48619 = z;
        double r48620 = r48619 / r48617;
        double r48621 = r48618 - r48620;
        return r48621;
}

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 2020034 
(FPCore (x y z t)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, B"
  :precision binary64
  (/ (- (+ x y) z) (* t 2)))