Numeric.Log:$cexpm1 from log-domain-0.10.2.1, B

Percentage Accurate: 100.0% → 100.0%

Time: 2.5s

Alternatives: 5

Speedup: N/A×

Specification

Math

\[\begin{array}{l} \\ \left(x \cdot y + x\right) + y \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(x \cdot y + x\right) + y \end{array} \]

FPCore

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

C

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

Fortran

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Alternative 1: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ y + \left(y + 1\right) \cdot x \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y) :precision binary64 (+ y (* (+ y 1.0) x)))

C

assert(x < y);
double code(double x, double y) {
	return y + ((y + 1.0) * x);
}

Fortran

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

Java

assert x < y;
public static double code(double x, double y) {
	return y + ((y + 1.0) * x);
}

Python

[x, y] = sort([x, y])
def code(x, y):
	return y + ((y + 1.0) * x)

Julia

x, y = sort([x, y])
function code(x, y)
	return Float64(y + Float64(Float64(y + 1.0) * x))
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
	tmp = y + ((y + 1.0) * x);
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := N[(y + N[(N[(y + 1.0), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[\left(x \cdot y + x\right) + y \]
2. Step-by-step derivation

   1. *-commutative 100.0%

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

   2. distribute-lft1-in 100.0%

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

3. Applied egg-rr 100.0%

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

4. Final simplification 100.0%

   \[\leadsto y + \left(y + 1\right) \cdot x \]

Alternative 2: 79.0% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;x \leq -1.45 \cdot 10^{+80} \lor \neg \left(x \leq -6.5 \cdot 10^{+44}\right) \land x \leq 5200000000:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
 :precision binary64
 (if (or (<= x -1.45e+80) (and (not (<= x -6.5e+44)) (<= x 5200000000.0)))
   (+ y x)
   (* y x)))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if ((x <= -1.45e+80) || (!(x <= -6.5e+44) && (x <= 5200000000.0))) {
		tmp = y + x;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((x <= (-1.45d+80)) .or. (.not. (x <= (-6.5d+44))) .and. (x <= 5200000000.0d0)) then
        tmp = y + x
    else
        tmp = y * x
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y) {
	double tmp;
	if ((x <= -1.45e+80) || (!(x <= -6.5e+44) && (x <= 5200000000.0))) {
		tmp = y + x;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y):
	tmp = 0
	if (x <= -1.45e+80) or (not (x <= -6.5e+44) and (x <= 5200000000.0)):
		tmp = y + x
	else:
		tmp = y * x
	return tmp

Julia

x, y = sort([x, y])
function code(x, y)
	tmp = 0.0
	if ((x <= -1.45e+80) || (!(x <= -6.5e+44) && (x <= 5200000000.0)))
		tmp = Float64(y + x);
	else
		tmp = Float64(y * x);
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -1.45e+80) || (~((x <= -6.5e+44)) && (x <= 5200000000.0)))
		tmp = y + x;
	else
		tmp = y * x;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := If[Or[LessEqual[x, -1.45e+80], And[N[Not[LessEqual[x, -6.5e+44]], $MachinePrecision], LessEqual[x, 5200000000.0]]], N[(y + x), $MachinePrecision], N[(y * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.44999999999999993e80 or -6.50000000000000018e44 < x < 5.2e9

   1. Initial program 100.0%

      \[\left(x \cdot y + x\right) + y \]

   2. Taylor expanded in y around 0 86.7%

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

   if -1.44999999999999993e80 < x < -6.50000000000000018e44 or 5.2e9 < x

   1. Initial program 100.0%

      \[\left(x \cdot y + x\right) + y \]

   2. Taylor expanded in y around inf 53.8%

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

   3. Taylor expanded in x around inf 53.8%

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

      1. *-commutative 53.8%

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

   5. Simplified 53.8%

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

4. Final simplification 77.4%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1.45 \cdot 10^{+80} \lor \neg \left(x \leq -6.5 \cdot 10^{+44}\right) \land x \leq 5200000000:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \]

Alternative 3: 98.7% accurate, 0.8× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;y \leq -8200000000000:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;y + y \cdot x\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
 :precision binary64
 (if (<= y -8200000000000.0) (* y x) (if (<= y 1.0) (+ y x) (+ y (* y x)))))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if (y <= -8200000000000.0) {
		tmp = y * x;
	} else if (y <= 1.0) {
		tmp = y + x;
	} else {
		tmp = y + (y * x);
	}
	return tmp;
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (y <= (-8200000000000.0d0)) then
        tmp = y * x
    else if (y <= 1.0d0) then
        tmp = y + x
    else
        tmp = y + (y * x)
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y) {
	double tmp;
	if (y <= -8200000000000.0) {
		tmp = y * x;
	} else if (y <= 1.0) {
		tmp = y + x;
	} else {
		tmp = y + (y * x);
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y):
	tmp = 0
	if y <= -8200000000000.0:
		tmp = y * x
	elif y <= 1.0:
		tmp = y + x
	else:
		tmp = y + (y * x)
	return tmp

Julia

x, y = sort([x, y])
function code(x, y)
	tmp = 0.0
	if (y <= -8200000000000.0)
		tmp = Float64(y * x);
	elseif (y <= 1.0)
		tmp = Float64(y + x);
	else
		tmp = Float64(y + Float64(y * x));
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
	tmp = 0.0;
	if (y <= -8200000000000.0)
		tmp = y * x;
	elseif (y <= 1.0)
		tmp = y + x;
	else
		tmp = y + (y * x);
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := If[LessEqual[y, -8200000000000.0], N[(y * x), $MachinePrecision], If[LessEqual[y, 1.0], N[(y + x), $MachinePrecision], N[(y + N[(y * x), $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -8.2e12

   1. Initial program 100.0%

      \[\left(x \cdot y + x\right) + y \]

   2. Taylor expanded in y around inf 100.0%

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

   3. Taylor expanded in x around inf 55.1%

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

      1. *-commutative 55.1%

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

   5. Simplified 55.1%

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

   if -8.2e12 < y < 1

   1. Initial program 100.0%

      \[\left(x \cdot y + x\right) + y \]

   2. Taylor expanded in y around 0 98.6%

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

   if 1 < y

   1. Initial program 100.0%

      \[\left(x \cdot y + x\right) + y \]

   2. Taylor expanded in y around inf 99.8%

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

4. Final simplification 91.3%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -8200000000000:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y \leq 1:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;y + y \cdot x\\ \end{array} \]

Alternative 4: 62.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;x \leq -1 \lor \neg \left(x \leq 1\right):\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y)
 :precision binary64
 (if (or (<= x -1.0) (not (<= x 1.0))) (* y x) y))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if ((x <= -1.0) || !(x <= 1.0)) {
		tmp = y * x;
	} else {
		tmp = y;
	}
	return tmp;
}

Fortran

NOTE: x and y should be sorted in increasing order before calling this function.
real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if ((x <= (-1.0d0)) .or. (.not. (x <= 1.0d0))) then
        tmp = y * x
    else
        tmp = y
    end if
    code = tmp
end function

Java

assert x < y;
public static double code(double x, double y) {
	double tmp;
	if ((x <= -1.0) || !(x <= 1.0)) {
		tmp = y * x;
	} else {
		tmp = y;
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y):
	tmp = 0
	if (x <= -1.0) or not (x <= 1.0):
		tmp = y * x
	else:
		tmp = y
	return tmp

Julia

x, y = sort([x, y])
function code(x, y)
	tmp = 0.0
	if ((x <= -1.0) || !(x <= 1.0))
		tmp = Float64(y * x);
	else
		tmp = y;
	end
	return tmp
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp_2 = code(x, y)
	tmp = 0.0;
	if ((x <= -1.0) || ~((x <= 1.0)))
		tmp = y * x;
	else
		tmp = y;
	end
	tmp_2 = tmp;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := If[Or[LessEqual[x, -1.0], N[Not[LessEqual[x, 1.0]], $MachinePrecision]], N[(y * x), $MachinePrecision], y]

Derivation

1. Split input into 2 regimes

2. if x < -1 or 1 < x

   1. Initial program 100.0%

      \[\left(x \cdot y + x\right) + y \]

   2. Taylor expanded in y around inf 48.5%

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

   3. Taylor expanded in x around inf 47.9%

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

      1. *-commutative 47.9%

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

   5. Simplified 47.9%

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

   if -1 < x < 1

   1. Initial program 100.0%

      \[\left(x \cdot y + x\right) + y \]

   2. Taylor expanded in x around 0 73.7%

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

4. Final simplification 60.7%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1 \lor \neg \left(x \leq 1\right):\\ \;\;\;\;y \cdot x\\ \mathbf{else}:\\ \;\;\;\;y\\ \end{array} \]

Alternative 5: 38.5% accurate, 7.0× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ y \end{array} \]

FPCore

NOTE: x and y should be sorted in increasing order before calling this function.
(FPCore (x y) :precision binary64 y)

C

assert(x < y);
double code(double x, double y) {
	return y;
}

Fortran

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

Java

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

Python

[x, y] = sort([x, y])
def code(x, y):
	return y

Julia

x, y = sort([x, y])
function code(x, y)
	return y
end

MATLAB

x, y = num2cell(sort([x, y])){:}
function tmp = code(x, y)
	tmp = y;
end

Wolfram

NOTE: x and y should be sorted in increasing order before calling this function.
code[x_, y_] := y

Derivation

1. Initial program 100.0%

   \[\left(x \cdot y + x\right) + y \]

2. Taylor expanded in x around 0 38.1%

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

3. Final simplification 38.1%

   \[\leadsto y \]

Reproduce

herbie shell --seed 2023340 
(FPCore (x y)
  :name "Numeric.Log:$cexpm1 from log-domain-0.10.2.1, B"
  :precision binary64
  (+ (+ (* x y) x) y))