Average Error: 0.1 → 0.1
Time: 6.9s
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 r48728 = x;
        double r48729 = y;
        double r48730 = r48728 + r48729;
        double r48731 = z;
        double r48732 = r48730 - r48731;
        double r48733 = t;
        double r48734 = 2.0;
        double r48735 = r48733 * r48734;
        double r48736 = r48732 / r48735;
        return r48736;
}
↓
double f(double x, double y, double z, double t) {
        double r48737 = x;
        double r48738 = y;
        double r48739 = r48737 + r48738;
        double r48740 = z;
        double r48741 = r48739 - r48740;
        double r48742 = t;
        double r48743 = 2.0;
        double r48744 = r48742 * r48743;
        double r48745 = r48741 / r48744;
        return r48745;
}

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