Average Error: 0.1 → 0.1
Time: 10.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 r3041079 = x;
        double r3041080 = y;
        double r3041081 = r3041079 + r3041080;
        double r3041082 = z;
        double r3041083 = r3041081 - r3041082;
        double r3041084 = t;
        double r3041085 = 2.0;
        double r3041086 = r3041084 * r3041085;
        double r3041087 = r3041083 / r3041086;
        return r3041087;
}
↓
double f(double x, double y, double z, double t) {
        double r3041088 = y;
        double r3041089 = x;
        double r3041090 = r3041088 + r3041089;
        double r3041091 = z;
        double r3041092 = r3041090 - r3041091;
        double r3041093 = t;
        double r3041094 = 2.0;
        double r3041095 = r3041093 * r3041094;
        double r3041096 = r3041092 / r3041095;
        return r3041096;
}

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