Logarithmic Transform

Percentage Accurate: 41.5% → 99.3%

Time: 6.4s

Alternatives: 9

Speedup: 4.9×

• could not determine a ground truth

  1. c = 8.994803852375638e+123
  2. x = 1.5522693908915837e+155
  3. y = 2.934602114361996e-13

Specification

Math

\[\begin{array}{l} \\ c \cdot \log \left(1 + \left({e}^{x} - 1\right) \cdot y\right) \end{array} \]

FPCore

(FPCore (c x y)
 :precision binary64
 (* c (log (+ 1.0 (* (- (pow E x) 1.0) y)))))

C

double code(double c, double x, double y) {
	return c * log((1.0 + ((pow(((double) M_E), x) - 1.0) * y)));
}

Java

public static double code(double c, double x, double y) {
	return c * Math.log((1.0 + ((Math.pow(Math.E, x) - 1.0) * y)));
}

Python

def code(c, x, y):
	return c * math.log((1.0 + ((math.pow(math.e, x) - 1.0) * y)))

Julia

function code(c, x, y)
	return Float64(c * log(Float64(1.0 + Float64(Float64((exp(1) ^ x) - 1.0) * y))))
end

MATLAB

function tmp = code(c, x, y)
	tmp = c * log((1.0 + (((2.71828182845904523536 ^ x) - 1.0) * y)));
end

Wolfram

code[c_, x_, y_] := N[(c * N[Log[N[(1.0 + N[(N[(N[Power[E, x], $MachinePrecision] - 1.0), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Initial Program: 41.5% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ c \cdot \log \left(1 + \left({e}^{x} - 1\right) \cdot y\right) \end{array} \]

FPCore

(FPCore (c x y)
 :precision binary64
 (* c (log (+ 1.0 (* (- (pow E x) 1.0) y)))))

C

double code(double c, double x, double y) {
	return c * log((1.0 + ((pow(((double) M_E), x) - 1.0) * y)));
}

Java

public static double code(double c, double x, double y) {
	return c * Math.log((1.0 + ((Math.pow(Math.E, x) - 1.0) * y)));
}

Python

def code(c, x, y):
	return c * math.log((1.0 + ((math.pow(math.e, x) - 1.0) * y)))

Julia

function code(c, x, y)
	return Float64(c * log(Float64(1.0 + Float64(Float64((exp(1) ^ x) - 1.0) * y))))
end

MATLAB

function tmp = code(c, x, y)
	tmp = c * log((1.0 + (((2.71828182845904523536 ^ x) - 1.0) * y)));
end

Wolfram

code[c_, x_, y_] := N[(c * N[Log[N[(1.0 + N[(N[(N[Power[E, x], $MachinePrecision] - 1.0), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.3% accurate, 1.1× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := c \cdot \mathsf{log1p}\left(\mathsf{expm1}\left(x\right) \cdot y\right)\\ \mathbf{if}\;y \leq -5 \cdot 10^{-19}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 1.2 \cdot 10^{-50}:\\ \;\;\;\;\left(y \cdot c\right) \cdot \mathsf{expm1}\left(x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (c x y)
 :precision binary64
 (let* ((t_0 (* c (log1p (* (expm1 x) y)))))
   (if (<= y -5e-19) t_0 (if (<= y 1.2e-50) (* (* y c) (expm1 x)) t_0))))

C

double code(double c, double x, double y) {
	double t_0 = c * log1p((expm1(x) * y));
	double tmp;
	if (y <= -5e-19) {
		tmp = t_0;
	} else if (y <= 1.2e-50) {
		tmp = (y * c) * expm1(x);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Java

public static double code(double c, double x, double y) {
	double t_0 = c * Math.log1p((Math.expm1(x) * y));
	double tmp;
	if (y <= -5e-19) {
		tmp = t_0;
	} else if (y <= 1.2e-50) {
		tmp = (y * c) * Math.expm1(x);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(c, x, y):
	t_0 = c * math.log1p((math.expm1(x) * y))
	tmp = 0
	if y <= -5e-19:
		tmp = t_0
	elif y <= 1.2e-50:
		tmp = (y * c) * math.expm1(x)
	else:
		tmp = t_0
	return tmp

Julia

function code(c, x, y)
	t_0 = Float64(c * log1p(Float64(expm1(x) * y)))
	tmp = 0.0
	if (y <= -5e-19)
		tmp = t_0;
	elseif (y <= 1.2e-50)
		tmp = Float64(Float64(y * c) * expm1(x));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[c_, x_, y_] := Block[{t$95$0 = N[(c * N[Log[1 + N[(N[(Exp[x] - 1), $MachinePrecision] * y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -5e-19], t$95$0, If[LessEqual[y, 1.2e-50], N[(N[(y * c), $MachinePrecision] * N[(Exp[x] - 1), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -5.0000000000000004e-19 or 1.20000000000000001e-50 < y

   1. Initial program 41.5%

      \[c \cdot \log \left(1 + \left({e}^{x} - 1\right) \cdot y\right) \]
   2. Step-by-step derivation

      1. lift-log.f64 N/A

         \[\leadsto c \cdot \color{blue}{\log \left(1 + \left({e}^{x} - 1\right) \cdot y\right)} \]

      2. lift-+.f64 N/A

         \[\leadsto c \cdot \log \color{blue}{\left(1 + \left({e}^{x} - 1\right) \cdot y\right)} \]

      3. lift-*.f64 N/A

         \[\leadsto c \cdot \log \left(1 + \color{blue}{\left({e}^{x} - 1\right) \cdot y}\right) \]

      4. lift--.f64 N/A

         \[\leadsto c \cdot \log \left(1 + \color{blue}{\left({e}^{x} - 1\right)} \cdot y\right) \]

      5. lift-E.f64 N/A

         \[\leadsto c \cdot \log \left(1 + \left({\color{blue}{\mathsf{E}\left(\right)}}^{x} - 1\right) \cdot y\right) \]

      6. lift-pow.f64 N/A

         \[\leadsto c \cdot \log \left(1 + \left(\color{blue}{{\mathsf{E}\left(\right)}^{x}} - 1\right) \cdot y\right) \]

      7. *-commutative N/A

         \[\leadsto c \cdot \log \left(1 + \color{blue}{y \cdot \left({\mathsf{E}\left(\right)}^{x} - 1\right)}\right) \]

      8. lower-log1p.f64 N/A

         \[\leadsto c \cdot \color{blue}{\mathsf{log1p}\left(y \cdot \left({\mathsf{E}\left(\right)}^{x} - 1\right)\right)} \]

      9. *-commutative N/A

         \[\leadsto c \cdot \mathsf{log1p}\left(\color{blue}{\left({\mathsf{E}\left(\right)}^{x} - 1\right) \cdot y}\right) \]

      10. lower-*.f64 N/A

          \[\leadsto c \cdot \mathsf{log1p}\left(\color{blue}{\left({\mathsf{E}\left(\right)}^{x} - 1\right) \cdot y}\right) \]

      11. e-exp-1 N/A

          \[\leadsto c \cdot \mathsf{log1p}\left(\left({\color{blue}{\left(e^{1}\right)}}^{x} - 1\right) \cdot y\right) \]

      12. pow-exp N/A

          \[\leadsto c \cdot \mathsf{log1p}\left(\left(\color{blue}{e^{1 \cdot x}} - 1\right) \cdot y\right) \]

      13. *-lft-identity N/A

          \[\leadsto c \cdot \mathsf{log1p}\left(\left(e^{\color{blue}{x}} - 1\right) \cdot y\right) \]

      14. lower-expm1.f64 93.1

          \[\leadsto c \cdot \mathsf{log1p}\left(\color{blue}{\mathsf{expm1}\left(x\right)} \cdot y\right) \]

   3. Applied rewrites 93.1%

      \[\leadsto c \cdot \color{blue}{\mathsf{log1p}\left(\mathsf{expm1}\left(x\right) \cdot y\right)} \]

   if -5.0000000000000004e-19 < y < 1.20000000000000001e-50

   1. Initial program 41.5%

      \[c \cdot \log \left(1 + \left({e}^{x} - 1\right) \cdot y\right) \]

   2. Taylor expanded in x around 0

      \[\leadsto \color{blue}{c \cdot \left(x \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right)} \]
   3. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \left(c \cdot x\right) \cdot \color{blue}{\left(y \cdot \log \mathsf{E}\left(\right)\right)} \]

      2. log-E N/A

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

      3. *-rgt-identity N/A

         \[\leadsto \left(c \cdot x\right) \cdot y \]

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

         \[\leadsto \left(c \cdot y\right) \cdot x \]

      7. *-rgt-identity N/A

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

      8. log-E N/A

         \[\leadsto \left(c \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right) \cdot x \]

      9. lower-*.f64 N/A

         \[\leadsto \left(c \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right) \cdot \color{blue}{x} \]

      10. *-commutative N/A

          \[\leadsto \left(\left(y \cdot \log \mathsf{E}\left(\right)\right) \cdot c\right) \cdot x \]

      11. log-E N/A

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

      12. metadata-eval N/A

          \[\leadsto \left(\left(y \cdot {1}^{2}\right) \cdot c\right) \cdot x \]

      13. log-E N/A

          \[\leadsto \left(\left(y \cdot {\log \mathsf{E}\left(\right)}^{2}\right) \cdot c\right) \cdot x \]

      14. log-E N/A

          \[\leadsto \left(\left(y \cdot {1}^{2}\right) \cdot c\right) \cdot x \]

      15. metadata-eval N/A

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

      16. *-commutative N/A

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

      17. *-lft-identity N/A

          \[\leadsto \left(y \cdot c\right) \cdot x \]

      18. lower-*.f64 62.5

          \[\leadsto \left(y \cdot c\right) \cdot x \]

   4. Applied rewrites 62.5%

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

   5. Taylor expanded in y around 0

      \[\leadsto \color{blue}{c \cdot \left(y \cdot \left({\mathsf{E}\left(\right)}^{x} - 1\right)\right)} \]
   6. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \left(c \cdot y\right) \cdot \color{blue}{\left({\mathsf{E}\left(\right)}^{x} - 1\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(c \cdot y\right) \cdot \color{blue}{\left({\mathsf{E}\left(\right)}^{x} - 1\right)} \]

      3. *-commutative N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(\color{blue}{{\mathsf{E}\left(\right)}^{x}} - 1\right) \]

      4. lift-*.f64 N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(\color{blue}{{\mathsf{E}\left(\right)}^{x}} - 1\right) \]

      5. e-exp-1 N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left({\left(e^{1}\right)}^{x} - 1\right) \]

      6. pow-exp N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(e^{1 \cdot x} - 1\right) \]

      7. metadata-eval N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(e^{\left(\mathsf{neg}\left(-1\right)\right) \cdot x} - 1\right) \]

      8. distribute-lft-neg-out N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(e^{\mathsf{neg}\left(-1 \cdot x\right)} - 1\right) \]

      9. mul-1-neg N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(e^{\mathsf{neg}\left(\left(\mathsf{neg}\left(x\right)\right)\right)} - 1\right) \]

      10. lower-expm1.f64 N/A

          \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(\mathsf{neg}\left(\left(\mathsf{neg}\left(x\right)\right)\right)\right) \]

      11. lower-neg.f64 N/A

          \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(-\left(\mathsf{neg}\left(x\right)\right)\right) \]

      12. lower-neg.f64 77.1

          \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(-\left(-x\right)\right) \]

   7. Applied rewrites 77.1%

      \[\leadsto \color{blue}{\left(y \cdot c\right) \cdot \mathsf{expm1}\left(-\left(-x\right)\right)} \]
   8. Step-by-step derivation

      1. lift-neg.f64 N/A

         \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(\mathsf{neg}\left(\left(-x\right)\right)\right) \]

      2. lift-neg.f64 N/A

         \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(\mathsf{neg}\left(\left(\mathsf{neg}\left(x\right)\right)\right)\right) \]

      3. remove-double-neg 77.1

         \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(x\right) \]

   9. Applied rewrites 77.1%

      \[\leadsto \left(y \cdot c\right) \cdot \color{blue}{\mathsf{expm1}\left(x\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 92.1% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := c \cdot \mathsf{log1p}\left(x \cdot y\right)\\ \mathbf{if}\;y \leq -1.3 \cdot 10^{+199}:\\ \;\;\;\;\log \left(\mathsf{fma}\left(\mathsf{expm1}\left(x\right), y, 1\right)\right) \cdot c\\ \mathbf{elif}\;y \leq -122:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 2.3:\\ \;\;\;\;\left(y \cdot c\right) \cdot \mathsf{expm1}\left(x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (c x y)
 :precision binary64
 (let* ((t_0 (* c (log1p (* x y)))))
   (if (<= y -1.3e+199)
     (* (log (fma (expm1 x) y 1.0)) c)
     (if (<= y -122.0) t_0 (if (<= y 2.3) (* (* y c) (expm1 x)) t_0)))))

C

double code(double c, double x, double y) {
	double t_0 = c * log1p((x * y));
	double tmp;
	if (y <= -1.3e+199) {
		tmp = log(fma(expm1(x), y, 1.0)) * c;
	} else if (y <= -122.0) {
		tmp = t_0;
	} else if (y <= 2.3) {
		tmp = (y * c) * expm1(x);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(c, x, y)
	t_0 = Float64(c * log1p(Float64(x * y)))
	tmp = 0.0
	if (y <= -1.3e+199)
		tmp = Float64(log(fma(expm1(x), y, 1.0)) * c);
	elseif (y <= -122.0)
		tmp = t_0;
	elseif (y <= 2.3)
		tmp = Float64(Float64(y * c) * expm1(x));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[c_, x_, y_] := Block[{t$95$0 = N[(c * N[Log[1 + N[(x * y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -1.3e+199], N[(N[Log[N[(N[(Exp[x] - 1), $MachinePrecision] * y + 1.0), $MachinePrecision]], $MachinePrecision] * c), $MachinePrecision], If[LessEqual[y, -122.0], t$95$0, If[LessEqual[y, 2.3], N[(N[(y * c), $MachinePrecision] * N[(Exp[x] - 1), $MachinePrecision]), $MachinePrecision], t$95$0]]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.3000000000000001e199

   1. Initial program 41.5%

      \[c \cdot \log \left(1 + \left({e}^{x} - 1\right) \cdot y\right) \]
   2. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{c \cdot \log \left(1 + \left({e}^{x} - 1\right) \cdot y\right)} \]

      2. lift-log.f64 N/A

         \[\leadsto c \cdot \color{blue}{\log \left(1 + \left({e}^{x} - 1\right) \cdot y\right)} \]

      3. lift-+.f64 N/A

         \[\leadsto c \cdot \log \color{blue}{\left(1 + \left({e}^{x} - 1\right) \cdot y\right)} \]

      4. lift-*.f64 N/A

         \[\leadsto c \cdot \log \left(1 + \color{blue}{\left({e}^{x} - 1\right) \cdot y}\right) \]

      5. lift--.f64 N/A

         \[\leadsto c \cdot \log \left(1 + \color{blue}{\left({e}^{x} - 1\right)} \cdot y\right) \]

      6. lift-E.f64 N/A

         \[\leadsto c \cdot \log \left(1 + \left({\color{blue}{\mathsf{E}\left(\right)}}^{x} - 1\right) \cdot y\right) \]

      7. lift-pow.f64 N/A

         \[\leadsto c \cdot \log \left(1 + \left(\color{blue}{{\mathsf{E}\left(\right)}^{x}} - 1\right) \cdot y\right) \]

      8. *-commutative N/A

         \[\leadsto \color{blue}{\log \left(1 + \left({\mathsf{E}\left(\right)}^{x} - 1\right) \cdot y\right) \cdot c} \]

      9. lower-*.f64 N/A

         \[\leadsto \color{blue}{\log \left(1 + \left({\mathsf{E}\left(\right)}^{x} - 1\right) \cdot y\right) \cdot c} \]

   3. Applied rewrites 51.2%

      \[\leadsto \color{blue}{\log \left(\mathsf{fma}\left(\mathsf{expm1}\left(x\right), y, 1\right)\right) \cdot c} \]

   if -1.3000000000000001e199 < y < -122 or 2.2999999999999998 < y

   1. Initial program 41.5%

      \[c \cdot \log \left(1 + \left({e}^{x} - 1\right) \cdot y\right) \]
   2. Step-by-step derivation

      1. lift-log.f64 N/A

         \[\leadsto c \cdot \color{blue}{\log \left(1 + \left({e}^{x} - 1\right) \cdot y\right)} \]

      2. lift-+.f64 N/A

         \[\leadsto c \cdot \log \color{blue}{\left(1 + \left({e}^{x} - 1\right) \cdot y\right)} \]

      3. lift-*.f64 N/A

         \[\leadsto c \cdot \log \left(1 + \color{blue}{\left({e}^{x} - 1\right) \cdot y}\right) \]

      4. lift--.f64 N/A

         \[\leadsto c \cdot \log \left(1 + \color{blue}{\left({e}^{x} - 1\right)} \cdot y\right) \]

      5. lift-E.f64 N/A

         \[\leadsto c \cdot \log \left(1 + \left({\color{blue}{\mathsf{E}\left(\right)}}^{x} - 1\right) \cdot y\right) \]

      6. lift-pow.f64 N/A

         \[\leadsto c \cdot \log \left(1 + \left(\color{blue}{{\mathsf{E}\left(\right)}^{x}} - 1\right) \cdot y\right) \]

      7. *-commutative N/A

         \[\leadsto c \cdot \log \left(1 + \color{blue}{y \cdot \left({\mathsf{E}\left(\right)}^{x} - 1\right)}\right) \]

      8. lower-log1p.f64 N/A

         \[\leadsto c \cdot \color{blue}{\mathsf{log1p}\left(y \cdot \left({\mathsf{E}\left(\right)}^{x} - 1\right)\right)} \]

      9. *-commutative N/A

         \[\leadsto c \cdot \mathsf{log1p}\left(\color{blue}{\left({\mathsf{E}\left(\right)}^{x} - 1\right) \cdot y}\right) \]

      10. lower-*.f64 N/A

          \[\leadsto c \cdot \mathsf{log1p}\left(\color{blue}{\left({\mathsf{E}\left(\right)}^{x} - 1\right) \cdot y}\right) \]

      11. e-exp-1 N/A

          \[\leadsto c \cdot \mathsf{log1p}\left(\left({\color{blue}{\left(e^{1}\right)}}^{x} - 1\right) \cdot y\right) \]

      12. pow-exp N/A

          \[\leadsto c \cdot \mathsf{log1p}\left(\left(\color{blue}{e^{1 \cdot x}} - 1\right) \cdot y\right) \]

      13. *-lft-identity N/A

          \[\leadsto c \cdot \mathsf{log1p}\left(\left(e^{\color{blue}{x}} - 1\right) \cdot y\right) \]

      14. lower-expm1.f64 93.1

          \[\leadsto c \cdot \mathsf{log1p}\left(\color{blue}{\mathsf{expm1}\left(x\right)} \cdot y\right) \]

   3. Applied rewrites 93.1%

      \[\leadsto c \cdot \color{blue}{\mathsf{log1p}\left(\mathsf{expm1}\left(x\right) \cdot y\right)} \]

   4. Taylor expanded in x around 0

      \[\leadsto c \cdot \mathsf{log1p}\left(\color{blue}{x} \cdot y\right) \]
   5. Step-by-step derivation

   6. Applied rewrites 66.4%

      \[\leadsto c \cdot \mathsf{log1p}\left(\color{blue}{x} \cdot y\right) \]

   if -122 < y < 2.2999999999999998

   1. Initial program 41.5%

      \[c \cdot \log \left(1 + \left({e}^{x} - 1\right) \cdot y\right) \]

   2. Taylor expanded in x around 0

      \[\leadsto \color{blue}{c \cdot \left(x \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right)} \]
   3. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \left(c \cdot x\right) \cdot \color{blue}{\left(y \cdot \log \mathsf{E}\left(\right)\right)} \]

      2. log-E N/A

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

      3. *-rgt-identity N/A

         \[\leadsto \left(c \cdot x\right) \cdot y \]

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

         \[\leadsto \left(c \cdot y\right) \cdot x \]

      7. *-rgt-identity N/A

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

      8. log-E N/A

         \[\leadsto \left(c \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right) \cdot x \]

      9. lower-*.f64 N/A

         \[\leadsto \left(c \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right) \cdot \color{blue}{x} \]

      10. *-commutative N/A

          \[\leadsto \left(\left(y \cdot \log \mathsf{E}\left(\right)\right) \cdot c\right) \cdot x \]

      11. log-E N/A

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

      12. metadata-eval N/A

          \[\leadsto \left(\left(y \cdot {1}^{2}\right) \cdot c\right) \cdot x \]

      13. log-E N/A

          \[\leadsto \left(\left(y \cdot {\log \mathsf{E}\left(\right)}^{2}\right) \cdot c\right) \cdot x \]

      14. log-E N/A

          \[\leadsto \left(\left(y \cdot {1}^{2}\right) \cdot c\right) \cdot x \]

      15. metadata-eval N/A

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

      16. *-commutative N/A

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

      17. *-lft-identity N/A

          \[\leadsto \left(y \cdot c\right) \cdot x \]

      18. lower-*.f64 62.5

          \[\leadsto \left(y \cdot c\right) \cdot x \]

   4. Applied rewrites 62.5%

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

   5. Taylor expanded in y around 0

      \[\leadsto \color{blue}{c \cdot \left(y \cdot \left({\mathsf{E}\left(\right)}^{x} - 1\right)\right)} \]
   6. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \left(c \cdot y\right) \cdot \color{blue}{\left({\mathsf{E}\left(\right)}^{x} - 1\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(c \cdot y\right) \cdot \color{blue}{\left({\mathsf{E}\left(\right)}^{x} - 1\right)} \]

      3. *-commutative N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(\color{blue}{{\mathsf{E}\left(\right)}^{x}} - 1\right) \]

      4. lift-*.f64 N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(\color{blue}{{\mathsf{E}\left(\right)}^{x}} - 1\right) \]

      5. e-exp-1 N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left({\left(e^{1}\right)}^{x} - 1\right) \]

      6. pow-exp N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(e^{1 \cdot x} - 1\right) \]

      7. metadata-eval N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(e^{\left(\mathsf{neg}\left(-1\right)\right) \cdot x} - 1\right) \]

      8. distribute-lft-neg-out N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(e^{\mathsf{neg}\left(-1 \cdot x\right)} - 1\right) \]

      9. mul-1-neg N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(e^{\mathsf{neg}\left(\left(\mathsf{neg}\left(x\right)\right)\right)} - 1\right) \]

      10. lower-expm1.f64 N/A

          \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(\mathsf{neg}\left(\left(\mathsf{neg}\left(x\right)\right)\right)\right) \]

      11. lower-neg.f64 N/A

          \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(-\left(\mathsf{neg}\left(x\right)\right)\right) \]

      12. lower-neg.f64 77.1

          \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(-\left(-x\right)\right) \]

   7. Applied rewrites 77.1%

      \[\leadsto \color{blue}{\left(y \cdot c\right) \cdot \mathsf{expm1}\left(-\left(-x\right)\right)} \]
   8. Step-by-step derivation

      1. lift-neg.f64 N/A

         \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(\mathsf{neg}\left(\left(-x\right)\right)\right) \]

      2. lift-neg.f64 N/A

         \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(\mathsf{neg}\left(\left(\mathsf{neg}\left(x\right)\right)\right)\right) \]

      3. remove-double-neg 77.1

         \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(x\right) \]

   9. Applied rewrites 77.1%

      \[\leadsto \left(y \cdot c\right) \cdot \color{blue}{\mathsf{expm1}\left(x\right)} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 91.6% accurate, 1.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := c \cdot \mathsf{log1p}\left(x \cdot y\right)\\ \mathbf{if}\;y \leq -1.35 \cdot 10^{+199}:\\ \;\;\;\;\log \left(\mathsf{expm1}\left(x\right) \cdot y\right) \cdot c\\ \mathbf{elif}\;y \leq -122:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 2.3:\\ \;\;\;\;\left(y \cdot c\right) \cdot \mathsf{expm1}\left(x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (c x y)
 :precision binary64
 (let* ((t_0 (* c (log1p (* x y)))))
   (if (<= y -1.35e+199)
     (* (log (* (expm1 x) y)) c)
     (if (<= y -122.0) t_0 (if (<= y 2.3) (* (* y c) (expm1 x)) t_0)))))

C

double code(double c, double x, double y) {
	double t_0 = c * log1p((x * y));
	double tmp;
	if (y <= -1.35e+199) {
		tmp = log((expm1(x) * y)) * c;
	} else if (y <= -122.0) {
		tmp = t_0;
	} else if (y <= 2.3) {
		tmp = (y * c) * expm1(x);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Java

public static double code(double c, double x, double y) {
	double t_0 = c * Math.log1p((x * y));
	double tmp;
	if (y <= -1.35e+199) {
		tmp = Math.log((Math.expm1(x) * y)) * c;
	} else if (y <= -122.0) {
		tmp = t_0;
	} else if (y <= 2.3) {
		tmp = (y * c) * Math.expm1(x);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(c, x, y):
	t_0 = c * math.log1p((x * y))
	tmp = 0
	if y <= -1.35e+199:
		tmp = math.log((math.expm1(x) * y)) * c
	elif y <= -122.0:
		tmp = t_0
	elif y <= 2.3:
		tmp = (y * c) * math.expm1(x)
	else:
		tmp = t_0
	return tmp

Julia

function code(c, x, y)
	t_0 = Float64(c * log1p(Float64(x * y)))
	tmp = 0.0
	if (y <= -1.35e+199)
		tmp = Float64(log(Float64(expm1(x) * y)) * c);
	elseif (y <= -122.0)
		tmp = t_0;
	elseif (y <= 2.3)
		tmp = Float64(Float64(y * c) * expm1(x));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[c_, x_, y_] := Block[{t$95$0 = N[(c * N[Log[1 + N[(x * y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -1.35e+199], N[(N[Log[N[(N[(Exp[x] - 1), $MachinePrecision] * y), $MachinePrecision]], $MachinePrecision] * c), $MachinePrecision], If[LessEqual[y, -122.0], t$95$0, If[LessEqual[y, 2.3], N[(N[(y * c), $MachinePrecision] * N[(Exp[x] - 1), $MachinePrecision]), $MachinePrecision], t$95$0]]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.34999999999999995e199

   1. Initial program 41.5%

      \[c \cdot \log \left(1 + \left({e}^{x} - 1\right) \cdot y\right) \]

   2. Taylor expanded in y around inf

      \[\leadsto \color{blue}{c \cdot \left(\log \left({\mathsf{E}\left(\right)}^{x} - 1\right) + -1 \cdot \log \left(\frac{1}{y}\right)\right)} \]

   4. Applied rewrites 5.5%

      \[\leadsto \color{blue}{\left(\log y + \log \left(\mathsf{expm1}\left(x\right)\right)\right) \cdot c} \]
   5. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \left(\log y + \log \left(\mathsf{expm1}\left(x\right)\right)\right) \cdot c \]

      2. lift-log.f64 N/A

         \[\leadsto \left(\log y + \log \left(\mathsf{expm1}\left(x\right)\right)\right) \cdot c \]

      3. lift-expm1.f64 N/A

         \[\leadsto \left(\log y + \log \left(e^{x} - 1\right)\right) \cdot c \]

      4. lift-log.f64 N/A

         \[\leadsto \left(\log y + \log \left(e^{x} - 1\right)\right) \cdot c \]

      5. sum-log N/A

         \[\leadsto \log \left(y \cdot \left(e^{x} - 1\right)\right) \cdot c \]

      6. lower-log.f64 N/A

         \[\leadsto \log \left(y \cdot \left(e^{x} - 1\right)\right) \cdot c \]

      7. *-commutative N/A

         \[\leadsto \log \left(\left(e^{x} - 1\right) \cdot y\right) \cdot c \]

      8. lower-*.f64 N/A

         \[\leadsto \log \left(\left(e^{x} - 1\right) \cdot y\right) \cdot c \]

      9. lift-expm1.f64 20.4

         \[\leadsto \log \left(\mathsf{expm1}\left(x\right) \cdot y\right) \cdot c \]

   6. Applied rewrites 20.4%

      \[\leadsto \log \left(\mathsf{expm1}\left(x\right) \cdot y\right) \cdot c \]

   if -1.34999999999999995e199 < y < -122 or 2.2999999999999998 < y

   1. Initial program 41.5%

      \[c \cdot \log \left(1 + \left({e}^{x} - 1\right) \cdot y\right) \]
   2. Step-by-step derivation

      1. lift-log.f64 N/A

         \[\leadsto c \cdot \color{blue}{\log \left(1 + \left({e}^{x} - 1\right) \cdot y\right)} \]

      2. lift-+.f64 N/A

         \[\leadsto c \cdot \log \color{blue}{\left(1 + \left({e}^{x} - 1\right) \cdot y\right)} \]

      3. lift-*.f64 N/A

         \[\leadsto c \cdot \log \left(1 + \color{blue}{\left({e}^{x} - 1\right) \cdot y}\right) \]

      4. lift--.f64 N/A

         \[\leadsto c \cdot \log \left(1 + \color{blue}{\left({e}^{x} - 1\right)} \cdot y\right) \]

      5. lift-E.f64 N/A

         \[\leadsto c \cdot \log \left(1 + \left({\color{blue}{\mathsf{E}\left(\right)}}^{x} - 1\right) \cdot y\right) \]

      6. lift-pow.f64 N/A

         \[\leadsto c \cdot \log \left(1 + \left(\color{blue}{{\mathsf{E}\left(\right)}^{x}} - 1\right) \cdot y\right) \]

      7. *-commutative N/A

         \[\leadsto c \cdot \log \left(1 + \color{blue}{y \cdot \left({\mathsf{E}\left(\right)}^{x} - 1\right)}\right) \]

      8. lower-log1p.f64 N/A

         \[\leadsto c \cdot \color{blue}{\mathsf{log1p}\left(y \cdot \left({\mathsf{E}\left(\right)}^{x} - 1\right)\right)} \]

      9. *-commutative N/A

         \[\leadsto c \cdot \mathsf{log1p}\left(\color{blue}{\left({\mathsf{E}\left(\right)}^{x} - 1\right) \cdot y}\right) \]

      10. lower-*.f64 N/A

          \[\leadsto c \cdot \mathsf{log1p}\left(\color{blue}{\left({\mathsf{E}\left(\right)}^{x} - 1\right) \cdot y}\right) \]

      11. e-exp-1 N/A

          \[\leadsto c \cdot \mathsf{log1p}\left(\left({\color{blue}{\left(e^{1}\right)}}^{x} - 1\right) \cdot y\right) \]

      12. pow-exp N/A

          \[\leadsto c \cdot \mathsf{log1p}\left(\left(\color{blue}{e^{1 \cdot x}} - 1\right) \cdot y\right) \]

      13. *-lft-identity N/A

          \[\leadsto c \cdot \mathsf{log1p}\left(\left(e^{\color{blue}{x}} - 1\right) \cdot y\right) \]

      14. lower-expm1.f64 93.1

          \[\leadsto c \cdot \mathsf{log1p}\left(\color{blue}{\mathsf{expm1}\left(x\right)} \cdot y\right) \]

   3. Applied rewrites 93.1%

      \[\leadsto c \cdot \color{blue}{\mathsf{log1p}\left(\mathsf{expm1}\left(x\right) \cdot y\right)} \]

   4. Taylor expanded in x around 0

      \[\leadsto c \cdot \mathsf{log1p}\left(\color{blue}{x} \cdot y\right) \]
   5. Step-by-step derivation

   6. Applied rewrites 66.4%

      \[\leadsto c \cdot \mathsf{log1p}\left(\color{blue}{x} \cdot y\right) \]

   if -122 < y < 2.2999999999999998

   1. Initial program 41.5%

      \[c \cdot \log \left(1 + \left({e}^{x} - 1\right) \cdot y\right) \]

   2. Taylor expanded in x around 0

      \[\leadsto \color{blue}{c \cdot \left(x \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right)} \]
   3. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \left(c \cdot x\right) \cdot \color{blue}{\left(y \cdot \log \mathsf{E}\left(\right)\right)} \]

      2. log-E N/A

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

      3. *-rgt-identity N/A

         \[\leadsto \left(c \cdot x\right) \cdot y \]

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

         \[\leadsto \left(c \cdot y\right) \cdot x \]

      7. *-rgt-identity N/A

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

      8. log-E N/A

         \[\leadsto \left(c \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right) \cdot x \]

      9. lower-*.f64 N/A

         \[\leadsto \left(c \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right) \cdot \color{blue}{x} \]

      10. *-commutative N/A

          \[\leadsto \left(\left(y \cdot \log \mathsf{E}\left(\right)\right) \cdot c\right) \cdot x \]

      11. log-E N/A

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

      12. metadata-eval N/A

          \[\leadsto \left(\left(y \cdot {1}^{2}\right) \cdot c\right) \cdot x \]

      13. log-E N/A

          \[\leadsto \left(\left(y \cdot {\log \mathsf{E}\left(\right)}^{2}\right) \cdot c\right) \cdot x \]

      14. log-E N/A

          \[\leadsto \left(\left(y \cdot {1}^{2}\right) \cdot c\right) \cdot x \]

      15. metadata-eval N/A

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

      16. *-commutative N/A

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

      17. *-lft-identity N/A

          \[\leadsto \left(y \cdot c\right) \cdot x \]

      18. lower-*.f64 62.5

          \[\leadsto \left(y \cdot c\right) \cdot x \]

   4. Applied rewrites 62.5%

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

   5. Taylor expanded in y around 0

      \[\leadsto \color{blue}{c \cdot \left(y \cdot \left({\mathsf{E}\left(\right)}^{x} - 1\right)\right)} \]
   6. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \left(c \cdot y\right) \cdot \color{blue}{\left({\mathsf{E}\left(\right)}^{x} - 1\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(c \cdot y\right) \cdot \color{blue}{\left({\mathsf{E}\left(\right)}^{x} - 1\right)} \]

      3. *-commutative N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(\color{blue}{{\mathsf{E}\left(\right)}^{x}} - 1\right) \]

      4. lift-*.f64 N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(\color{blue}{{\mathsf{E}\left(\right)}^{x}} - 1\right) \]

      5. e-exp-1 N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left({\left(e^{1}\right)}^{x} - 1\right) \]

      6. pow-exp N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(e^{1 \cdot x} - 1\right) \]

      7. metadata-eval N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(e^{\left(\mathsf{neg}\left(-1\right)\right) \cdot x} - 1\right) \]

      8. distribute-lft-neg-out N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(e^{\mathsf{neg}\left(-1 \cdot x\right)} - 1\right) \]

      9. mul-1-neg N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(e^{\mathsf{neg}\left(\left(\mathsf{neg}\left(x\right)\right)\right)} - 1\right) \]

      10. lower-expm1.f64 N/A

          \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(\mathsf{neg}\left(\left(\mathsf{neg}\left(x\right)\right)\right)\right) \]

      11. lower-neg.f64 N/A

          \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(-\left(\mathsf{neg}\left(x\right)\right)\right) \]

      12. lower-neg.f64 77.1

          \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(-\left(-x\right)\right) \]

   7. Applied rewrites 77.1%

      \[\leadsto \color{blue}{\left(y \cdot c\right) \cdot \mathsf{expm1}\left(-\left(-x\right)\right)} \]
   8. Step-by-step derivation

      1. lift-neg.f64 N/A

         \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(\mathsf{neg}\left(\left(-x\right)\right)\right) \]

      2. lift-neg.f64 N/A

         \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(\mathsf{neg}\left(\left(\mathsf{neg}\left(x\right)\right)\right)\right) \]

      3. remove-double-neg 77.1

         \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(x\right) \]

   9. Applied rewrites 77.1%

      \[\leadsto \left(y \cdot c\right) \cdot \color{blue}{\mathsf{expm1}\left(x\right)} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 89.9% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := c \cdot \mathsf{log1p}\left(x \cdot y\right)\\ \mathbf{if}\;y \leq -122:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 2.3:\\ \;\;\;\;\left(y \cdot c\right) \cdot \mathsf{expm1}\left(x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (c x y)
 :precision binary64
 (let* ((t_0 (* c (log1p (* x y)))))
   (if (<= y -122.0) t_0 (if (<= y 2.3) (* (* y c) (expm1 x)) t_0))))

C

double code(double c, double x, double y) {
	double t_0 = c * log1p((x * y));
	double tmp;
	if (y <= -122.0) {
		tmp = t_0;
	} else if (y <= 2.3) {
		tmp = (y * c) * expm1(x);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Java

public static double code(double c, double x, double y) {
	double t_0 = c * Math.log1p((x * y));
	double tmp;
	if (y <= -122.0) {
		tmp = t_0;
	} else if (y <= 2.3) {
		tmp = (y * c) * Math.expm1(x);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(c, x, y):
	t_0 = c * math.log1p((x * y))
	tmp = 0
	if y <= -122.0:
		tmp = t_0
	elif y <= 2.3:
		tmp = (y * c) * math.expm1(x)
	else:
		tmp = t_0
	return tmp

Julia

function code(c, x, y)
	t_0 = Float64(c * log1p(Float64(x * y)))
	tmp = 0.0
	if (y <= -122.0)
		tmp = t_0;
	elseif (y <= 2.3)
		tmp = Float64(Float64(y * c) * expm1(x));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[c_, x_, y_] := Block[{t$95$0 = N[(c * N[Log[1 + N[(x * y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -122.0], t$95$0, If[LessEqual[y, 2.3], N[(N[(y * c), $MachinePrecision] * N[(Exp[x] - 1), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -122 or 2.2999999999999998 < y

   1. Initial program 41.5%

      \[c \cdot \log \left(1 + \left({e}^{x} - 1\right) \cdot y\right) \]
   2. Step-by-step derivation

      1. lift-log.f64 N/A

         \[\leadsto c \cdot \color{blue}{\log \left(1 + \left({e}^{x} - 1\right) \cdot y\right)} \]

      2. lift-+.f64 N/A

         \[\leadsto c \cdot \log \color{blue}{\left(1 + \left({e}^{x} - 1\right) \cdot y\right)} \]

      3. lift-*.f64 N/A

         \[\leadsto c \cdot \log \left(1 + \color{blue}{\left({e}^{x} - 1\right) \cdot y}\right) \]

      4. lift--.f64 N/A

         \[\leadsto c \cdot \log \left(1 + \color{blue}{\left({e}^{x} - 1\right)} \cdot y\right) \]

      5. lift-E.f64 N/A

         \[\leadsto c \cdot \log \left(1 + \left({\color{blue}{\mathsf{E}\left(\right)}}^{x} - 1\right) \cdot y\right) \]

      6. lift-pow.f64 N/A

         \[\leadsto c \cdot \log \left(1 + \left(\color{blue}{{\mathsf{E}\left(\right)}^{x}} - 1\right) \cdot y\right) \]

      7. *-commutative N/A

         \[\leadsto c \cdot \log \left(1 + \color{blue}{y \cdot \left({\mathsf{E}\left(\right)}^{x} - 1\right)}\right) \]

      8. lower-log1p.f64 N/A

         \[\leadsto c \cdot \color{blue}{\mathsf{log1p}\left(y \cdot \left({\mathsf{E}\left(\right)}^{x} - 1\right)\right)} \]

      9. *-commutative N/A

         \[\leadsto c \cdot \mathsf{log1p}\left(\color{blue}{\left({\mathsf{E}\left(\right)}^{x} - 1\right) \cdot y}\right) \]

      10. lower-*.f64 N/A

          \[\leadsto c \cdot \mathsf{log1p}\left(\color{blue}{\left({\mathsf{E}\left(\right)}^{x} - 1\right) \cdot y}\right) \]

      11. e-exp-1 N/A

          \[\leadsto c \cdot \mathsf{log1p}\left(\left({\color{blue}{\left(e^{1}\right)}}^{x} - 1\right) \cdot y\right) \]

      12. pow-exp N/A

          \[\leadsto c \cdot \mathsf{log1p}\left(\left(\color{blue}{e^{1 \cdot x}} - 1\right) \cdot y\right) \]

      13. *-lft-identity N/A

          \[\leadsto c \cdot \mathsf{log1p}\left(\left(e^{\color{blue}{x}} - 1\right) \cdot y\right) \]

      14. lower-expm1.f64 93.1

          \[\leadsto c \cdot \mathsf{log1p}\left(\color{blue}{\mathsf{expm1}\left(x\right)} \cdot y\right) \]

   3. Applied rewrites 93.1%

      \[\leadsto c \cdot \color{blue}{\mathsf{log1p}\left(\mathsf{expm1}\left(x\right) \cdot y\right)} \]

   4. Taylor expanded in x around 0

      \[\leadsto c \cdot \mathsf{log1p}\left(\color{blue}{x} \cdot y\right) \]
   5. Step-by-step derivation

   6. Applied rewrites 66.4%

      \[\leadsto c \cdot \mathsf{log1p}\left(\color{blue}{x} \cdot y\right) \]

   if -122 < y < 2.2999999999999998

   1. Initial program 41.5%

      \[c \cdot \log \left(1 + \left({e}^{x} - 1\right) \cdot y\right) \]

   2. Taylor expanded in x around 0

      \[\leadsto \color{blue}{c \cdot \left(x \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right)} \]
   3. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \left(c \cdot x\right) \cdot \color{blue}{\left(y \cdot \log \mathsf{E}\left(\right)\right)} \]

      2. log-E N/A

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

      3. *-rgt-identity N/A

         \[\leadsto \left(c \cdot x\right) \cdot y \]

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

         \[\leadsto \left(c \cdot y\right) \cdot x \]

      7. *-rgt-identity N/A

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

      8. log-E N/A

         \[\leadsto \left(c \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right) \cdot x \]

      9. lower-*.f64 N/A

         \[\leadsto \left(c \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right) \cdot \color{blue}{x} \]

      10. *-commutative N/A

          \[\leadsto \left(\left(y \cdot \log \mathsf{E}\left(\right)\right) \cdot c\right) \cdot x \]

      11. log-E N/A

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

      12. metadata-eval N/A

          \[\leadsto \left(\left(y \cdot {1}^{2}\right) \cdot c\right) \cdot x \]

      13. log-E N/A

          \[\leadsto \left(\left(y \cdot {\log \mathsf{E}\left(\right)}^{2}\right) \cdot c\right) \cdot x \]

      14. log-E N/A

          \[\leadsto \left(\left(y \cdot {1}^{2}\right) \cdot c\right) \cdot x \]

      15. metadata-eval N/A

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

      16. *-commutative N/A

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

      17. *-lft-identity N/A

          \[\leadsto \left(y \cdot c\right) \cdot x \]

      18. lower-*.f64 62.5

          \[\leadsto \left(y \cdot c\right) \cdot x \]

   4. Applied rewrites 62.5%

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

   5. Taylor expanded in y around 0

      \[\leadsto \color{blue}{c \cdot \left(y \cdot \left({\mathsf{E}\left(\right)}^{x} - 1\right)\right)} \]
   6. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \left(c \cdot y\right) \cdot \color{blue}{\left({\mathsf{E}\left(\right)}^{x} - 1\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(c \cdot y\right) \cdot \color{blue}{\left({\mathsf{E}\left(\right)}^{x} - 1\right)} \]

      3. *-commutative N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(\color{blue}{{\mathsf{E}\left(\right)}^{x}} - 1\right) \]

      4. lift-*.f64 N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(\color{blue}{{\mathsf{E}\left(\right)}^{x}} - 1\right) \]

      5. e-exp-1 N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left({\left(e^{1}\right)}^{x} - 1\right) \]

      6. pow-exp N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(e^{1 \cdot x} - 1\right) \]

      7. metadata-eval N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(e^{\left(\mathsf{neg}\left(-1\right)\right) \cdot x} - 1\right) \]

      8. distribute-lft-neg-out N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(e^{\mathsf{neg}\left(-1 \cdot x\right)} - 1\right) \]

      9. mul-1-neg N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(e^{\mathsf{neg}\left(\left(\mathsf{neg}\left(x\right)\right)\right)} - 1\right) \]

      10. lower-expm1.f64 N/A

          \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(\mathsf{neg}\left(\left(\mathsf{neg}\left(x\right)\right)\right)\right) \]

      11. lower-neg.f64 N/A

          \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(-\left(\mathsf{neg}\left(x\right)\right)\right) \]

      12. lower-neg.f64 77.1

          \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(-\left(-x\right)\right) \]

   7. Applied rewrites 77.1%

      \[\leadsto \color{blue}{\left(y \cdot c\right) \cdot \mathsf{expm1}\left(-\left(-x\right)\right)} \]
   8. Step-by-step derivation

      1. lift-neg.f64 N/A

         \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(\mathsf{neg}\left(\left(-x\right)\right)\right) \]

      2. lift-neg.f64 N/A

         \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(\mathsf{neg}\left(\left(\mathsf{neg}\left(x\right)\right)\right)\right) \]

      3. remove-double-neg 77.1

         \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(x\right) \]

   9. Applied rewrites 77.1%

      \[\leadsto \left(y \cdot c\right) \cdot \color{blue}{\mathsf{expm1}\left(x\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 81.6% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := c \cdot \log \left(\mathsf{fma}\left(y, x, 1\right)\right)\\ \mathbf{if}\;y \leq -3.3 \cdot 10^{+159}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 2 \cdot 10^{+117}:\\ \;\;\;\;\left(y \cdot c\right) \cdot \mathsf{expm1}\left(x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (c x y)
 :precision binary64
 (let* ((t_0 (* c (log (fma y x 1.0)))))
   (if (<= y -3.3e+159) t_0 (if (<= y 2e+117) (* (* y c) (expm1 x)) t_0))))

C

double code(double c, double x, double y) {
	double t_0 = c * log(fma(y, x, 1.0));
	double tmp;
	if (y <= -3.3e+159) {
		tmp = t_0;
	} else if (y <= 2e+117) {
		tmp = (y * c) * expm1(x);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(c, x, y)
	t_0 = Float64(c * log(fma(y, x, 1.0)))
	tmp = 0.0
	if (y <= -3.3e+159)
		tmp = t_0;
	elseif (y <= 2e+117)
		tmp = Float64(Float64(y * c) * expm1(x));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[c_, x_, y_] := Block[{t$95$0 = N[(c * N[Log[N[(y * x + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]}, If[LessEqual[y, -3.3e+159], t$95$0, If[LessEqual[y, 2e+117], N[(N[(y * c), $MachinePrecision] * N[(Exp[x] - 1), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -3.2999999999999999e159 or 2.0000000000000001e117 < y

   1. Initial program 41.5%

      \[c \cdot \log \left(1 + \left({e}^{x} - 1\right) \cdot y\right) \]

   2. Taylor expanded in x around 0

      \[\leadsto c \cdot \log \color{blue}{\left(1 + x \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right)} \]
   3. Step-by-step derivation

      1. +-commutative N/A

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

      2. log-E N/A

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

      3. metadata-eval N/A

         \[\leadsto c \cdot \log \left(x \cdot \left(y \cdot {1}^{2}\right) + 1\right) \]

      4. log-E N/A

         \[\leadsto c \cdot \log \left(x \cdot \left(y \cdot {\log \mathsf{E}\left(\right)}^{2}\right) + 1\right) \]

      5. associate-*r* N/A

         \[\leadsto c \cdot \log \left(\left(x \cdot y\right) \cdot {\log \mathsf{E}\left(\right)}^{2} + 1\right) \]

      6. log-E N/A

         \[\leadsto c \cdot \log \left(\left(x \cdot y\right) \cdot {1}^{2} + 1\right) \]

      7. metadata-eval N/A

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

      8. *-rgt-identity N/A

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

      9. *-commutative N/A

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

      10. lower-fma.f64 40.0

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

   4. Applied rewrites 40.0%

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

   if -3.2999999999999999e159 < y < 2.0000000000000001e117

   1. Initial program 41.5%

      \[c \cdot \log \left(1 + \left({e}^{x} - 1\right) \cdot y\right) \]

   2. Taylor expanded in x around 0

      \[\leadsto \color{blue}{c \cdot \left(x \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right)} \]
   3. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \left(c \cdot x\right) \cdot \color{blue}{\left(y \cdot \log \mathsf{E}\left(\right)\right)} \]

      2. log-E N/A

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

      3. *-rgt-identity N/A

         \[\leadsto \left(c \cdot x\right) \cdot y \]

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

         \[\leadsto \left(c \cdot y\right) \cdot x \]

      7. *-rgt-identity N/A

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

      8. log-E N/A

         \[\leadsto \left(c \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right) \cdot x \]

      9. lower-*.f64 N/A

         \[\leadsto \left(c \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right) \cdot \color{blue}{x} \]

      10. *-commutative N/A

          \[\leadsto \left(\left(y \cdot \log \mathsf{E}\left(\right)\right) \cdot c\right) \cdot x \]

      11. log-E N/A

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

      12. metadata-eval N/A

          \[\leadsto \left(\left(y \cdot {1}^{2}\right) \cdot c\right) \cdot x \]

      13. log-E N/A

          \[\leadsto \left(\left(y \cdot {\log \mathsf{E}\left(\right)}^{2}\right) \cdot c\right) \cdot x \]

      14. log-E N/A

          \[\leadsto \left(\left(y \cdot {1}^{2}\right) \cdot c\right) \cdot x \]

      15. metadata-eval N/A

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

      16. *-commutative N/A

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

      17. *-lft-identity N/A

          \[\leadsto \left(y \cdot c\right) \cdot x \]

      18. lower-*.f64 62.5

          \[\leadsto \left(y \cdot c\right) \cdot x \]

   4. Applied rewrites 62.5%

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

   5. Taylor expanded in y around 0

      \[\leadsto \color{blue}{c \cdot \left(y \cdot \left({\mathsf{E}\left(\right)}^{x} - 1\right)\right)} \]
   6. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \left(c \cdot y\right) \cdot \color{blue}{\left({\mathsf{E}\left(\right)}^{x} - 1\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(c \cdot y\right) \cdot \color{blue}{\left({\mathsf{E}\left(\right)}^{x} - 1\right)} \]

      3. *-commutative N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(\color{blue}{{\mathsf{E}\left(\right)}^{x}} - 1\right) \]

      4. lift-*.f64 N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(\color{blue}{{\mathsf{E}\left(\right)}^{x}} - 1\right) \]

      5. e-exp-1 N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left({\left(e^{1}\right)}^{x} - 1\right) \]

      6. pow-exp N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(e^{1 \cdot x} - 1\right) \]

      7. metadata-eval N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(e^{\left(\mathsf{neg}\left(-1\right)\right) \cdot x} - 1\right) \]

      8. distribute-lft-neg-out N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(e^{\mathsf{neg}\left(-1 \cdot x\right)} - 1\right) \]

      9. mul-1-neg N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(e^{\mathsf{neg}\left(\left(\mathsf{neg}\left(x\right)\right)\right)} - 1\right) \]

      10. lower-expm1.f64 N/A

          \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(\mathsf{neg}\left(\left(\mathsf{neg}\left(x\right)\right)\right)\right) \]

      11. lower-neg.f64 N/A

          \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(-\left(\mathsf{neg}\left(x\right)\right)\right) \]

      12. lower-neg.f64 77.1

          \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(-\left(-x\right)\right) \]

   7. Applied rewrites 77.1%

      \[\leadsto \color{blue}{\left(y \cdot c\right) \cdot \mathsf{expm1}\left(-\left(-x\right)\right)} \]
   8. Step-by-step derivation

      1. lift-neg.f64 N/A

         \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(\mathsf{neg}\left(\left(-x\right)\right)\right) \]

      2. lift-neg.f64 N/A

         \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(\mathsf{neg}\left(\left(\mathsf{neg}\left(x\right)\right)\right)\right) \]

      3. remove-double-neg 77.1

         \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(x\right) \]

   9. Applied rewrites 77.1%

      \[\leadsto \left(y \cdot c\right) \cdot \color{blue}{\mathsf{expm1}\left(x\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 80.3% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \log \left(y \cdot x\right) \cdot c\\ \mathbf{if}\;y \leq -5.3 \cdot 10^{+182}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 3.7 \cdot 10^{+121}:\\ \;\;\;\;\left(y \cdot c\right) \cdot \mathsf{expm1}\left(x\right)\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (c x y)
 :precision binary64
 (let* ((t_0 (* (log (* y x)) c)))
   (if (<= y -5.3e+182) t_0 (if (<= y 3.7e+121) (* (* y c) (expm1 x)) t_0))))

C

double code(double c, double x, double y) {
	double t_0 = log((y * x)) * c;
	double tmp;
	if (y <= -5.3e+182) {
		tmp = t_0;
	} else if (y <= 3.7e+121) {
		tmp = (y * c) * expm1(x);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Java

public static double code(double c, double x, double y) {
	double t_0 = Math.log((y * x)) * c;
	double tmp;
	if (y <= -5.3e+182) {
		tmp = t_0;
	} else if (y <= 3.7e+121) {
		tmp = (y * c) * Math.expm1(x);
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(c, x, y):
	t_0 = math.log((y * x)) * c
	tmp = 0
	if y <= -5.3e+182:
		tmp = t_0
	elif y <= 3.7e+121:
		tmp = (y * c) * math.expm1(x)
	else:
		tmp = t_0
	return tmp

Julia

function code(c, x, y)
	t_0 = Float64(log(Float64(y * x)) * c)
	tmp = 0.0
	if (y <= -5.3e+182)
		tmp = t_0;
	elseif (y <= 3.7e+121)
		tmp = Float64(Float64(y * c) * expm1(x));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[c_, x_, y_] := Block[{t$95$0 = N[(N[Log[N[(y * x), $MachinePrecision]], $MachinePrecision] * c), $MachinePrecision]}, If[LessEqual[y, -5.3e+182], t$95$0, If[LessEqual[y, 3.7e+121], N[(N[(y * c), $MachinePrecision] * N[(Exp[x] - 1), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -5.3e182 or 3.70000000000000013e121 < y

   1. Initial program 41.5%

      \[c \cdot \log \left(1 + \left({e}^{x} - 1\right) \cdot y\right) \]

   2. Taylor expanded in y around inf

      \[\leadsto \color{blue}{c \cdot \left(\log \left({\mathsf{E}\left(\right)}^{x} - 1\right) + -1 \cdot \log \left(\frac{1}{y}\right)\right)} \]

   4. Applied rewrites 5.5%

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

   5. Taylor expanded in x around 0

      \[\leadsto \left(\log x + \log y\right) \cdot c \]
   6. Step-by-step derivation

      1. sum-log N/A

         \[\leadsto \log \left(x \cdot y\right) \cdot c \]

      2. lower-log.f64 N/A

         \[\leadsto \log \left(x \cdot y\right) \cdot c \]

      3. *-commutative N/A

         \[\leadsto \log \left(y \cdot x\right) \cdot c \]

      4. lower-*.f64 11.7

         \[\leadsto \log \left(y \cdot x\right) \cdot c \]

   7. Applied rewrites 11.7%

      \[\leadsto \log \left(y \cdot x\right) \cdot c \]

   if -5.3e182 < y < 3.70000000000000013e121

   1. Initial program 41.5%

      \[c \cdot \log \left(1 + \left({e}^{x} - 1\right) \cdot y\right) \]

   2. Taylor expanded in x around 0

      \[\leadsto \color{blue}{c \cdot \left(x \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right)} \]
   3. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \left(c \cdot x\right) \cdot \color{blue}{\left(y \cdot \log \mathsf{E}\left(\right)\right)} \]

      2. log-E N/A

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

      3. *-rgt-identity N/A

         \[\leadsto \left(c \cdot x\right) \cdot y \]

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

         \[\leadsto \left(c \cdot y\right) \cdot x \]

      7. *-rgt-identity N/A

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

      8. log-E N/A

         \[\leadsto \left(c \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right) \cdot x \]

      9. lower-*.f64 N/A

         \[\leadsto \left(c \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right) \cdot \color{blue}{x} \]

      10. *-commutative N/A

          \[\leadsto \left(\left(y \cdot \log \mathsf{E}\left(\right)\right) \cdot c\right) \cdot x \]

      11. log-E N/A

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

      12. metadata-eval N/A

          \[\leadsto \left(\left(y \cdot {1}^{2}\right) \cdot c\right) \cdot x \]

      13. log-E N/A

          \[\leadsto \left(\left(y \cdot {\log \mathsf{E}\left(\right)}^{2}\right) \cdot c\right) \cdot x \]

      14. log-E N/A

          \[\leadsto \left(\left(y \cdot {1}^{2}\right) \cdot c\right) \cdot x \]

      15. metadata-eval N/A

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

      16. *-commutative N/A

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

      17. *-lft-identity N/A

          \[\leadsto \left(y \cdot c\right) \cdot x \]

      18. lower-*.f64 62.5

          \[\leadsto \left(y \cdot c\right) \cdot x \]

   4. Applied rewrites 62.5%

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

   5. Taylor expanded in y around 0

      \[\leadsto \color{blue}{c \cdot \left(y \cdot \left({\mathsf{E}\left(\right)}^{x} - 1\right)\right)} \]
   6. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \left(c \cdot y\right) \cdot \color{blue}{\left({\mathsf{E}\left(\right)}^{x} - 1\right)} \]

      2. lower-*.f64 N/A

         \[\leadsto \left(c \cdot y\right) \cdot \color{blue}{\left({\mathsf{E}\left(\right)}^{x} - 1\right)} \]

      3. *-commutative N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(\color{blue}{{\mathsf{E}\left(\right)}^{x}} - 1\right) \]

      4. lift-*.f64 N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(\color{blue}{{\mathsf{E}\left(\right)}^{x}} - 1\right) \]

      5. e-exp-1 N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left({\left(e^{1}\right)}^{x} - 1\right) \]

      6. pow-exp N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(e^{1 \cdot x} - 1\right) \]

      7. metadata-eval N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(e^{\left(\mathsf{neg}\left(-1\right)\right) \cdot x} - 1\right) \]

      8. distribute-lft-neg-out N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(e^{\mathsf{neg}\left(-1 \cdot x\right)} - 1\right) \]

      9. mul-1-neg N/A

         \[\leadsto \left(y \cdot c\right) \cdot \left(e^{\mathsf{neg}\left(\left(\mathsf{neg}\left(x\right)\right)\right)} - 1\right) \]

      10. lower-expm1.f64 N/A

          \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(\mathsf{neg}\left(\left(\mathsf{neg}\left(x\right)\right)\right)\right) \]

      11. lower-neg.f64 N/A

          \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(-\left(\mathsf{neg}\left(x\right)\right)\right) \]

      12. lower-neg.f64 77.1

          \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(-\left(-x\right)\right) \]

   7. Applied rewrites 77.1%

      \[\leadsto \color{blue}{\left(y \cdot c\right) \cdot \mathsf{expm1}\left(-\left(-x\right)\right)} \]
   8. Step-by-step derivation

      1. lift-neg.f64 N/A

         \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(\mathsf{neg}\left(\left(-x\right)\right)\right) \]

      2. lift-neg.f64 N/A

         \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(\mathsf{neg}\left(\left(\mathsf{neg}\left(x\right)\right)\right)\right) \]

      3. remove-double-neg 77.1

         \[\leadsto \left(y \cdot c\right) \cdot \mathsf{expm1}\left(x\right) \]

   9. Applied rewrites 77.1%

      \[\leadsto \left(y \cdot c\right) \cdot \color{blue}{\mathsf{expm1}\left(x\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 7: 65.8% accurate, 1.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \log \left(y \cdot x\right) \cdot c\\ \mathbf{if}\;y \leq -5.3 \cdot 10^{+182}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 3.7 \cdot 10^{+121}:\\ \;\;\;\;\left(y \cdot c\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (c x y)
 :precision binary64
 (let* ((t_0 (* (log (* y x)) c)))
   (if (<= y -5.3e+182) t_0 (if (<= y 3.7e+121) (* (* y c) x) t_0))))

C

double code(double c, double x, double y) {
	double t_0 = log((y * x)) * c;
	double tmp;
	if (y <= -5.3e+182) {
		tmp = t_0;
	} else if (y <= 3.7e+121) {
		tmp = (y * c) * x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(c, x, y)
use fmin_fmax_functions
    real(8), intent (in) :: c
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: t_0
    real(8) :: tmp
    t_0 = log((y * x)) * c
    if (y <= (-5.3d+182)) then
        tmp = t_0
    else if (y <= 3.7d+121) then
        tmp = (y * c) * x
    else
        tmp = t_0
    end if
    code = tmp
end function

Java

public static double code(double c, double x, double y) {
	double t_0 = Math.log((y * x)) * c;
	double tmp;
	if (y <= -5.3e+182) {
		tmp = t_0;
	} else if (y <= 3.7e+121) {
		tmp = (y * c) * x;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(c, x, y):
	t_0 = math.log((y * x)) * c
	tmp = 0
	if y <= -5.3e+182:
		tmp = t_0
	elif y <= 3.7e+121:
		tmp = (y * c) * x
	else:
		tmp = t_0
	return tmp

Julia

function code(c, x, y)
	t_0 = Float64(log(Float64(y * x)) * c)
	tmp = 0.0
	if (y <= -5.3e+182)
		tmp = t_0;
	elseif (y <= 3.7e+121)
		tmp = Float64(Float64(y * c) * x);
	else
		tmp = t_0;
	end
	return tmp
end

MATLAB

function tmp_2 = code(c, x, y)
	t_0 = log((y * x)) * c;
	tmp = 0.0;
	if (y <= -5.3e+182)
		tmp = t_0;
	elseif (y <= 3.7e+121)
		tmp = (y * c) * x;
	else
		tmp = t_0;
	end
	tmp_2 = tmp;
end

Wolfram

code[c_, x_, y_] := Block[{t$95$0 = N[(N[Log[N[(y * x), $MachinePrecision]], $MachinePrecision] * c), $MachinePrecision]}, If[LessEqual[y, -5.3e+182], t$95$0, If[LessEqual[y, 3.7e+121], N[(N[(y * c), $MachinePrecision] * x), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -5.3e182 or 3.70000000000000013e121 < y

   1. Initial program 41.5%

      \[c \cdot \log \left(1 + \left({e}^{x} - 1\right) \cdot y\right) \]

   2. Taylor expanded in y around inf

      \[\leadsto \color{blue}{c \cdot \left(\log \left({\mathsf{E}\left(\right)}^{x} - 1\right) + -1 \cdot \log \left(\frac{1}{y}\right)\right)} \]

   4. Applied rewrites 5.5%

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

   5. Taylor expanded in x around 0

      \[\leadsto \left(\log x + \log y\right) \cdot c \]
   6. Step-by-step derivation

      1. sum-log N/A

         \[\leadsto \log \left(x \cdot y\right) \cdot c \]

      2. lower-log.f64 N/A

         \[\leadsto \log \left(x \cdot y\right) \cdot c \]

      3. *-commutative N/A

         \[\leadsto \log \left(y \cdot x\right) \cdot c \]

      4. lower-*.f64 11.7

         \[\leadsto \log \left(y \cdot x\right) \cdot c \]

   7. Applied rewrites 11.7%

      \[\leadsto \log \left(y \cdot x\right) \cdot c \]

   if -5.3e182 < y < 3.70000000000000013e121

   1. Initial program 41.5%

      \[c \cdot \log \left(1 + \left({e}^{x} - 1\right) \cdot y\right) \]

   2. Taylor expanded in x around 0

      \[\leadsto \color{blue}{c \cdot \left(x \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right)} \]
   3. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \left(c \cdot x\right) \cdot \color{blue}{\left(y \cdot \log \mathsf{E}\left(\right)\right)} \]

      2. log-E N/A

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

      3. *-rgt-identity N/A

         \[\leadsto \left(c \cdot x\right) \cdot y \]

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

         \[\leadsto \left(c \cdot y\right) \cdot x \]

      7. *-rgt-identity N/A

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

      8. log-E N/A

         \[\leadsto \left(c \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right) \cdot x \]

      9. lower-*.f64 N/A

         \[\leadsto \left(c \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right) \cdot \color{blue}{x} \]

      10. *-commutative N/A

          \[\leadsto \left(\left(y \cdot \log \mathsf{E}\left(\right)\right) \cdot c\right) \cdot x \]

      11. log-E N/A

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

      12. metadata-eval N/A

          \[\leadsto \left(\left(y \cdot {1}^{2}\right) \cdot c\right) \cdot x \]

      13. log-E N/A

          \[\leadsto \left(\left(y \cdot {\log \mathsf{E}\left(\right)}^{2}\right) \cdot c\right) \cdot x \]

      14. log-E N/A

          \[\leadsto \left(\left(y \cdot {1}^{2}\right) \cdot c\right) \cdot x \]

      15. metadata-eval N/A

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

      16. *-commutative N/A

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

      17. *-lft-identity N/A

          \[\leadsto \left(y \cdot c\right) \cdot x \]

      18. lower-*.f64 62.5

          \[\leadsto \left(y \cdot c\right) \cdot x \]

   4. Applied rewrites 62.5%

      \[\leadsto \color{blue}{\left(y \cdot c\right) \cdot x} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 8: 63.8% accurate, 3.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;c \leq 6.6 \cdot 10^{+103}:\\ \;\;\;\;\left(y \cdot c\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;y \cdot \left(c \cdot x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (c x y)
 :precision binary64
 (if (<= c 6.6e+103) (* (* y c) x) (* y (* c x))))

C

double code(double c, double x, double y) {
	double tmp;
	if (c <= 6.6e+103) {
		tmp = (y * c) * x;
	} else {
		tmp = y * (c * x);
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(c, x, y)
use fmin_fmax_functions
    real(8), intent (in) :: c
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (c <= 6.6d+103) then
        tmp = (y * c) * x
    else
        tmp = y * (c * x)
    end if
    code = tmp
end function

Java

public static double code(double c, double x, double y) {
	double tmp;
	if (c <= 6.6e+103) {
		tmp = (y * c) * x;
	} else {
		tmp = y * (c * x);
	}
	return tmp;
}

Python

def code(c, x, y):
	tmp = 0
	if c <= 6.6e+103:
		tmp = (y * c) * x
	else:
		tmp = y * (c * x)
	return tmp

Julia

function code(c, x, y)
	tmp = 0.0
	if (c <= 6.6e+103)
		tmp = Float64(Float64(y * c) * x);
	else
		tmp = Float64(y * Float64(c * x));
	end
	return tmp
end

MATLAB

function tmp_2 = code(c, x, y)
	tmp = 0.0;
	if (c <= 6.6e+103)
		tmp = (y * c) * x;
	else
		tmp = y * (c * x);
	end
	tmp_2 = tmp;
end

Wolfram

code[c_, x_, y_] := If[LessEqual[c, 6.6e+103], N[(N[(y * c), $MachinePrecision] * x), $MachinePrecision], N[(y * N[(c * x), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if c < 6.60000000000000017e103

   1. Initial program 41.5%

      \[c \cdot \log \left(1 + \left({e}^{x} - 1\right) \cdot y\right) \]

   2. Taylor expanded in x around 0

      \[\leadsto \color{blue}{c \cdot \left(x \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right)} \]
   3. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \left(c \cdot x\right) \cdot \color{blue}{\left(y \cdot \log \mathsf{E}\left(\right)\right)} \]

      2. log-E N/A

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

      3. *-rgt-identity N/A

         \[\leadsto \left(c \cdot x\right) \cdot y \]

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

         \[\leadsto \left(c \cdot y\right) \cdot x \]

      7. *-rgt-identity N/A

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

      8. log-E N/A

         \[\leadsto \left(c \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right) \cdot x \]

      9. lower-*.f64 N/A

         \[\leadsto \left(c \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right) \cdot \color{blue}{x} \]

      10. *-commutative N/A

          \[\leadsto \left(\left(y \cdot \log \mathsf{E}\left(\right)\right) \cdot c\right) \cdot x \]

      11. log-E N/A

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

      12. metadata-eval N/A

          \[\leadsto \left(\left(y \cdot {1}^{2}\right) \cdot c\right) \cdot x \]

      13. log-E N/A

          \[\leadsto \left(\left(y \cdot {\log \mathsf{E}\left(\right)}^{2}\right) \cdot c\right) \cdot x \]

      14. log-E N/A

          \[\leadsto \left(\left(y \cdot {1}^{2}\right) \cdot c\right) \cdot x \]

      15. metadata-eval N/A

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

      16. *-commutative N/A

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

      17. *-lft-identity N/A

          \[\leadsto \left(y \cdot c\right) \cdot x \]

      18. lower-*.f64 62.5

          \[\leadsto \left(y \cdot c\right) \cdot x \]

   4. Applied rewrites 62.5%

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

   if 6.60000000000000017e103 < c

   1. Initial program 41.5%

      \[c \cdot \log \left(1 + \left({e}^{x} - 1\right) \cdot y\right) \]

   2. Taylor expanded in x around 0

      \[\leadsto \color{blue}{c \cdot \left(x \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right)} \]
   3. Step-by-step derivation

      1. associate-*r* N/A

         \[\leadsto \left(c \cdot x\right) \cdot \color{blue}{\left(y \cdot \log \mathsf{E}\left(\right)\right)} \]

      2. log-E N/A

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

      3. *-rgt-identity N/A

         \[\leadsto \left(c \cdot x\right) \cdot y \]

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

         \[\leadsto \left(c \cdot y\right) \cdot x \]

      7. *-rgt-identity N/A

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

      8. log-E N/A

         \[\leadsto \left(c \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right) \cdot x \]

      9. lower-*.f64 N/A

         \[\leadsto \left(c \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right) \cdot \color{blue}{x} \]

      10. *-commutative N/A

          \[\leadsto \left(\left(y \cdot \log \mathsf{E}\left(\right)\right) \cdot c\right) \cdot x \]

      11. log-E N/A

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

      12. metadata-eval N/A

          \[\leadsto \left(\left(y \cdot {1}^{2}\right) \cdot c\right) \cdot x \]

      13. log-E N/A

          \[\leadsto \left(\left(y \cdot {\log \mathsf{E}\left(\right)}^{2}\right) \cdot c\right) \cdot x \]

      14. log-E N/A

          \[\leadsto \left(\left(y \cdot {1}^{2}\right) \cdot c\right) \cdot x \]

      15. metadata-eval N/A

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

      16. *-commutative N/A

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

      17. *-lft-identity N/A

          \[\leadsto \left(y \cdot c\right) \cdot x \]

      18. lower-*.f64 62.5

          \[\leadsto \left(y \cdot c\right) \cdot x \]

   4. Applied rewrites 62.5%

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

      1. lift-*.f64 N/A

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

      2. lift-*.f64 N/A

         \[\leadsto \left(y \cdot c\right) \cdot x \]

      3. associate-*l* N/A

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

      4. lower-*.f64 N/A

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

      5. lower-*.f64 59.5

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

   6. Applied rewrites 59.5%

      \[\leadsto y \cdot \color{blue}{\left(c \cdot x\right)} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 9: 59.5% accurate, 4.9× speedup

Math

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

FPCore

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

C

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

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(c, x, y)
use fmin_fmax_functions
    real(8), intent (in) :: c
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = y * (c * x)
end function

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 41.5%

   \[c \cdot \log \left(1 + \left({e}^{x} - 1\right) \cdot y\right) \]

2. Taylor expanded in x around 0

   \[\leadsto \color{blue}{c \cdot \left(x \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right)} \]
3. Step-by-step derivation

   1. associate-*r* N/A

      \[\leadsto \left(c \cdot x\right) \cdot \color{blue}{\left(y \cdot \log \mathsf{E}\left(\right)\right)} \]

   2. log-E N/A

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

   3. *-rgt-identity N/A

      \[\leadsto \left(c \cdot x\right) \cdot y \]

   4. *-commutative N/A

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

   5. associate-*l* N/A

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

   6. *-commutative N/A

      \[\leadsto \left(c \cdot y\right) \cdot x \]

   7. *-rgt-identity N/A

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

   8. log-E N/A

      \[\leadsto \left(c \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right) \cdot x \]

   9. lower-*.f64 N/A

      \[\leadsto \left(c \cdot \left(y \cdot \log \mathsf{E}\left(\right)\right)\right) \cdot \color{blue}{x} \]

   10. *-commutative N/A

       \[\leadsto \left(\left(y \cdot \log \mathsf{E}\left(\right)\right) \cdot c\right) \cdot x \]

   11. log-E N/A

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

   12. metadata-eval N/A

       \[\leadsto \left(\left(y \cdot {1}^{2}\right) \cdot c\right) \cdot x \]

   13. log-E N/A

       \[\leadsto \left(\left(y \cdot {\log \mathsf{E}\left(\right)}^{2}\right) \cdot c\right) \cdot x \]

   14. log-E N/A

       \[\leadsto \left(\left(y \cdot {1}^{2}\right) \cdot c\right) \cdot x \]

   15. metadata-eval N/A

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

   16. *-commutative N/A

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

   17. *-lft-identity N/A

       \[\leadsto \left(y \cdot c\right) \cdot x \]

   18. lower-*.f64 62.5

       \[\leadsto \left(y \cdot c\right) \cdot x \]

4. Applied rewrites 62.5%

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

   1. lift-*.f64 N/A

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

   2. lift-*.f64 N/A

      \[\leadsto \left(y \cdot c\right) \cdot x \]

   3. associate-*l* N/A

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

   4. lower-*.f64 N/A

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

   5. lower-*.f64 59.5

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

6. Applied rewrites 59.5%

   \[\leadsto y \cdot \color{blue}{\left(c \cdot x\right)} \]
7. Add Preprocessing

Developer Target 1: 93.1% accurate, 1.4× speedup

Math

\[\begin{array}{l} \\ c \cdot \mathsf{log1p}\left(\mathsf{expm1}\left(x\right) \cdot y\right) \end{array} \]

FPCore

(FPCore (c x y) :precision binary64 (* c (log1p (* (expm1 x) y))))

C

double code(double c, double x, double y) {
	return c * log1p((expm1(x) * y));
}

Java

public static double code(double c, double x, double y) {
	return c * Math.log1p((Math.expm1(x) * y));
}

Python

def code(c, x, y):
	return c * math.log1p((math.expm1(x) * y))

Julia

function code(c, x, y)
	return Float64(c * log1p(Float64(expm1(x) * y)))
end

Wolfram

code[c_, x_, y_] := N[(c * N[Log[1 + N[(N[(Exp[x] - 1), $MachinePrecision] * y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2025129 
(FPCore (c x y)
  :name "Logarithmic Transform"
  :precision binary64

  :alt
  (* c (log1p (* (expm1 x) y)))

  (* c (log (+ 1.0 (* (- (pow E x) 1.0) y)))))