Average Error: 0.1 → 0.1
Time: 9.9s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2.0}\]
↓
\[\frac{\left(y + x\right) - z}{t \cdot 2.0}\]
\frac{\left(x + y\right) - z}{t \cdot 2.0}
↓
\frac{\left(y + x\right) - z}{t \cdot 2.0}
double f(double x, double y, double z, double t) {
        double r1620740 = x;
        double r1620741 = y;
        double r1620742 = r1620740 + r1620741;
        double r1620743 = z;
        double r1620744 = r1620742 - r1620743;
        double r1620745 = t;
        double r1620746 = 2.0;
        double r1620747 = r1620745 * r1620746;
        double r1620748 = r1620744 / r1620747;
        return r1620748;
}
↓
double f(double x, double y, double z, double t) {
        double r1620749 = y;
        double r1620750 = x;
        double r1620751 = r1620749 + r1620750;
        double r1620752 = z;
        double r1620753 = r1620751 - r1620752;
        double r1620754 = t;
        double r1620755 = 2.0;
        double r1620756 = r1620754 * r1620755;
        double r1620757 = r1620753 / r1620756;
        return r1620757;
}

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.0}\]

  2. Final simplification0.1

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

Reproduce

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