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

Percentage Accurate: 100.0% → 100.0%

Time: 4.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 99.9%

   \[\frac{x}{x + y} \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 2: 75.1% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -9.5 \cdot 10^{-30} \lor \neg \left(x \leq 2.9 \cdot 10^{-10}\right):\\ \;\;\;\;1 - \frac{y}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= x -9.5e-30) (not (<= x 2.9e-10))) (- 1.0 (/ y x)) (/ x y)))

C

double code(double x, double y) {
	double tmp;
	if ((x <= -9.5e-30) || !(x <= 2.9e-10)) {
		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 <= (-9.5d-30)) .or. (.not. (x <= 2.9d-10))) 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 <= -9.5e-30) || !(x <= 2.9e-10)) {
		tmp = 1.0 - (y / x);
	} else {
		tmp = x / y;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (x <= -9.5e-30) or not (x <= 2.9e-10):
		tmp = 1.0 - (y / x)
	else:
		tmp = x / y
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((x <= -9.5e-30) || !(x <= 2.9e-10))
		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 <= -9.5e-30) || ~((x <= 2.9e-10)))
		tmp = 1.0 - (y / x);
	else
		tmp = x / y;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[x, -9.5e-30], N[Not[LessEqual[x, 2.9e-10]], $MachinePrecision]], N[(1.0 - N[(y / x), $MachinePrecision]), $MachinePrecision], N[(x / y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -9.49999999999999939e-30 or 2.89999999999999981e-10 < x

   1. Initial program 99.9%

      \[\frac{x}{x + y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 77.3%

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

      1. mul-1-neg 77.3%

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

      2. unsub-neg 77.3%

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

   5. Simplified 77.3%

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

   if -9.49999999999999939e-30 < x < 2.89999999999999981e-10

   1. Initial program 100.0%

      \[\frac{x}{x + y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 81.6%

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

4. Final simplification 79.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -9.5 \cdot 10^{-30} \lor \neg \left(x \leq 2.9 \cdot 10^{-10}\right):\\ \;\;\;\;1 - \frac{y}{x}\\ \mathbf{else}:\\ \;\;\;\;\frac{x}{y}\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 75.2% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -6 \cdot 10^{-30}:\\ \;\;\;\;1\\ \mathbf{elif}\;x \leq 4.1 \cdot 10^{-11}:\\ \;\;\;\;\frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (<= x -6e-30) 1.0 (if (<= x 4.1e-11) (/ x y) 1.0)))

C

double code(double x, double y) {
	double tmp;
	if (x <= -6e-30) {
		tmp = 1.0;
	} else if (x <= 4.1e-11) {
		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 <= (-6d-30)) then
        tmp = 1.0d0
    else if (x <= 4.1d-11) 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 <= -6e-30) {
		tmp = 1.0;
	} else if (x <= 4.1e-11) {
		tmp = x / y;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if x <= -6e-30:
		tmp = 1.0
	elif x <= 4.1e-11:
		tmp = x / y
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if (x <= -6e-30)
		tmp = 1.0;
	elseif (x <= 4.1e-11)
		tmp = Float64(x / y);
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if (x <= -6e-30)
		tmp = 1.0;
	elseif (x <= 4.1e-11)
		tmp = x / y;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[LessEqual[x, -6e-30], 1.0, If[LessEqual[x, 4.1e-11], N[(x / y), $MachinePrecision], 1.0]]

Derivation

1. Split input into 2 regimes

2. if x < -5.9999999999999998e-30 or 4.1000000000000001e-11 < x

   1. Initial program 99.9%

      \[\frac{x}{x + y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf 76.7%

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

   if -5.9999999999999998e-30 < x < 4.1000000000000001e-11

   1. Initial program 100.0%

      \[\frac{x}{x + y} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0 81.6%

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

Alternative 4: 51.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 99.9%

   \[\frac{x}{x + y} \]
2. Add Preprocessing

3. Taylor expanded in x around inf 48.7%

   \[\leadsto \color{blue}{1} \]
4. Add Preprocessing

Reproduce

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