Average Error: 0.1 → 0.0
Time: 10.6s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
↓
\[\frac{\frac{\left(x + y\right) - z}{t}}{2}\]
\frac{\left(x + y\right) - z}{t \cdot 2}
↓
\frac{\frac{\left(x + y\right) - z}{t}}{2}
double f(double x, double y, double z, double t) {
        double r39988 = x;
        double r39989 = y;
        double r39990 = r39988 + r39989;
        double r39991 = z;
        double r39992 = r39990 - r39991;
        double r39993 = t;
        double r39994 = 2.0;
        double r39995 = r39993 * r39994;
        double r39996 = r39992 / r39995;
        return r39996;
}
↓
double f(double x, double y, double z, double t) {
        double r39997 = x;
        double r39998 = y;
        double r39999 = r39997 + r39998;
        double r40000 = z;
        double r40001 = r39999 - r40000;
        double r40002 = t;
        double r40003 = r40001 / r40002;
        double r40004 = 2.0;
        double r40005 = r40003 / r40004;
        return r40005;
}

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. Using strategy rm

  3. Applied associate-/r*0.0

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

  4. Final simplification0.0

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

Reproduce

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