Average Error: 0.0 → 0.0
Time: 7.7s
Precision: 64
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
↓
\[\frac{\left(x + y\right) - z}{t \cdot 2}\]
\frac{\left(x + y\right) - z}{t \cdot 2}
↓
\frac{\left(x + y\right) - z}{t \cdot 2}
double f(double x, double y, double z, double t) {
        double r46727 = x;
        double r46728 = y;
        double r46729 = r46727 + r46728;
        double r46730 = z;
        double r46731 = r46729 - r46730;
        double r46732 = t;
        double r46733 = 2.0;
        double r46734 = r46732 * r46733;
        double r46735 = r46731 / r46734;
        return r46735;
}
↓
double f(double x, double y, double z, double t) {
        double r46736 = x;
        double r46737 = y;
        double r46738 = r46736 + r46737;
        double r46739 = z;
        double r46740 = r46738 - r46739;
        double r46741 = t;
        double r46742 = 2.0;
        double r46743 = r46741 * r46742;
        double r46744 = r46740 / r46743;
        return r46744;
}

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.0

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

  2. Final simplification0.0

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

Reproduce

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