Average Error: 0.1 → 0.1
Time: 8.8s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
↓
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
\frac{\left(x + y\right) - z}{t \cdot 2}
↓
\frac{\left(x + y\right) - z}{t \cdot 2}
double f(double x, double y, double z, double t) {
        double r31786 = x;
        double r31787 = y;
        double r31788 = r31786 + r31787;
        double r31789 = z;
        double r31790 = r31788 - r31789;
        double r31791 = t;
        double r31792 = 2.0;
        double r31793 = r31791 * r31792;
        double r31794 = r31790 / r31793;
        return r31794;
}
↓
double f(double x, double y, double z, double t) {
        double r31795 = x;
        double r31796 = y;
        double r31797 = r31795 + r31796;
        double r31798 = z;
        double r31799 = r31797 - r31798;
        double r31800 = t;
        double r31801 = 2.0;
        double r31802 = r31800 * r31801;
        double r31803 = r31799 / r31802;
        return r31803;
}

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. Final simplification0.1

    \[\leadsto \frac{\left(x + y\right) - z}{t \cdot 2}\]

Reproduce

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