Average Error: 0.1 → 0.1
Time: 11.6s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
↓
\[\frac{\left(y + x\right) - z}{t \cdot 2}\]
\frac{\left(x + y\right) - z}{t \cdot 2}
↓
\frac{\left(y + x\right) - z}{t \cdot 2}
double f(double x, double y, double z, double t) {
        double r2398674 = x;
        double r2398675 = y;
        double r2398676 = r2398674 + r2398675;
        double r2398677 = z;
        double r2398678 = r2398676 - r2398677;
        double r2398679 = t;
        double r2398680 = 2.0;
        double r2398681 = r2398679 * r2398680;
        double r2398682 = r2398678 / r2398681;
        return r2398682;
}
↓
double f(double x, double y, double z, double t) {
        double r2398683 = y;
        double r2398684 = x;
        double r2398685 = r2398683 + r2398684;
        double r2398686 = z;
        double r2398687 = r2398685 - r2398686;
        double r2398688 = t;
        double r2398689 = 2.0;
        double r2398690 = r2398688 * r2398689;
        double r2398691 = r2398687 / r2398690;
        return r2398691;
}

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(y + x\right) - z}{t \cdot 2}\]

Reproduce

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