Optimisation.CirclePacking:place from circle-packing-0.1.0.4, B

Percentage Accurate: 99.9% → 99.9%

Time: 6.5s

Alternatives: 9

Speedup: N/A×

• 26.9% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

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

FPCore

(FPCore (x y z t) :precision binary64 (/ (- (+ x y) z) (* t 2.0)))

C

double code(double x, double y, double z, double t) {
	return ((x + y) - z) / (t * 2.0);
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = ((x + y) - z) / (t * 2.0d0)
end function

Java

public static double code(double x, double y, double z, double t) {
	return ((x + y) - z) / (t * 2.0);
}

Python

def code(x, y, z, t):
	return ((x + y) - z) / (t * 2.0)

Julia

function code(x, y, z, t)
	return Float64(Float64(Float64(x + y) - z) / Float64(t * 2.0))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = ((x + y) - z) / (t * 2.0);
end

Wolfram

code[x_, y_, z_, t_] := N[(N[(N[(x + y), $MachinePrecision] - z), $MachinePrecision] / N[(t * 2.0), $MachinePrecision]), $MachinePrecision]

Initial Program: 99.9% accurate, 1.0× speedup

Math

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

FPCore

(FPCore (x y z t) :precision binary64 (/ (- (+ x y) z) (* t 2.0)))

C

double code(double x, double y, double z, double t) {
	return ((x + y) - z) / (t * 2.0);
}

Fortran

real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = ((x + y) - z) / (t * 2.0d0)
end function

Java

public static double code(double x, double y, double z, double t) {
	return ((x + y) - z) / (t * 2.0);
}

Python

def code(x, y, z, t):
	return ((x + y) - z) / (t * 2.0)

Julia

function code(x, y, z, t)
	return Float64(Float64(Float64(x + y) - z) / Float64(t * 2.0))
end

MATLAB

function tmp = code(x, y, z, t)
	tmp = ((x + y) - z) / (t * 2.0);
end

Wolfram

code[x_, y_, z_, t_] := N[(N[(N[(x + y), $MachinePrecision] - z), $MachinePrecision] / N[(t * 2.0), $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.9% accurate, 1.1× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \frac{y - \left(z - x\right)}{t + t} \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t) :precision binary64 (/ (- y (- z x)) (+ t t)))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	return (y - (z - x)) / (t + t);
}

Fortran

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = (y - (z - x)) / (t + t)
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	return (y - (z - x)) / (t + t);
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	return (y - (z - x)) / (t + t)

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	return Float64(Float64(y - Float64(z - x)) / Float64(t + t))
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp = code(x, y, z, t)
	tmp = (y - (z - x)) / (t + t);
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := N[(N[(y - N[(z - x), $MachinePrecision]), $MachinePrecision] / N[(t + t), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\frac{\left(x + y\right) - z}{t \cdot 2} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift--.f64 N/A

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

   2. lift-+.f64 N/A

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

   3. associate--l+ N/A

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

   4. +-commutative N/A

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

   5. associate-+l- N/A

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

   6. lower--.f64 N/A

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

   7. lower--.f64 100.0

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

4. Applied rewrites 100.0%

   \[\leadsto \frac{\color{blue}{y - \left(z - x\right)}}{t \cdot 2} \]
5. Step-by-step derivation

   1. lift-*.f64 N/A

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

   2. *-commutative N/A

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

   3. count-2-rev N/A

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

   4. lower-+.f64 100.0

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

6. Applied rewrites 100.0%

   \[\leadsto \frac{y - \left(z - x\right)}{\color{blue}{t + t}} \]
7. Add Preprocessing

Alternative 2: 37.1% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \begin{array}{l} \mathbf{if}\;\frac{\left(x + y\right) - z}{t \cdot 2} \leq -1 \cdot 10^{-306}:\\ \;\;\;\;x \cdot \frac{0.5}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{t} \cdot 0.5\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
 :precision binary64
 (if (<= (/ (- (+ x y) z) (* t 2.0)) -1e-306) (* x (/ 0.5 t)) (* (/ y t) 0.5)))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	double tmp;
	if ((((x + y) - z) / (t * 2.0)) <= -1e-306) {
		tmp = x * (0.5 / t);
	} else {
		tmp = (y / t) * 0.5;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((((x + y) - z) / (t * 2.0d0)) <= (-1d-306)) then
        tmp = x * (0.5d0 / t)
    else
        tmp = (y / t) * 0.5d0
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((((x + y) - z) / (t * 2.0)) <= -1e-306) {
		tmp = x * (0.5 / t);
	} else {
		tmp = (y / t) * 0.5;
	}
	return tmp;
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	tmp = 0
	if (((x + y) - z) / (t * 2.0)) <= -1e-306:
		tmp = x * (0.5 / t)
	else:
		tmp = (y / t) * 0.5
	return tmp

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	tmp = 0.0
	if (Float64(Float64(Float64(x + y) - z) / Float64(t * 2.0)) <= -1e-306)
		tmp = Float64(x * Float64(0.5 / t));
	else
		tmp = Float64(Float64(y / t) * 0.5);
	end
	return tmp
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((((x + y) - z) / (t * 2.0)) <= -1e-306)
		tmp = x * (0.5 / t);
	else
		tmp = (y / t) * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := If[LessEqual[N[(N[(N[(x + y), $MachinePrecision] - z), $MachinePrecision] / N[(t * 2.0), $MachinePrecision]), $MachinePrecision], -1e-306], N[(x * N[(0.5 / t), $MachinePrecision]), $MachinePrecision], N[(N[(y / t), $MachinePrecision] * 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (/.f64 (-.f64 (+.f64 x y) z) (*.f64 t #s(literal 2 binary64))) < -1.00000000000000003e-306

   1. Initial program 99.9%

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

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{x}{t}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{x}{t} \cdot \frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{x}{t} \cdot \frac{1}{2}} \]

      3. lower-/.f64 34.2

         \[\leadsto \color{blue}{\frac{x}{t}} \cdot 0.5 \]

   5. Applied rewrites 34.2%

      \[\leadsto \color{blue}{\frac{x}{t} \cdot 0.5} \]
   6. Step-by-step derivation

   7. Applied rewrites 34.1%

      \[\leadsto x \cdot \color{blue}{\frac{0.5}{t}} \]

   if -1.00000000000000003e-306 < (/.f64 (-.f64 (+.f64 x y) z) (*.f64 t #s(literal 2 binary64)))

   1. Initial program 100.0%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{x + y}{t}} \]
   4. Step-by-step derivation

      1. div-add-rev N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. div-add-rev N/A

         \[\leadsto \color{blue}{\frac{x + y}{t}} \cdot \frac{1}{2} \]

      5. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x + y}{t}} \cdot \frac{1}{2} \]

      6. +-commutative N/A

         \[\leadsto \frac{\color{blue}{y + x}}{t} \cdot \frac{1}{2} \]

      7. lower-+.f64 67.7

         \[\leadsto \frac{\color{blue}{y + x}}{t} \cdot 0.5 \]

   5. Applied rewrites 67.7%

      \[\leadsto \color{blue}{\frac{y + x}{t} \cdot 0.5} \]

   6. Taylor expanded in x around 0

      \[\leadsto \frac{y}{t} \cdot \frac{1}{2} \]
   7. Step-by-step derivation

   8. Applied rewrites 40.3%

      \[\leadsto \frac{y}{t} \cdot 0.5 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 76.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \begin{array}{l} \mathbf{if}\;x + y \leq -1 \cdot 10^{-74}:\\ \;\;\;\;\frac{x}{t} \cdot 0.5\\ \mathbf{elif}\;x + y \leq 2 \cdot 10^{+48}:\\ \;\;\;\;\frac{-0.5 \cdot z}{t}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{t} \cdot 0.5\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
 :precision binary64
 (if (<= (+ x y) -1e-74)
   (* (/ x t) 0.5)
   (if (<= (+ x y) 2e+48) (/ (* -0.5 z) t) (* (/ y t) 0.5))))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= -1e-74) {
		tmp = (x / t) * 0.5;
	} else if ((x + y) <= 2e+48) {
		tmp = (-0.5 * z) / t;
	} else {
		tmp = (y / t) * 0.5;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((x + y) <= (-1d-74)) then
        tmp = (x / t) * 0.5d0
    else if ((x + y) <= 2d+48) then
        tmp = ((-0.5d0) * z) / t
    else
        tmp = (y / t) * 0.5d0
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= -1e-74) {
		tmp = (x / t) * 0.5;
	} else if ((x + y) <= 2e+48) {
		tmp = (-0.5 * z) / t;
	} else {
		tmp = (y / t) * 0.5;
	}
	return tmp;
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	tmp = 0
	if (x + y) <= -1e-74:
		tmp = (x / t) * 0.5
	elif (x + y) <= 2e+48:
		tmp = (-0.5 * z) / t
	else:
		tmp = (y / t) * 0.5
	return tmp

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x + y) <= -1e-74)
		tmp = Float64(Float64(x / t) * 0.5);
	elseif (Float64(x + y) <= 2e+48)
		tmp = Float64(Float64(-0.5 * z) / t);
	else
		tmp = Float64(Float64(y / t) * 0.5);
	end
	return tmp
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x + y) <= -1e-74)
		tmp = (x / t) * 0.5;
	elseif ((x + y) <= 2e+48)
		tmp = (-0.5 * z) / t;
	else
		tmp = (y / t) * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := If[LessEqual[N[(x + y), $MachinePrecision], -1e-74], N[(N[(x / t), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[N[(x + y), $MachinePrecision], 2e+48], N[(N[(-0.5 * z), $MachinePrecision] / t), $MachinePrecision], N[(N[(y / t), $MachinePrecision] * 0.5), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 x y) < -9.99999999999999958e-75

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{x}{t}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{x}{t} \cdot \frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{x}{t} \cdot \frac{1}{2}} \]

      3. lower-/.f64 44.5

         \[\leadsto \color{blue}{\frac{x}{t}} \cdot 0.5 \]

   5. Applied rewrites 44.5%

      \[\leadsto \color{blue}{\frac{x}{t} \cdot 0.5} \]

   if -9.99999999999999958e-75 < (+.f64 x y) < 2.00000000000000009e48

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot \frac{z}{t}} \]
   4. Step-by-step derivation

      1. *-lft-identity N/A

         \[\leadsto \frac{-1}{2} \cdot \frac{\color{blue}{1 \cdot z}}{t} \]

      2. associate-*l/ N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{\left(\frac{1}{t} \cdot z\right)} \]

      3. associate-*l* N/A

         \[\leadsto \color{blue}{\left(\frac{-1}{2} \cdot \frac{1}{t}\right) \cdot z} \]

      4. metadata-eval N/A

         \[\leadsto \left(\color{blue}{\left(\mathsf{neg}\left(\frac{1}{2}\right)\right)} \cdot \frac{1}{t}\right) \cdot z \]

      5. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot \frac{1}{t}\right) \cdot z} \]

      6. metadata-eval N/A

         \[\leadsto \left(\color{blue}{\frac{-1}{2}} \cdot \frac{1}{t}\right) \cdot z \]

      7. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{\frac{-1}{2} \cdot 1}{t}} \cdot z \]

      8. metadata-eval N/A

         \[\leadsto \frac{\color{blue}{\frac{-1}{2}}}{t} \cdot z \]

      9. lower-/.f64 63.5

         \[\leadsto \color{blue}{\frac{-0.5}{t}} \cdot z \]

   5. Applied rewrites 63.5%

      \[\leadsto \color{blue}{\frac{-0.5}{t} \cdot z} \]
   6. Step-by-step derivation

   7. Applied rewrites 63.7%

      \[\leadsto \frac{-0.5 \cdot z}{\color{blue}{t}} \]

   if 2.00000000000000009e48 < (+.f64 x y)

   1. Initial program 99.9%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{x + y}{t}} \]
   4. Step-by-step derivation

      1. div-add-rev N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. div-add-rev N/A

         \[\leadsto \color{blue}{\frac{x + y}{t}} \cdot \frac{1}{2} \]

      5. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x + y}{t}} \cdot \frac{1}{2} \]

      6. +-commutative N/A

         \[\leadsto \frac{\color{blue}{y + x}}{t} \cdot \frac{1}{2} \]

      7. lower-+.f64 80.8

         \[\leadsto \frac{\color{blue}{y + x}}{t} \cdot 0.5 \]

   5. Applied rewrites 80.8%

      \[\leadsto \color{blue}{\frac{y + x}{t} \cdot 0.5} \]

   6. Taylor expanded in x around 0

      \[\leadsto \frac{y}{t} \cdot \frac{1}{2} \]
   7. Step-by-step derivation

   8. Applied rewrites 47.5%

      \[\leadsto \frac{y}{t} \cdot 0.5 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 76.6% accurate, 0.7× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \begin{array}{l} \mathbf{if}\;x + y \leq -1 \cdot 10^{-74}:\\ \;\;\;\;\frac{x}{t} \cdot 0.5\\ \mathbf{elif}\;x + y \leq 2 \cdot 10^{+48}:\\ \;\;\;\;\frac{-0.5}{t} \cdot z\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{t} \cdot 0.5\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
 :precision binary64
 (if (<= (+ x y) -1e-74)
   (* (/ x t) 0.5)
   (if (<= (+ x y) 2e+48) (* (/ -0.5 t) z) (* (/ y t) 0.5))))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= -1e-74) {
		tmp = (x / t) * 0.5;
	} else if ((x + y) <= 2e+48) {
		tmp = (-0.5 / t) * z;
	} else {
		tmp = (y / t) * 0.5;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((x + y) <= (-1d-74)) then
        tmp = (x / t) * 0.5d0
    else if ((x + y) <= 2d+48) then
        tmp = ((-0.5d0) / t) * z
    else
        tmp = (y / t) * 0.5d0
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= -1e-74) {
		tmp = (x / t) * 0.5;
	} else if ((x + y) <= 2e+48) {
		tmp = (-0.5 / t) * z;
	} else {
		tmp = (y / t) * 0.5;
	}
	return tmp;
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	tmp = 0
	if (x + y) <= -1e-74:
		tmp = (x / t) * 0.5
	elif (x + y) <= 2e+48:
		tmp = (-0.5 / t) * z
	else:
		tmp = (y / t) * 0.5
	return tmp

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x + y) <= -1e-74)
		tmp = Float64(Float64(x / t) * 0.5);
	elseif (Float64(x + y) <= 2e+48)
		tmp = Float64(Float64(-0.5 / t) * z);
	else
		tmp = Float64(Float64(y / t) * 0.5);
	end
	return tmp
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x + y) <= -1e-74)
		tmp = (x / t) * 0.5;
	elseif ((x + y) <= 2e+48)
		tmp = (-0.5 / t) * z;
	else
		tmp = (y / t) * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := If[LessEqual[N[(x + y), $MachinePrecision], -1e-74], N[(N[(x / t), $MachinePrecision] * 0.5), $MachinePrecision], If[LessEqual[N[(x + y), $MachinePrecision], 2e+48], N[(N[(-0.5 / t), $MachinePrecision] * z), $MachinePrecision], N[(N[(y / t), $MachinePrecision] * 0.5), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 x y) < -9.99999999999999958e-75

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{x}{t}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{x}{t} \cdot \frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{x}{t} \cdot \frac{1}{2}} \]

      3. lower-/.f64 44.5

         \[\leadsto \color{blue}{\frac{x}{t}} \cdot 0.5 \]

   5. Applied rewrites 44.5%

      \[\leadsto \color{blue}{\frac{x}{t} \cdot 0.5} \]

   if -9.99999999999999958e-75 < (+.f64 x y) < 2.00000000000000009e48

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot \frac{z}{t}} \]
   4. Step-by-step derivation

      1. *-lft-identity N/A

         \[\leadsto \frac{-1}{2} \cdot \frac{\color{blue}{1 \cdot z}}{t} \]

      2. associate-*l/ N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{\left(\frac{1}{t} \cdot z\right)} \]

      3. associate-*l* N/A

         \[\leadsto \color{blue}{\left(\frac{-1}{2} \cdot \frac{1}{t}\right) \cdot z} \]

      4. metadata-eval N/A

         \[\leadsto \left(\color{blue}{\left(\mathsf{neg}\left(\frac{1}{2}\right)\right)} \cdot \frac{1}{t}\right) \cdot z \]

      5. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot \frac{1}{t}\right) \cdot z} \]

      6. metadata-eval N/A

         \[\leadsto \left(\color{blue}{\frac{-1}{2}} \cdot \frac{1}{t}\right) \cdot z \]

      7. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{\frac{-1}{2} \cdot 1}{t}} \cdot z \]

      8. metadata-eval N/A

         \[\leadsto \frac{\color{blue}{\frac{-1}{2}}}{t} \cdot z \]

      9. lower-/.f64 63.5

         \[\leadsto \color{blue}{\frac{-0.5}{t}} \cdot z \]

   5. Applied rewrites 63.5%

      \[\leadsto \color{blue}{\frac{-0.5}{t} \cdot z} \]

   if 2.00000000000000009e48 < (+.f64 x y)

   1. Initial program 99.9%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{x + y}{t}} \]
   4. Step-by-step derivation

      1. div-add-rev N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. div-add-rev N/A

         \[\leadsto \color{blue}{\frac{x + y}{t}} \cdot \frac{1}{2} \]

      5. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x + y}{t}} \cdot \frac{1}{2} \]

      6. +-commutative N/A

         \[\leadsto \frac{\color{blue}{y + x}}{t} \cdot \frac{1}{2} \]

      7. lower-+.f64 80.8

         \[\leadsto \frac{\color{blue}{y + x}}{t} \cdot 0.5 \]

   5. Applied rewrites 80.8%

      \[\leadsto \color{blue}{\frac{y + x}{t} \cdot 0.5} \]

   6. Taylor expanded in x around 0

      \[\leadsto \frac{y}{t} \cdot \frac{1}{2} \]
   7. Step-by-step derivation

   8. Applied rewrites 47.5%

      \[\leadsto \frac{y}{t} \cdot 0.5 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 5: 76.5% accurate, 0.7× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \begin{array}{l} \mathbf{if}\;x + y \leq -1 \cdot 10^{-74}:\\ \;\;\;\;x \cdot \frac{0.5}{t}\\ \mathbf{elif}\;x + y \leq 2 \cdot 10^{+48}:\\ \;\;\;\;\frac{-0.5}{t} \cdot z\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{t} \cdot 0.5\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
 :precision binary64
 (if (<= (+ x y) -1e-74)
   (* x (/ 0.5 t))
   (if (<= (+ x y) 2e+48) (* (/ -0.5 t) z) (* (/ y t) 0.5))))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= -1e-74) {
		tmp = x * (0.5 / t);
	} else if ((x + y) <= 2e+48) {
		tmp = (-0.5 / t) * z;
	} else {
		tmp = (y / t) * 0.5;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((x + y) <= (-1d-74)) then
        tmp = x * (0.5d0 / t)
    else if ((x + y) <= 2d+48) then
        tmp = ((-0.5d0) / t) * z
    else
        tmp = (y / t) * 0.5d0
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= -1e-74) {
		tmp = x * (0.5 / t);
	} else if ((x + y) <= 2e+48) {
		tmp = (-0.5 / t) * z;
	} else {
		tmp = (y / t) * 0.5;
	}
	return tmp;
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	tmp = 0
	if (x + y) <= -1e-74:
		tmp = x * (0.5 / t)
	elif (x + y) <= 2e+48:
		tmp = (-0.5 / t) * z
	else:
		tmp = (y / t) * 0.5
	return tmp

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x + y) <= -1e-74)
		tmp = Float64(x * Float64(0.5 / t));
	elseif (Float64(x + y) <= 2e+48)
		tmp = Float64(Float64(-0.5 / t) * z);
	else
		tmp = Float64(Float64(y / t) * 0.5);
	end
	return tmp
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x + y) <= -1e-74)
		tmp = x * (0.5 / t);
	elseif ((x + y) <= 2e+48)
		tmp = (-0.5 / t) * z;
	else
		tmp = (y / t) * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := If[LessEqual[N[(x + y), $MachinePrecision], -1e-74], N[(x * N[(0.5 / t), $MachinePrecision]), $MachinePrecision], If[LessEqual[N[(x + y), $MachinePrecision], 2e+48], N[(N[(-0.5 / t), $MachinePrecision] * z), $MachinePrecision], N[(N[(y / t), $MachinePrecision] * 0.5), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if (+.f64 x y) < -9.99999999999999958e-75

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{x}{t}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\frac{x}{t} \cdot \frac{1}{2}} \]

      2. lower-*.f64 N/A

         \[\leadsto \color{blue}{\frac{x}{t} \cdot \frac{1}{2}} \]

      3. lower-/.f64 44.5

         \[\leadsto \color{blue}{\frac{x}{t}} \cdot 0.5 \]

   5. Applied rewrites 44.5%

      \[\leadsto \color{blue}{\frac{x}{t} \cdot 0.5} \]
   6. Step-by-step derivation

   7. Applied rewrites 44.5%

      \[\leadsto x \cdot \color{blue}{\frac{0.5}{t}} \]

   if -9.99999999999999958e-75 < (+.f64 x y) < 2.00000000000000009e48

   1. Initial program 99.9%

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

   3. Taylor expanded in z around inf

      \[\leadsto \color{blue}{\frac{-1}{2} \cdot \frac{z}{t}} \]
   4. Step-by-step derivation

      1. *-lft-identity N/A

         \[\leadsto \frac{-1}{2} \cdot \frac{\color{blue}{1 \cdot z}}{t} \]

      2. associate-*l/ N/A

         \[\leadsto \frac{-1}{2} \cdot \color{blue}{\left(\frac{1}{t} \cdot z\right)} \]

      3. associate-*l* N/A

         \[\leadsto \color{blue}{\left(\frac{-1}{2} \cdot \frac{1}{t}\right) \cdot z} \]

      4. metadata-eval N/A

         \[\leadsto \left(\color{blue}{\left(\mathsf{neg}\left(\frac{1}{2}\right)\right)} \cdot \frac{1}{t}\right) \cdot z \]

      5. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot \frac{1}{t}\right) \cdot z} \]

      6. metadata-eval N/A

         \[\leadsto \left(\color{blue}{\frac{-1}{2}} \cdot \frac{1}{t}\right) \cdot z \]

      7. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{\frac{-1}{2} \cdot 1}{t}} \cdot z \]

      8. metadata-eval N/A

         \[\leadsto \frac{\color{blue}{\frac{-1}{2}}}{t} \cdot z \]

      9. lower-/.f64 63.5

         \[\leadsto \color{blue}{\frac{-0.5}{t}} \cdot z \]

   5. Applied rewrites 63.5%

      \[\leadsto \color{blue}{\frac{-0.5}{t} \cdot z} \]

   if 2.00000000000000009e48 < (+.f64 x y)

   1. Initial program 99.9%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{x + y}{t}} \]
   4. Step-by-step derivation

      1. div-add-rev N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. div-add-rev N/A

         \[\leadsto \color{blue}{\frac{x + y}{t}} \cdot \frac{1}{2} \]

      5. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x + y}{t}} \cdot \frac{1}{2} \]

      6. +-commutative N/A

         \[\leadsto \frac{\color{blue}{y + x}}{t} \cdot \frac{1}{2} \]

      7. lower-+.f64 80.8

         \[\leadsto \frac{\color{blue}{y + x}}{t} \cdot 0.5 \]

   5. Applied rewrites 80.8%

      \[\leadsto \color{blue}{\frac{y + x}{t} \cdot 0.5} \]

   6. Taylor expanded in x around 0

      \[\leadsto \frac{y}{t} \cdot \frac{1}{2} \]
   7. Step-by-step derivation

   8. Applied rewrites 47.5%

      \[\leadsto \frac{y}{t} \cdot 0.5 \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 6: 85.6% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \begin{array}{l} \mathbf{if}\;z \leq -1.2 \cdot 10^{-59} \lor \neg \left(z \leq 3.2 \cdot 10^{+34}\right):\\ \;\;\;\;\frac{x - z}{t + t}\\ \mathbf{else}:\\ \;\;\;\;\frac{y + x}{t + t}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
 :precision binary64
 (if (or (<= z -1.2e-59) (not (<= z 3.2e+34)))
   (/ (- x z) (+ t t))
   (/ (+ y x) (+ t t))))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -1.2e-59) || !(z <= 3.2e+34)) {
		tmp = (x - z) / (t + t);
	} else {
		tmp = (y + x) / (t + t);
	}
	return tmp;
}

Fortran

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((z <= (-1.2d-59)) .or. (.not. (z <= 3.2d+34))) then
        tmp = (x - z) / (t + t)
    else
        tmp = (y + x) / (t + t)
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((z <= -1.2e-59) || !(z <= 3.2e+34)) {
		tmp = (x - z) / (t + t);
	} else {
		tmp = (y + x) / (t + t);
	}
	return tmp;
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	tmp = 0
	if (z <= -1.2e-59) or not (z <= 3.2e+34):
		tmp = (x - z) / (t + t)
	else:
		tmp = (y + x) / (t + t)
	return tmp

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	tmp = 0.0
	if ((z <= -1.2e-59) || !(z <= 3.2e+34))
		tmp = Float64(Float64(x - z) / Float64(t + t));
	else
		tmp = Float64(Float64(y + x) / Float64(t + t));
	end
	return tmp
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((z <= -1.2e-59) || ~((z <= 3.2e+34)))
		tmp = (x - z) / (t + t);
	else
		tmp = (y + x) / (t + t);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := If[Or[LessEqual[z, -1.2e-59], N[Not[LessEqual[z, 3.2e+34]], $MachinePrecision]], N[(N[(x - z), $MachinePrecision] / N[(t + t), $MachinePrecision]), $MachinePrecision], N[(N[(y + x), $MachinePrecision] / N[(t + t), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if z < -1.20000000000000008e-59 or 3.1999999999999998e34 < z

   1. Initial program 100.0%

      \[\frac{\left(x + y\right) - z}{t \cdot 2} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift--.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. associate--l+ N/A

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

      4. +-commutative N/A

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

      5. associate-+l- N/A

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

      6. lower--.f64 N/A

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

      7. lower--.f64 100.0

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

   4. Applied rewrites 100.0%

      \[\leadsto \frac{\color{blue}{y - \left(z - x\right)}}{t \cdot 2} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. count-2-rev N/A

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

      4. lower-+.f64 100.0

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

   6. Applied rewrites 100.0%

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

   7. Taylor expanded in y around 0

      \[\leadsto \frac{\color{blue}{x - z}}{t + t} \]
   8. Step-by-step derivation

      1. lower--.f64 85.2

         \[\leadsto \frac{\color{blue}{x - z}}{t + t} \]

   9. Applied rewrites 85.2%

      \[\leadsto \frac{\color{blue}{x - z}}{t + t} \]

   if -1.20000000000000008e-59 < z < 3.1999999999999998e34

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0

      \[\leadsto \frac{\color{blue}{y - z}}{t \cdot 2} \]
   4. Step-by-step derivation

      1. lower--.f64 62.3

         \[\leadsto \frac{\color{blue}{y - z}}{t \cdot 2} \]

   5. Applied rewrites 62.3%

      \[\leadsto \frac{\color{blue}{y - z}}{t \cdot 2} \]
   6. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \frac{y - z}{\color{blue}{t \cdot 2}} \]

      2. *-commutative N/A

         \[\leadsto \frac{y - z}{\color{blue}{2 \cdot t}} \]

      3. count-2-rev N/A

         \[\leadsto \frac{y - z}{\color{blue}{t + t}} \]

      4. lower-+.f64 62.3

         \[\leadsto \frac{y - z}{\color{blue}{t + t}} \]

   7. Applied rewrites 62.3%

      \[\leadsto \frac{y - z}{\color{blue}{t + t}} \]

   8. Taylor expanded in z around 0

      \[\leadsto \frac{\color{blue}{x + y}}{t + t} \]
   9. Step-by-step derivation

      1. +-commutative N/A

         \[\leadsto \frac{\color{blue}{y + x}}{t + t} \]

      2. lower-+.f64 93.8

         \[\leadsto \frac{\color{blue}{y + x}}{t + t} \]

   10. Applied rewrites 93.8%

       \[\leadsto \frac{\color{blue}{y + x}}{t + t} \]
3. Recombined 2 regimes into one program.

4. Final simplification 89.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;z \leq -1.2 \cdot 10^{-59} \lor \neg \left(z \leq 3.2 \cdot 10^{+34}\right):\\ \;\;\;\;\frac{x - z}{t + t}\\ \mathbf{else}:\\ \;\;\;\;\frac{y + x}{t + t}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 99.1% accurate, 0.9× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \begin{array}{l} \mathbf{if}\;x + y \leq -1 \cdot 10^{-200}:\\ \;\;\;\;\frac{x - z}{t + t}\\ \mathbf{else}:\\ \;\;\;\;\frac{y - z}{t + t}\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
 :precision binary64
 (if (<= (+ x y) -1e-200) (/ (- x z) (+ t t)) (/ (- y z) (+ t t))))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= -1e-200) {
		tmp = (x - z) / (t + t);
	} else {
		tmp = (y - z) / (t + t);
	}
	return tmp;
}

Fortran

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((x + y) <= (-1d-200)) then
        tmp = (x - z) / (t + t)
    else
        tmp = (y - z) / (t + t)
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= -1e-200) {
		tmp = (x - z) / (t + t);
	} else {
		tmp = (y - z) / (t + t);
	}
	return tmp;
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	tmp = 0
	if (x + y) <= -1e-200:
		tmp = (x - z) / (t + t)
	else:
		tmp = (y - z) / (t + t)
	return tmp

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x + y) <= -1e-200)
		tmp = Float64(Float64(x - z) / Float64(t + t));
	else
		tmp = Float64(Float64(y - z) / Float64(t + t));
	end
	return tmp
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x + y) <= -1e-200)
		tmp = (x - z) / (t + t);
	else
		tmp = (y - z) / (t + t);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := If[LessEqual[N[(x + y), $MachinePrecision], -1e-200], N[(N[(x - z), $MachinePrecision] / N[(t + t), $MachinePrecision]), $MachinePrecision], N[(N[(y - z), $MachinePrecision] / N[(t + t), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 x y) < -9.9999999999999998e-201

   1. Initial program 100.0%

      \[\frac{\left(x + y\right) - z}{t \cdot 2} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift--.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. associate--l+ N/A

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

      4. +-commutative N/A

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

      5. associate-+l- N/A

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

      6. lower--.f64 N/A

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

      7. lower--.f64 100.0

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

   4. Applied rewrites 100.0%

      \[\leadsto \frac{\color{blue}{y - \left(z - x\right)}}{t \cdot 2} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. count-2-rev N/A

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

      4. lower-+.f64 100.0

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

   6. Applied rewrites 100.0%

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

   7. Taylor expanded in y around 0

      \[\leadsto \frac{\color{blue}{x - z}}{t + t} \]
   8. Step-by-step derivation

      1. lower--.f64 71.0

         \[\leadsto \frac{\color{blue}{x - z}}{t + t} \]

   9. Applied rewrites 71.0%

      \[\leadsto \frac{\color{blue}{x - z}}{t + t} \]

   if -9.9999999999999998e-201 < (+.f64 x y)

   1. Initial program 99.9%

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

   3. Taylor expanded in x around 0

      \[\leadsto \frac{\color{blue}{y - z}}{t \cdot 2} \]
   4. Step-by-step derivation

      1. lower--.f64 76.6

         \[\leadsto \frac{\color{blue}{y - z}}{t \cdot 2} \]

   5. Applied rewrites 76.6%

      \[\leadsto \frac{\color{blue}{y - z}}{t \cdot 2} \]
   6. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \frac{y - z}{\color{blue}{t \cdot 2}} \]

      2. *-commutative N/A

         \[\leadsto \frac{y - z}{\color{blue}{2 \cdot t}} \]

      3. count-2-rev N/A

         \[\leadsto \frac{y - z}{\color{blue}{t + t}} \]

      4. lower-+.f64 76.6

         \[\leadsto \frac{y - z}{\color{blue}{t + t}} \]

   7. Applied rewrites 76.6%

      \[\leadsto \frac{y - z}{\color{blue}{t + t}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 73.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x + y \leq -1 \cdot 10^{-200}:\\ \;\;\;\;\frac{x - z}{t + t}\\ \mathbf{else}:\\ \;\;\;\;\frac{y - z}{t + t}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 87.7% accurate, 0.9× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ \begin{array}{l} \mathbf{if}\;x + y \leq 2 \cdot 10^{+48}:\\ \;\;\;\;\frac{x - z}{t + t}\\ \mathbf{else}:\\ \;\;\;\;\frac{y}{t} \cdot 0.5\\ \end{array} \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t)
 :precision binary64
 (if (<= (+ x y) 2e+48) (/ (- x z) (+ t t)) (* (/ y t) 0.5)))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= 2e+48) {
		tmp = (x - z) / (t + t);
	} else {
		tmp = (y / t) * 0.5;
	}
	return tmp;
}

Fortran

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    real(8) :: tmp
    if ((x + y) <= 2d+48) then
        tmp = (x - z) / (t + t)
    else
        tmp = (y / t) * 0.5d0
    end if
    code = tmp
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	double tmp;
	if ((x + y) <= 2e+48) {
		tmp = (x - z) / (t + t);
	} else {
		tmp = (y / t) * 0.5;
	}
	return tmp;
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	tmp = 0
	if (x + y) <= 2e+48:
		tmp = (x - z) / (t + t)
	else:
		tmp = (y / t) * 0.5
	return tmp

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	tmp = 0.0
	if (Float64(x + y) <= 2e+48)
		tmp = Float64(Float64(x - z) / Float64(t + t));
	else
		tmp = Float64(Float64(y / t) * 0.5);
	end
	return tmp
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp_2 = code(x, y, z, t)
	tmp = 0.0;
	if ((x + y) <= 2e+48)
		tmp = (x - z) / (t + t);
	else
		tmp = (y / t) * 0.5;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := If[LessEqual[N[(x + y), $MachinePrecision], 2e+48], N[(N[(x - z), $MachinePrecision] / N[(t + t), $MachinePrecision]), $MachinePrecision], N[(N[(y / t), $MachinePrecision] * 0.5), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 x y) < 2.00000000000000009e48

   1. Initial program 100.0%

      \[\frac{\left(x + y\right) - z}{t \cdot 2} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift--.f64 N/A

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

      2. lift-+.f64 N/A

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

      3. associate--l+ N/A

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

      4. +-commutative N/A

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

      5. associate-+l- N/A

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

      6. lower--.f64 N/A

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

      7. lower--.f64 100.0

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

   4. Applied rewrites 100.0%

      \[\leadsto \frac{\color{blue}{y - \left(z - x\right)}}{t \cdot 2} \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. count-2-rev N/A

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

      4. lower-+.f64 100.0

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

   6. Applied rewrites 100.0%

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

   7. Taylor expanded in y around 0

      \[\leadsto \frac{\color{blue}{x - z}}{t + t} \]
   8. Step-by-step derivation

      1. lower--.f64 71.1

         \[\leadsto \frac{\color{blue}{x - z}}{t + t} \]

   9. Applied rewrites 71.1%

      \[\leadsto \frac{\color{blue}{x - z}}{t + t} \]

   if 2.00000000000000009e48 < (+.f64 x y)

   1. Initial program 99.9%

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

   3. Taylor expanded in z around 0

      \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{x + y}{t}} \]
   4. Step-by-step derivation

      1. div-add-rev N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 N/A

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

      4. div-add-rev N/A

         \[\leadsto \color{blue}{\frac{x + y}{t}} \cdot \frac{1}{2} \]

      5. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{x + y}{t}} \cdot \frac{1}{2} \]

      6. +-commutative N/A

         \[\leadsto \frac{\color{blue}{y + x}}{t} \cdot \frac{1}{2} \]

      7. lower-+.f64 80.8

         \[\leadsto \frac{\color{blue}{y + x}}{t} \cdot 0.5 \]

   5. Applied rewrites 80.8%

      \[\leadsto \color{blue}{\frac{y + x}{t} \cdot 0.5} \]

   6. Taylor expanded in x around 0

      \[\leadsto \frac{y}{t} \cdot \frac{1}{2} \]
   7. Step-by-step derivation

   8. Applied rewrites 47.5%

      \[\leadsto \frac{y}{t} \cdot 0.5 \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 36.4% accurate, 1.4× speedup

Math

\[\begin{array}{l} [x, y, z, t] = \mathsf{sort}([x, y, z, t])\\ \\ x \cdot \frac{0.5}{t} \end{array} \]

FPCore

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
(FPCore (x y z t) :precision binary64 (* x (/ 0.5 t)))

C

assert(x < y && y < z && z < t);
double code(double x, double y, double z, double t) {
	return x * (0.5 / t);
}

Fortran

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
real(8) function code(x, y, z, t)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8), intent (in) :: z
    real(8), intent (in) :: t
    code = x * (0.5d0 / t)
end function

Java

assert x < y && y < z && z < t;
public static double code(double x, double y, double z, double t) {
	return x * (0.5 / t);
}

Python

[x, y, z, t] = sort([x, y, z, t])
def code(x, y, z, t):
	return x * (0.5 / t)

Julia

x, y, z, t = sort([x, y, z, t])
function code(x, y, z, t)
	return Float64(x * Float64(0.5 / t))
end

MATLAB

x, y, z, t = num2cell(sort([x, y, z, t])){:}
function tmp = code(x, y, z, t)
	tmp = x * (0.5 / t);
end

Wolfram

NOTE: x, y, z, and t should be sorted in increasing order before calling this function.
code[x_, y_, z_, t_] := N[(x * N[(0.5 / t), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

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

3. Taylor expanded in x around inf

   \[\leadsto \color{blue}{\frac{1}{2} \cdot \frac{x}{t}} \]
4. Step-by-step derivation

   1. *-commutative N/A

      \[\leadsto \color{blue}{\frac{x}{t} \cdot \frac{1}{2}} \]

   2. lower-*.f64 N/A

      \[\leadsto \color{blue}{\frac{x}{t} \cdot \frac{1}{2}} \]

   3. lower-/.f64 34.0

      \[\leadsto \color{blue}{\frac{x}{t}} \cdot 0.5 \]

5. Applied rewrites 34.0%

   \[\leadsto \color{blue}{\frac{x}{t} \cdot 0.5} \]
6. Step-by-step derivation

7. Applied rewrites 33.9%

   \[\leadsto x \cdot \color{blue}{\frac{0.5}{t}} \]
8. Add Preprocessing

Reproduce

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