AI.Clustering.Hierarchical.Internal:average from clustering-0.2.1, A

Percentage Accurate: 100.0% → 100.0%

Time: 3.8s

Alternatives: 4

Speedup: 1.0×

Specification

Math

\[\begin{array}{l} \\ \frac{x}{x + y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (/ x (+ x y)))

C

double code(double x, double y) {
	return x / (x + y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x / (x + y)
end function

Java

public static double code(double x, double y) {
	return x / (x + y);
}

Python

def code(x, y):
	return x / (x + y)

Julia

function code(x, y)
	return Float64(x / Float64(x + y))
end

MATLAB

function tmp = code(x, y)
	tmp = x / (x + y);
end

Wolfram

code[x_, y_] := N[(x / N[(x + y), $MachinePrecision]), $MachinePrecision]

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x}{x + y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (/ x (+ x y)))

C

double code(double x, double y) {
	return x / (x + y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x / (x + y)
end function

Java

public static double code(double x, double y) {
	return x / (x + y);
}

Python

def code(x, y):
	return x / (x + y)

Julia

function code(x, y)
	return Float64(x / Float64(x + y))
end

MATLAB

function tmp = code(x, y)
	tmp = x / (x + y);
end

Wolfram

code[x_, y_] := N[(x / N[(x + y), $MachinePrecision]), $MachinePrecision]

Alternative 1: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \frac{x}{x + y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (/ x (+ x y)))

C

double code(double x, double y) {
	return x / (x + y);
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x / (x + y)
end function

Java

public static double code(double x, double y) {
	return x / (x + y);
}

Python

def code(x, y):
	return x / (x + y)

Julia

function code(x, y)
	return Float64(x / Float64(x + y))
end

MATLAB

function tmp = code(x, y)
	tmp = x / (x + y);
end

Wolfram

code[x_, y_] := N[(x / N[(x + y), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\frac{x}{x + y} \]

2. Final simplification 100.0%

   \[\leadsto \frac{x}{x + y} \]

Alternative 2: 74.2% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -2.5 \cdot 10^{+56} \lor \neg \left(x \leq 2.7 \cdot 10^{+41}\right):\\ \;\;\;\;1 - \frac{y}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -2.5e+56) (not (<= x 2.7e+41))) (- 1.0 (/ y x)) (/ x y)))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -2.5e+56) || !(x <= 2.7e+41)) {
		tmp = 1.0 - (y / x);
	} else {
		tmp = x / y;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((x <= (-2.5d+56)) .or. (.not. (x <= 2.7d+41))) then
        tmp = 1.0d0 - (y / x)
    else
        tmp = x / y
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((x <= -2.5e+56) || !(x <= 2.7e+41)) {
		tmp = 1.0 - (y / x);
	} else {
		tmp = x / y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -2.5e+56) or not (x <= 2.7e+41):
		tmp = 1.0 - (y / x)
	else:
		tmp = x / y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -2.5e+56) || !(x <= 2.7e+41))
		tmp = Float64(1.0 - Float64(y / x));
	else
		tmp = Float64(x / y);
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -2.5e+56) || ~((x <= 2.7e+41)))
		tmp = 1.0 - (y / x);
	else
		tmp = x / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -2.5e+56], N[Not[LessEqual[x, 2.7e+41]], $MachinePrecision]], N[(1.0 - N[(y / x), $MachinePrecision]), $MachinePrecision], N[(x / y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -2.50000000000000012e56 or 2.7e41 < x

   1. Initial program 100.0%

      \[\frac{x}{x + y} \]

   2. Taylor expanded in x around inf 88.1%

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

      1. mul-1-neg 88.1%

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

      2. unsub-neg 88.1%

         \[\leadsto \color{blue}{1 - \frac{y}{x}} \]

   4. Simplified 88.1%

      \[\leadsto \color{blue}{1 - \frac{y}{x}} \]

   if -2.50000000000000012e56 < x < 2.7e41

   1. Initial program 100.0%

      \[\frac{x}{x + y} \]

   2. Taylor expanded in x around 0 77.9%

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

4. Final simplification 82.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -2.5 \cdot 10^{+56} \lor \neg \left(x \leq 2.7 \cdot 10^{+41}\right):\\ \;\;\;\;1 - \frac{y}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y}\\ \end{array} \]

Alternative 3: 74.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -4.3 \cdot 10^{+55}:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 1.55 \cdot 10^{+36}:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -4.3e+55) 1.0 (if (<= x 1.55e+36) (/ x y) 1.0)))

C

double code(double x, double y) {
	double tmp;
	if (x <= -4.3e+55) {
		tmp = 1.0;
	} else if (x <= 1.55e+36) {
		tmp = x / y;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (x <= (-4.3d+55)) then
        tmp = 1.0d0
    else if (x <= 1.55d+36) then
        tmp = x / y
    else
        tmp = 1.0d0
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if (x <= -4.3e+55) {
		tmp = 1.0;
	} else if (x <= 1.55e+36) {
		tmp = x / y;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -4.3e+55:
		tmp = 1.0
	elif x <= 1.55e+36:
		tmp = x / y
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -4.3e+55)
		tmp = 1.0;
	elseif (x <= 1.55e+36)
		tmp = Float64(x / y);
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -4.3e+55)
		tmp = 1.0;
	elseif (x <= 1.55e+36)
		tmp = x / y;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -4.3e+55], 1.0, If[LessEqual[x, 1.55e+36], N[(x / y), $MachinePrecision], 1.0]]

Derivation

1. Split input into 2 regimes

2. if x < -4.2999999999999999e55 or 1.55e36 < x

   1. Initial program 100.0%

      \[\frac{x}{x + y} \]

   2. Taylor expanded in x around inf 86.2%

      \[\leadsto \color{blue}{1} \]

   if -4.2999999999999999e55 < x < 1.55e36

   1. Initial program 100.0%

      \[\frac{x}{x + y} \]

   2. Taylor expanded in x around 0 78.7%

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

4. Final simplification 81.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -4.3 \cdot 10^{+55}:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 1.55 \cdot 10^{+36}:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \]

Alternative 4: 50.1% accurate, 5.0× speedup

Math

\[\begin{array}{l} \\ 1 \end{array} \]

FPCore

(FPCore (x y) :precision binary64 1.0)

C

double code(double x, double y) {
	return 1.0;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = 1.0d0
end function

Java

public static double code(double x, double y) {
	return 1.0;
}

Python

def code(x, y):
	return 1.0

Julia

function code(x, y)
	return 1.0
end

MATLAB

function tmp = code(x, y)
	tmp = 1.0;
end

Wolfram

code[x_, y_] := 1.0

Derivation

1. Initial program 100.0%

   \[\frac{x}{x + y} \]

2. Taylor expanded in x around inf 50.0%

   \[\leadsto \color{blue}{1} \]

3. Final simplification 50.0%

   \[\leadsto 1 \]

Reproduce

herbie shell --seed 2023182 
(FPCore (x y)
  :name "AI.Clustering.Hierarchical.Internal:average from clustering-0.2.1, A"
  :precision binary64
  (/ x (+ x y)))