Average Error: 0.1 → 0.1
Time: 2.1s
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 r51495 = x;
        double r51496 = y;
        double r51497 = r51495 + r51496;
        double r51498 = z;
        double r51499 = r51497 - r51498;
        double r51500 = t;
        double r51501 = 2.0;
        double r51502 = r51500 * r51501;
        double r51503 = r51499 / r51502;
        return r51503;
}
↓
double f(double x, double y, double z, double t) {
        double r51504 = x;
        double r51505 = y;
        double r51506 = r51504 + r51505;
        double r51507 = z;
        double r51508 = r51506 - r51507;
        double r51509 = t;
        double r51510 = 2.0;
        double r51511 = r51509 * r51510;
        double r51512 = r51508 / r51511;
        return r51512;
}

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