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

Percentage Accurate: 100.0% → 100.0%

Time: 3.5s

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. Add Preprocessing
3. Add Preprocessing

Alternative 2: 73.2% accurate, 0.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.8 \cdot 10^{+69} \lor \neg \left(y \leq 4.6 \cdot 10^{+62}\right):\\ \;\;\;\;\frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;1 - \frac{y}{x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -2.8e+69) (not (<= y 4.6e+62))) (/ x y) (- 1.0 (/ y x))))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -2.8e+69) || !(y <= 4.6e+62)) {
		tmp = x / y;
	} else {
		tmp = 1.0 - (y / x);
	}
	return tmp;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((y <= (-2.8d+69)) .or. (.not. (y <= 4.6d+62))) then
        tmp = x / y
    else
        tmp = 1.0d0 - (y / x)
    end if
    code = tmp
end function

Java

public static double code(double x, double y) {
	double tmp;
	if ((y <= -2.8e+69) || !(y <= 4.6e+62)) {
		tmp = x / y;
	} else {
		tmp = 1.0 - (y / x);
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -2.8e+69) or not (y <= 4.6e+62):
		tmp = x / y
	else:
		tmp = 1.0 - (y / x)
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -2.8e+69) || !(y <= 4.6e+62))
		tmp = Float64(x / y);
	else
		tmp = Float64(1.0 - Float64(y / x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -2.8e+69) || ~((y <= 4.6e+62)))
		tmp = x / y;
	else
		tmp = 1.0 - (y / x);
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -2.8e+69], N[Not[LessEqual[y, 4.6e+62]], $MachinePrecision]], N[(x / y), $MachinePrecision], N[(1.0 - N[(y / x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -2.79999999999999982e69 or 4.59999999999999968e62 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 80.7%

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

   if -2.79999999999999982e69 < y < 4.59999999999999968e62

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 73.8%

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

      1. mul-1-neg 73.8%

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

      2. unsub-neg 73.8%

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

   5. Simplified 73.8%

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

4. Final simplification 76.8%

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

Alternative 3: 73.4% accurate, 0.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.1 \cdot 10^{+68} \lor \neg \left(y \leq 5.7 \cdot 10^{+63}\right):\\ \;\;\;\;\frac{x}{y}\\ \mathbf{else}:\\ \;\;\;\;1\\ \end{array} \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (if (or (<= y -2.1e+68) (not (<= y 5.7e+63))) (/ x y) 1.0))

C

double code(double x, double y) {
	double tmp;
	if ((y <= -2.1e+68) || !(y <= 5.7e+63)) {
		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 ((y <= (-2.1d+68)) .or. (.not. (y <= 5.7d+63))) 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 ((y <= -2.1e+68) || !(y <= 5.7e+63)) {
		tmp = x / y;
	} else {
		tmp = 1.0;
	}
	return tmp;
}

Python

def code(x, y):
	tmp = 0
	if (y <= -2.1e+68) or not (y <= 5.7e+63):
		tmp = x / y
	else:
		tmp = 1.0
	return tmp

Julia

function code(x, y)
	tmp = 0.0
	if ((y <= -2.1e+68) || !(y <= 5.7e+63))
		tmp = Float64(x / y);
	else
		tmp = 1.0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((y <= -2.1e+68) || ~((y <= 5.7e+63)))
		tmp = x / y;
	else
		tmp = 1.0;
	end
	tmp_2 = tmp;
end

Wolfram

code[x_, y_] := If[Or[LessEqual[y, -2.1e+68], N[Not[LessEqual[y, 5.7e+63]], $MachinePrecision]], N[(x / y), $MachinePrecision], 1.0]

Derivation

1. Split input into 2 regimes

2. if y < -2.10000000000000001e68 or 5.7000000000000002e63 < y

   1. Initial program 100.0%

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

   3. Taylor expanded in x around 0 80.7%

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

   if -2.10000000000000001e68 < y < 5.7000000000000002e63

   1. Initial program 100.0%

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

   3. Taylor expanded in x around inf 73.5%

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

4. Final simplification 76.6%

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

Alternative 4: 51.2% 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. Add Preprocessing

3. Taylor expanded in x around inf 50.7%

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

Reproduce

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