Average Error: 0.1 → 0.1
Time: 14.2s
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 r58105 = x;
        double r58106 = y;
        double r58107 = r58105 + r58106;
        double r58108 = z;
        double r58109 = r58107 - r58108;
        double r58110 = t;
        double r58111 = 2.0;
        double r58112 = r58110 * r58111;
        double r58113 = r58109 / r58112;
        return r58113;
}
↓
double f(double x, double y, double z, double t) {
        double r58114 = y;
        double r58115 = x;
        double r58116 = r58114 + r58115;
        double r58117 = z;
        double r58118 = r58116 - r58117;
        double r58119 = t;
        double r58120 = 2.0;
        double r58121 = r58119 * r58120;
        double r58122 = r58118 / r58121;
        return r58122;
}

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 2019179 +o rules:numerics
(FPCore (x y z t)
  :name "Optimisation.CirclePacking:place from circle-packing-0.1.0.4, B"
  (/ (- (+ x y) z) (* t 2.0)))