Average Error: 0.0 → 0.0
Time: 5.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 r37672 = x;
        double r37673 = y;
        double r37674 = r37672 + r37673;
        double r37675 = z;
        double r37676 = r37674 - r37675;
        double r37677 = t;
        double r37678 = 2.0;
        double r37679 = r37677 * r37678;
        double r37680 = r37676 / r37679;
        return r37680;
}
↓
double f(double x, double y, double z, double t) {
        double r37681 = x;
        double r37682 = y;
        double r37683 = r37681 + r37682;
        double r37684 = z;
        double r37685 = r37683 - r37684;
        double r37686 = t;
        double r37687 = 2.0;
        double r37688 = r37686 * r37687;
        double r37689 = r37685 / r37688;
        return r37689;
}

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.0

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

  2. Final simplification0.0

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

Reproduce

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