Average Error: 0.1 → 0.0
Time: 53.7s
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 r39662 = x;
        double r39663 = y;
        double r39664 = r39662 + r39663;
        double r39665 = z;
        double r39666 = r39664 - r39665;
        double r39667 = t;
        double r39668 = 2.0;
        double r39669 = r39667 * r39668;
        double r39670 = r39666 / r39669;
        return r39670;
}
↓
double f(double x, double y, double z, double t) {
        double r39671 = x;
        double r39672 = y;
        double r39673 = r39671 + r39672;
        double r39674 = t;
        double r39675 = 2.0;
        double r39676 = r39674 * r39675;
        double r39677 = r39673 / r39676;
        double r39678 = z;
        double r39679 = r39678 / r39676;
        double r39680 = r39677 - r39679;
        return r39680;
}

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.0

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

  4. Final simplification0.0

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

Reproduce

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