Average Error: 0.1 → 0.1
Time: 3.9s
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 r43501 = x;
        double r43502 = y;
        double r43503 = r43501 + r43502;
        double r43504 = z;
        double r43505 = r43503 - r43504;
        double r43506 = t;
        double r43507 = 2.0;
        double r43508 = r43506 * r43507;
        double r43509 = r43505 / r43508;
        return r43509;
}
↓
double f(double x, double y, double z, double t) {
        double r43510 = x;
        double r43511 = y;
        double r43512 = r43510 + r43511;
        double r43513 = t;
        double r43514 = 2.0;
        double r43515 = r43513 * r43514;
        double r43516 = r43512 / r43515;
        double r43517 = z;
        double r43518 = r43517 / r43515;
        double r43519 = r43516 - r43518;
        return r43519;
}

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