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

Percentage Accurate: 100.0% → 100.0%

Time: 10.1s

Alternatives: 7

Speedup: 1.2×

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.2× speedup

Math

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

FPCore

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

C

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

Julia

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. lift-*.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. *-commutative N/A

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

   4. distribute-lft1-in N/A

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

   5. lower-fma.f64 N/A

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

   6. lower-+.f64 100.0

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

4. Applied rewrites 100.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(y + 1, x, y\right)} \]
5. Add Preprocessing

Alternative 2: 87.0% accurate, 0.3× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} t_0 := y + \left(x + y \cdot x\right)\\ \mathbf{if}\;t\_0 \leq -\infty:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;t\_0 \leq 10^{+308}:\\ \;\;\;\;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
 (let* ((t_0 (+ y (+ x (* y x)))))
   (if (<= t_0 (- INFINITY)) (* y x) (if (<= t_0 1e+308) (+ y x) (* y x)))))

C

assert(x < y);
double code(double x, double y) {
	double t_0 = y + (x + (y * x));
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = y * x;
	} else if (t_0 <= 1e+308) {
		tmp = y + x;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Java

assert x < y;
public static double code(double x, double y) {
	double t_0 = y + (x + (y * x));
	double tmp;
	if (t_0 <= -Double.POSITIVE_INFINITY) {
		tmp = y * x;
	} else if (t_0 <= 1e+308) {
		tmp = y + x;
	} else {
		tmp = y * x;
	}
	return tmp;
}

Python

[x, y] = sort([x, y])
def code(x, y):
	t_0 = y + (x + (y * x))
	tmp = 0
	if t_0 <= -math.inf:
		tmp = y * x
	elif t_0 <= 1e+308:
		tmp = y + x
	else:
		tmp = y * x
	return tmp

Julia

x, y = sort([x, y])
function code(x, y)
	t_0 = Float64(y + Float64(x + Float64(y * x)))
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(y * x);
	elseif (t_0 <= 1e+308)
		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)
	t_0 = y + (x + (y * x));
	tmp = 0.0;
	if (t_0 <= -Inf)
		tmp = y * x;
	elseif (t_0 <= 1e+308)
		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_] := Block[{t$95$0 = N[(y + N[(x + N[(y * x), $MachinePrecision]), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(y * x), $MachinePrecision], If[LessEqual[t$95$0, 1e+308], N[(y + x), $MachinePrecision], N[(y * x), $MachinePrecision]]]]

Derivation

1. Split input into 2 regimes

2. if (+.f64 (+.f64 (*.f64 x y) x) y) < -inf.0 or 1e308 < (+.f64 (+.f64 (*.f64 x y) x) y)

   1. Initial program 100.0%

      \[\left(x \cdot y + x\right) + y \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. *-rgt-identity N/A

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

      4. lower-fma.f64 100.0

         \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, x\right)} \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, x\right)} \]

   6. Taylor expanded in y around inf

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

      1. lower-*.f64 100.0

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

   8. Applied rewrites 100.0%

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

   if -inf.0 < (+.f64 (+.f64 (*.f64 x y) x) y) < 1e308

   1. Initial program 100.0%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. distribute-lft1-in N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-+.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in y around 0

      \[\leadsto \mathsf{fma}\left(\color{blue}{1}, x, y\right) \]
   6. Step-by-step derivation

   7. Applied rewrites 88.5%

      \[\leadsto \mathsf{fma}\left(\color{blue}{1}, x, y\right) \]
   8. Step-by-step derivation

      1. *-lft-identity N/A

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

      2. +-commutative N/A

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

      3. lower-+.f64 88.5

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

   9. Applied rewrites 88.5%

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

4. Final simplification 90.0%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y + \left(x + y \cdot x\right) \leq -\infty:\\ \;\;\;\;y \cdot x\\ \mathbf{elif}\;y + \left(x + y \cdot x\right) \leq 10^{+308}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 98.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;y + \left(x + y \cdot x\right) \leq -1 \cdot 10^{-279}:\\ \;\;\;\;\left(y + 1\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, y, y\right)\\ \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 (+ x (* y x))) -1e-279) (* (+ y 1.0) x) (fma x y y)))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 (+.f64 (*.f64 x y) x) y) < -1.00000000000000006e-279

   1. Initial program 100.0%

      \[\left(x \cdot y + x\right) + y \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. *-rgt-identity N/A

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

      4. lower-fma.f64 63.7

         \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, x\right)} \]

   5. Applied rewrites 63.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, x\right)} \]
   6. Step-by-step derivation

      1. *-commutative N/A

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

      2. distribute-lft1-in N/A

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

      3. lift-+.f64 N/A

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

      4. lower-*.f64 63.7

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

   7. Applied rewrites 63.7%

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

   if -1.00000000000000006e-279 < (+.f64 (+.f64 (*.f64 x y) x) y)

   1. Initial program 100.0%

      \[\left(x \cdot y + x\right) + y \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. distribute-rgt-in N/A

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

      2. *-lft-identity N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 59.0

         \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, y\right)} \]

   5. Applied rewrites 59.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, y\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 61.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y + \left(x + y \cdot x\right) \leq -1 \cdot 10^{-279}:\\ \;\;\;\;\left(y + 1\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, y, y\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 98.5% accurate, 0.5× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;y + \left(x + y \cdot x\right) \leq -1 \cdot 10^{-279}:\\ \;\;\;\;\mathsf{fma}\left(x, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, y, y\right)\\ \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 (+ x (* y x))) -1e-279) (fma x y x) (fma x y y)))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if ((y + (x + (y * x))) <= -1e-279) {
		tmp = fma(x, y, x);
	} else {
		tmp = fma(x, y, y);
	}
	return tmp;
}

Julia

x, y = sort([x, y])
function code(x, y)
	tmp = 0.0
	if (Float64(y + Float64(x + Float64(y * x))) <= -1e-279)
		tmp = fma(x, y, x);
	else
		tmp = fma(x, y, y);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if (+.f64 (+.f64 (*.f64 x y) x) y) < -1.00000000000000006e-279

   1. Initial program 100.0%

      \[\left(x \cdot y + x\right) + y \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. *-rgt-identity N/A

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

      4. lower-fma.f64 63.7

         \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, x\right)} \]

   5. Applied rewrites 63.7%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, x\right)} \]

   if -1.00000000000000006e-279 < (+.f64 (+.f64 (*.f64 x y) x) y)

   1. Initial program 100.0%

      \[\left(x \cdot y + x\right) + y \]
   2. Add Preprocessing

   3. Taylor expanded in y around inf

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

      1. distribute-rgt-in N/A

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

      2. *-lft-identity N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 59.0

         \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, y\right)} \]

   5. Applied rewrites 59.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, y\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 61.6%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y + \left(x + y \cdot x\right) \leq -1 \cdot 10^{-279}:\\ \;\;\;\;\mathsf{fma}\left(x, y, x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(x, y, y\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 98.3% accurate, 0.7× speedup

Math

\[\begin{array}{l} [x, y] = \mathsf{sort}([x, y])\\ \\ \begin{array}{l} \mathbf{if}\;x \leq -1:\\ \;\;\;\;\mathsf{fma}\left(x, y, x\right)\\ \mathbf{elif}\;x \leq 1.5 \cdot 10^{+26}:\\ \;\;\;\;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 (<= x -1.0) (fma x y x) (if (<= x 1.5e+26) (+ y x) (* y x))))

C

assert(x < y);
double code(double x, double y) {
	double tmp;
	if (x <= -1.0) {
		tmp = fma(x, y, x);
	} else if (x <= 1.5e+26) {
		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.0)
		tmp = fma(x, y, x);
	elseif (x <= 1.5e+26)
		tmp = Float64(y + x);
	else
		tmp = Float64(y * x);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 3 regimes

2. if x < -1

   1. Initial program 100.0%

      \[\left(x \cdot y + x\right) + y \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. *-rgt-identity N/A

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

      4. lower-fma.f64 98.8

         \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, x\right)} \]

   5. Applied rewrites 98.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, x\right)} \]

   if -1 < x < 1.49999999999999999e26

   1. Initial program 100.0%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

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

      3. *-commutative N/A

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

      4. distribute-lft1-in N/A

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

      5. lower-fma.f64 N/A

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

      6. lower-+.f64 100.0

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

   4. Applied rewrites 100.0%

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

   5. Taylor expanded in y around 0

      \[\leadsto \mathsf{fma}\left(\color{blue}{1}, x, y\right) \]
   6. Step-by-step derivation

   7. Applied rewrites 98.6%

      \[\leadsto \mathsf{fma}\left(\color{blue}{1}, x, y\right) \]
   8. Step-by-step derivation

      1. *-lft-identity N/A

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

      2. +-commutative N/A

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

      3. lower-+.f64 98.6

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

   9. Applied rewrites 98.6%

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

   if 1.49999999999999999e26 < x

   1. Initial program 100.0%

      \[\left(x \cdot y + x\right) + y \]
   2. Add Preprocessing

   3. Taylor expanded in x around inf

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

      1. +-commutative N/A

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

      2. distribute-lft-in N/A

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

      3. *-rgt-identity N/A

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

      4. lower-fma.f64 100.0

         \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, x\right)} \]

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, x\right)} \]

   6. Taylor expanded in y around inf

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

      1. lower-*.f64 47.8

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

   8. Applied rewrites 47.8%

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

4. Final simplification 88.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;x \leq -1:\\ \;\;\;\;\mathsf{fma}\left(x, y, x\right)\\ \mathbf{elif}\;x \leq 1.5 \cdot 10^{+26}:\\ \;\;\;\;y + x\\ \mathbf{else}:\\ \;\;\;\;y \cdot x\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 74.5% accurate, 3.0× speedup

Math

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

FPCore

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

C

assert(x < y);
double code(double x, double y) {
	return y + 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 + x
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

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

   1. lift-*.f64 N/A

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

   2. lift-*.f64 N/A

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

   3. *-commutative N/A

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

   4. distribute-lft1-in N/A

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

   5. lower-fma.f64 N/A

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

   6. lower-+.f64 100.0

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

4. Applied rewrites 100.0%

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

5. Taylor expanded in y around 0

   \[\leadsto \mathsf{fma}\left(\color{blue}{1}, x, y\right) \]
6. Step-by-step derivation

7. Applied rewrites 77.6%

   \[\leadsto \mathsf{fma}\left(\color{blue}{1}, x, y\right) \]
8. Step-by-step derivation

   1. *-lft-identity N/A

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

   2. +-commutative N/A

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

   3. lower-+.f64 77.6

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

9. Applied rewrites 77.6%

   \[\leadsto \color{blue}{y + x} \]
10. Add Preprocessing

Alternative 7: 38.7% accurate, 12.0× speedup

Math

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

FPCore

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

C

assert(x < y);
double code(double x, double y) {
	return 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 = x
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 100.0%

   \[\left(x \cdot y + x\right) + y \]
2. Add Preprocessing

3. Taylor expanded in x around inf

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

   1. +-commutative N/A

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

   2. distribute-lft-in N/A

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

   3. *-rgt-identity N/A

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

   4. lower-fma.f64 63.8

      \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, x\right)} \]

5. Applied rewrites 63.8%

   \[\leadsto \color{blue}{\mathsf{fma}\left(x, y, x\right)} \]
6. Step-by-step derivation

   1. *-commutative N/A

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

   2. distribute-lft1-in N/A

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

   3. lift-+.f64 N/A

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

   4. lower-*.f64 63.8

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

7. Applied rewrites 63.8%

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

8. Taylor expanded in y around 0

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

10. Applied rewrites 41.7%

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

    1. *-lft-identity 41.7

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

12. Applied rewrites 41.7%

    \[\leadsto \color{blue}{x} \]
13. Add Preprocessing

Reproduce

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