Average Error: 0.1 → 0.1
Time: 2.2s
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 r32654 = x;
        double r32655 = y;
        double r32656 = r32654 + r32655;
        double r32657 = z;
        double r32658 = r32656 - r32657;
        double r32659 = t;
        double r32660 = 2.0;
        double r32661 = r32659 * r32660;
        double r32662 = r32658 / r32661;
        return r32662;
}
↓
double f(double x, double y, double z, double t) {
        double r32663 = x;
        double r32664 = y;
        double r32665 = r32663 + r32664;
        double r32666 = z;
        double r32667 = r32665 - r32666;
        double r32668 = t;
        double r32669 = 2.0;
        double r32670 = r32668 * r32669;
        double r32671 = r32667 / r32670;
        return r32671;
}

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