Logarithmic Transform

Percentage Accurate: 42.3% → 99.0%

Time: 6.5s

Alternatives: 7

Speedup: 4.9×

• could not determine a ground truth

  1. c = 3.470808203915522e+305
  2. x = 1.7227765240140733e+26
  3. y = 1.2753275707404458e-172

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: 42.3% 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.0% 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 -3800000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 5 \cdot 10^{-35}:\\ \;\;\;\;\left(c \cdot y\right) \cdot \mathsf{expm1}\left(x \cdot 1\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 -3800000.0)
     t_0
     (if (<= y 5e-35) (* (* c y) (expm1 (* x 1.0))) t_0))))

C

double code(double c, double x, double y) {
	double t_0 = c * log1p((expm1(x) * y));
	double tmp;
	if (y <= -3800000.0) {
		tmp = t_0;
	} else if (y <= 5e-35) {
		tmp = (c * y) * expm1((x * 1.0));
	} 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 <= -3800000.0) {
		tmp = t_0;
	} else if (y <= 5e-35) {
		tmp = (c * y) * Math.expm1((x * 1.0));
	} 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 <= -3800000.0:
		tmp = t_0
	elif y <= 5e-35:
		tmp = (c * y) * math.expm1((x * 1.0))
	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 <= -3800000.0)
		tmp = t_0;
	elseif (y <= 5e-35)
		tmp = Float64(Float64(c * y) * expm1(Float64(x * 1.0)));
	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, -3800000.0], t$95$0, If[LessEqual[y, 5e-35], N[(N[(c * y), $MachinePrecision] * N[(Exp[N[(x * 1.0), $MachinePrecision]] - 1), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -3.8e6 or 4.99999999999999964e-35 < y

   1. Initial program 42.3%

      \[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. *-commutative N/A

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

      14. log-E N/A

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

      15. lower-expm1.f64 N/A

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

      16. log-E N/A

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

      17. lower-*.f64 93.8

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

   3. Applied rewrites 93.8%

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

      1. lift-*.f64 N/A

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

      2. *-rgt-identity 93.8

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

   5. Applied rewrites 93.8%

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

   if -3.8e6 < y < 4.99999999999999964e-35

   1. Initial program 42.3%

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

   2. Taylor expanded in y around 0

      \[\leadsto \color{blue}{c \cdot \left(y \cdot \left({\mathsf{E}\left(\right)}^{x} - 1\right)\right)} \]
   3. 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. lower-*.f64 N/A

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

      4. e-exp-1 N/A

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

      5. pow-exp N/A

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

      6. *-commutative N/A

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

      7. log-E N/A

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

      8. lower-expm1.f64 N/A

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

      9. log-E N/A

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

      10. lower-*.f64 77.1

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

   4. Applied rewrites 77.1%

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

Alternative 2: 92.2% accurate, 1.3× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.65 \cdot 10^{+36}:\\ \;\;\;\;\log \left(\mathsf{fma}\left(\mathsf{expm1}\left(x\right), y, 1\right)\right) \cdot c\\ \mathbf{elif}\;y \leq 2.15 \cdot 10^{+24}:\\ \;\;\;\;\left(c \cdot y\right) \cdot \mathsf{expm1}\left(x \cdot 1\right)\\ \mathbf{else}:\\ \;\;\;\;c \cdot \mathsf{log1p}\left(x \cdot y\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (c x y)
 :precision binary64
 (if (<= y -1.65e+36)
   (* (log (fma (expm1 x) y 1.0)) c)
   (if (<= y 2.15e+24) (* (* c y) (expm1 (* x 1.0))) (* c (log1p (* x y))))))

C

double code(double c, double x, double y) {
	double tmp;
	if (y <= -1.65e+36) {
		tmp = log(fma(expm1(x), y, 1.0)) * c;
	} else if (y <= 2.15e+24) {
		tmp = (c * y) * expm1((x * 1.0));
	} else {
		tmp = c * log1p((x * y));
	}
	return tmp;
}

Julia

function code(c, x, y)
	tmp = 0.0
	if (y <= -1.65e+36)
		tmp = Float64(log(fma(expm1(x), y, 1.0)) * c);
	elseif (y <= 2.15e+24)
		tmp = Float64(Float64(c * y) * expm1(Float64(x * 1.0)));
	else
		tmp = Float64(c * log1p(Float64(x * y)));
	end
	return tmp
end

Wolfram

code[c_, x_, y_] := If[LessEqual[y, -1.65e+36], N[(N[Log[N[(N[(Exp[x] - 1), $MachinePrecision] * y + 1.0), $MachinePrecision]], $MachinePrecision] * c), $MachinePrecision], If[LessEqual[y, 2.15e+24], N[(N[(c * y), $MachinePrecision] * N[(Exp[N[(x * 1.0), $MachinePrecision]] - 1), $MachinePrecision]), $MachinePrecision], N[(c * N[Log[1 + N[(x * y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.6499999999999999e36

   1. Initial program 42.3%

      \[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.9%

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

      1. lift-*.f64 N/A

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

      2. *-rgt-identity 51.9

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

   5. Applied rewrites 51.9%

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

   if -1.6499999999999999e36 < y < 2.14999999999999994e24

   1. Initial program 42.3%

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

   2. Taylor expanded in y around 0

      \[\leadsto \color{blue}{c \cdot \left(y \cdot \left({\mathsf{E}\left(\right)}^{x} - 1\right)\right)} \]
   3. 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. lower-*.f64 N/A

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

      4. e-exp-1 N/A

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

      5. pow-exp N/A

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

      6. *-commutative N/A

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

      7. log-E N/A

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

      8. lower-expm1.f64 N/A

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

      9. log-E N/A

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

      10. lower-*.f64 77.1

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

   4. Applied rewrites 77.1%

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

   if 2.14999999999999994e24 < y

   1. Initial program 42.3%

      \[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. *-commutative N/A

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

      14. log-E N/A

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

      15. lower-expm1.f64 N/A

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

      16. log-E N/A

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

      17. lower-*.f64 93.8

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

   3. Applied rewrites 93.8%

      \[\leadsto c \cdot \color{blue}{\mathsf{log1p}\left(\mathsf{expm1}\left(x \cdot 1\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.1%

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

Alternative 3: 89.6% 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 -3800000:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;y \leq 2.15 \cdot 10^{+24}:\\ \;\;\;\;\left(c \cdot y\right) \cdot \mathsf{expm1}\left(x \cdot 1\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 -3800000.0)
     t_0
     (if (<= y 2.15e+24) (* (* c y) (expm1 (* x 1.0))) t_0))))

C

double code(double c, double x, double y) {
	double t_0 = c * log1p((x * y));
	double tmp;
	if (y <= -3800000.0) {
		tmp = t_0;
	} else if (y <= 2.15e+24) {
		tmp = (c * y) * expm1((x * 1.0));
	} 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 <= -3800000.0) {
		tmp = t_0;
	} else if (y <= 2.15e+24) {
		tmp = (c * y) * Math.expm1((x * 1.0));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Python

def code(c, x, y):
	t_0 = c * math.log1p((x * y))
	tmp = 0
	if y <= -3800000.0:
		tmp = t_0
	elif y <= 2.15e+24:
		tmp = (c * y) * math.expm1((x * 1.0))
	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 <= -3800000.0)
		tmp = t_0;
	elseif (y <= 2.15e+24)
		tmp = Float64(Float64(c * y) * expm1(Float64(x * 1.0)));
	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, -3800000.0], t$95$0, If[LessEqual[y, 2.15e+24], N[(N[(c * y), $MachinePrecision] * N[(Exp[N[(x * 1.0), $MachinePrecision]] - 1), $MachinePrecision]), $MachinePrecision], t$95$0]]]

Derivation

1. Split input into 2 regimes

2. if y < -3.8e6 or 2.14999999999999994e24 < y

   1. Initial program 42.3%

      \[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. *-commutative N/A

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

      14. log-E N/A

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

      15. lower-expm1.f64 N/A

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

      16. log-E N/A

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

      17. lower-*.f64 93.8

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

   3. Applied rewrites 93.8%

      \[\leadsto c \cdot \color{blue}{\mathsf{log1p}\left(\mathsf{expm1}\left(x \cdot 1\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.1%

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

   if -3.8e6 < y < 2.14999999999999994e24

   1. Initial program 42.3%

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

   2. Taylor expanded in y around 0

      \[\leadsto \color{blue}{c \cdot \left(y \cdot \left({\mathsf{E}\left(\right)}^{x} - 1\right)\right)} \]
   3. 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. lower-*.f64 N/A

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

      4. e-exp-1 N/A

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

      5. pow-exp N/A

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

      6. *-commutative N/A

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

      7. log-E N/A

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

      8. lower-expm1.f64 N/A

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

      9. log-E N/A

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

      10. lower-*.f64 77.1

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

   4. Applied rewrites 77.1%

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

Alternative 4: 81.7% accurate, 1.4× speedup

Math

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

FPCore

(FPCore (c x y)
 :precision binary64
 (let* ((t_0 (* (log (fma x y 1.0)) c)))
   (if (<= y -7.5e+126)
     t_0
     (if (<= y 7.4e+168) (* (* c y) (expm1 (* x 1.0))) t_0))))

C

double code(double c, double x, double y) {
	double t_0 = log(fma(x, y, 1.0)) * c;
	double tmp;
	if (y <= -7.5e+126) {
		tmp = t_0;
	} else if (y <= 7.4e+168) {
		tmp = (c * y) * expm1((x * 1.0));
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(c, x, y)
	t_0 = Float64(log(fma(x, y, 1.0)) * c)
	tmp = 0.0
	if (y <= -7.5e+126)
		tmp = t_0;
	elseif (y <= 7.4e+168)
		tmp = Float64(Float64(c * y) * expm1(Float64(x * 1.0)));
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -7.5000000000000006e126 or 7.40000000000000018e168 < y

   1. Initial program 42.3%

      \[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.9%

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

   4. Taylor expanded in x around 0

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

   6. Applied rewrites 40.3%

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

   if -7.5000000000000006e126 < y < 7.40000000000000018e168

   1. Initial program 42.3%

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

   2. Taylor expanded in y around 0

      \[\leadsto \color{blue}{c \cdot \left(y \cdot \left({\mathsf{E}\left(\right)}^{x} - 1\right)\right)} \]
   3. 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. lower-*.f64 N/A

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

      4. e-exp-1 N/A

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

      5. pow-exp N/A

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

      6. *-commutative N/A

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

      7. log-E N/A

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

      8. lower-expm1.f64 N/A

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

      9. log-E N/A

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

      10. lower-*.f64 77.1

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

   4. Applied rewrites 77.1%

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

Alternative 5: 76.7% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;{e}^{x} \leq 4 \cdot 10^{-176}:\\ \;\;\;\;c \cdot \left(\mathsf{expm1}\left(x\right) \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(y \cdot x, 0.5, y\right) \cdot c\right) \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (c x y)
 :precision binary64
 (if (<= (pow E x) 4e-176)
   (* c (* (expm1 x) y))
   (* (* (fma (* y x) 0.5 y) c) x)))

C

double code(double c, double x, double y) {
	double tmp;
	if (pow(((double) M_E), x) <= 4e-176) {
		tmp = c * (expm1(x) * y);
	} else {
		tmp = (fma((y * x), 0.5, y) * c) * x;
	}
	return tmp;
}

Julia

function code(c, x, y)
	tmp = 0.0
	if ((exp(1) ^ x) <= 4e-176)
		tmp = Float64(c * Float64(expm1(x) * y));
	else
		tmp = Float64(Float64(fma(Float64(y * x), 0.5, y) * c) * x);
	end
	return tmp
end

Wolfram

code[c_, x_, y_] := If[LessEqual[N[Power[E, x], $MachinePrecision], 4e-176], N[(c * N[(N[(Exp[x] - 1), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision], N[(N[(N[(N[(y * x), $MachinePrecision] * 0.5 + y), $MachinePrecision] * c), $MachinePrecision] * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (pow.f64 (E.f64) x) < 4e-176

   1. Initial program 42.3%

      \[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}{1} \]
   3. Step-by-step derivation

   4. Applied rewrites 31.1%

      \[\leadsto c \cdot \log \color{blue}{1} \]

   5. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. e-exp-1 N/A

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

      3. pow-exp N/A

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

      4. *-commutative N/A

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

      5. lift-*.f64 N/A

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

      6. lift-expm1.f64 N/A

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

      7. lift-*.f64 74.2

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

      8. lift-*.f64 N/A

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

      9. *-rgt-identity 74.2

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

   7. Applied rewrites 74.2%

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

   if 4e-176 < (pow.f64 (E.f64) x)

   1. Initial program 42.3%

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

   2. Taylor expanded in y around 0

      \[\leadsto \color{blue}{c \cdot \left(y \cdot \left({\mathsf{E}\left(\right)}^{x} - 1\right)\right)} \]
   3. 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. lower-*.f64 N/A

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

      4. e-exp-1 N/A

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

      5. pow-exp N/A

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

      6. *-commutative N/A

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

      7. log-E N/A

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

      8. lower-expm1.f64 N/A

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

      9. log-E N/A

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

      10. lower-*.f64 77.1

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

   4. Applied rewrites 77.1%

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

   5. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(c \cdot \left(x \cdot y\right), \frac{1}{2}, c \cdot y\right) \cdot x \]

      5. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\left(x \cdot y\right) \cdot c, \frac{1}{2}, c \cdot y\right) \cdot x \]

      6. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\left(x \cdot y\right) \cdot c, \frac{1}{2}, c \cdot y\right) \cdot x \]

      7. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\left(y \cdot x\right) \cdot c, \frac{1}{2}, c \cdot y\right) \cdot x \]

      8. lower-*.f64 N/A

         \[\leadsto \mathsf{fma}\left(\left(y \cdot x\right) \cdot c, \frac{1}{2}, c \cdot y\right) \cdot x \]

      9. *-commutative N/A

         \[\leadsto \mathsf{fma}\left(\left(y \cdot x\right) \cdot c, \frac{1}{2}, y \cdot c\right) \cdot x \]

      10. lower-*.f64 58.0

          \[\leadsto \mathsf{fma}\left(\left(y \cdot x\right) \cdot c, 0.5, y \cdot c\right) \cdot x \]

   7. Applied rewrites 58.0%

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

   8. Taylor expanded in c around 0

      \[\leadsto \left(c \cdot \left(y + \frac{1}{2} \cdot \left(x \cdot y\right)\right)\right) \cdot x \]
   9. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. *-commutative N/A

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

      4. lift-*.f64 N/A

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

      5. *-commutative N/A

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

      6. +-commutative N/A

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

      7. lift-fma.f64 58.1

         \[\leadsto \left(\mathsf{fma}\left(y \cdot x, 0.5, y\right) \cdot c\right) \cdot x \]

   10. Applied rewrites 58.1%

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

Alternative 6: 76.6% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -9 \cdot 10^{-24}:\\ \;\;\;\;c \cdot \left(\mathsf{expm1}\left(x\right) \cdot y\right)\\ \mathbf{else}:\\ \;\;\;\;\left(c \cdot y\right) \cdot x\\ \end{array} \end{array} \]

FPCore

(FPCore (c x y)
 :precision binary64
 (if (<= x -9e-24) (* c (* (expm1 x) y)) (* (* c y) x)))

C

double code(double c, double x, double y) {
	double tmp;
	if (x <= -9e-24) {
		tmp = c * (expm1(x) * y);
	} else {
		tmp = (c * y) * x;
	}
	return tmp;
}

Java

public static double code(double c, double x, double y) {
	double tmp;
	if (x <= -9e-24) {
		tmp = c * (Math.expm1(x) * y);
	} else {
		tmp = (c * y) * x;
	}
	return tmp;
}

Python

def code(c, x, y):
	tmp = 0
	if x <= -9e-24:
		tmp = c * (math.expm1(x) * y)
	else:
		tmp = (c * y) * x
	return tmp

Julia

function code(c, x, y)
	tmp = 0.0
	if (x <= -9e-24)
		tmp = Float64(c * Float64(expm1(x) * y));
	else
		tmp = Float64(Float64(c * y) * x);
	end
	return tmp
end

Wolfram

code[c_, x_, y_] := If[LessEqual[x, -9e-24], N[(c * N[(N[(Exp[x] - 1), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision], N[(N[(c * y), $MachinePrecision] * x), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -8.9999999999999995e-24

   1. Initial program 42.3%

      \[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}{1} \]
   3. Step-by-step derivation

   4. Applied rewrites 31.1%

      \[\leadsto c \cdot \log \color{blue}{1} \]

   5. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. e-exp-1 N/A

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

      3. pow-exp N/A

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

      4. *-commutative N/A

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

      5. lift-*.f64 N/A

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

      6. lift-expm1.f64 N/A

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

      7. lift-*.f64 74.2

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

      8. lift-*.f64 N/A

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

      9. *-rgt-identity 74.2

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

   7. Applied rewrites 74.2%

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

   if -8.9999999999999995e-24 < x

   1. Initial program 42.3%

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

   2. Taylor expanded in y around 0

      \[\leadsto \color{blue}{c \cdot \left(y \cdot \left({\mathsf{E}\left(\right)}^{x} - 1\right)\right)} \]
   3. 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. lower-*.f64 N/A

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

      4. e-exp-1 N/A

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

      5. pow-exp N/A

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

      6. *-commutative N/A

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

      7. log-E N/A

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

      8. lower-expm1.f64 N/A

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

      9. log-E N/A

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

      10. lower-*.f64 77.1

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

   4. Applied rewrites 77.1%

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

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 61.8%

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

Alternative 7: 61.8% accurate, 4.9× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

MATLAB

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

Wolfram

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

Derivation

1. Initial program 42.3%

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

2. Taylor expanded in y around 0

   \[\leadsto \color{blue}{c \cdot \left(y \cdot \left({\mathsf{E}\left(\right)}^{x} - 1\right)\right)} \]
3. 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. lower-*.f64 N/A

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

   4. e-exp-1 N/A

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

   5. pow-exp N/A

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

   6. *-commutative N/A

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

   7. log-E N/A

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

   8. lower-expm1.f64 N/A

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

   9. log-E N/A

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

   10. lower-*.f64 77.1

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

4. Applied rewrites 77.1%

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

5. Taylor expanded in x around 0

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

7. Applied rewrites 61.8%

   \[\leadsto \left(c \cdot y\right) \cdot x \]
8. Add Preprocessing

Developer Target 1: 93.8% 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 2025132 
(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)))))