Logarithmic Transform

Percentage Accurate: 41.0% → 97.9%

Time: 31.4s

Alternatives: 7

Speedup: 19.8×

• Could not converge on a ground truth

  1. c = -3.788175383512912e+128
  2. x = 2.5978278322004557e+66
  3. y = 2.2534844866017475e-298

Specification

Math

\[\begin{array}{l} \\ c \cdot \log \left(1 + \left({\mathsf{E}\left(\right)}^{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)))))

Initial Program: 41.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ c \cdot \log \left(1 + \left({\mathsf{E}\left(\right)}^{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)))))

Alternative 1: 97.9% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -116000 \lor \neg \left(y \leq 1.52 \cdot 10^{-148}\right):\\ \;\;\;\;\mathsf{log1p}\left(y \cdot \mathsf{expm1}\left(x\right)\right) \cdot c\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{expm1}\left(x\right) \cdot c\right) \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (c x y)
 :precision binary64
 (if (or (<= y -116000.0) (not (<= y 1.52e-148)))
   (* (log1p (* y (expm1 x))) c)
   (* (* (expm1 x) c) y)))

C

double code(double c, double x, double y) {
	double tmp;
	if ((y <= -116000.0) || !(y <= 1.52e-148)) {
		tmp = log1p((y * expm1(x))) * c;
	} else {
		tmp = (expm1(x) * c) * y;
	}
	return tmp;
}

Java

public static double code(double c, double x, double y) {
	double tmp;
	if ((y <= -116000.0) || !(y <= 1.52e-148)) {
		tmp = Math.log1p((y * Math.expm1(x))) * c;
	} else {
		tmp = (Math.expm1(x) * c) * y;
	}
	return tmp;
}

Python

def code(c, x, y):
	tmp = 0
	if (y <= -116000.0) or not (y <= 1.52e-148):
		tmp = math.log1p((y * math.expm1(x))) * c
	else:
		tmp = (math.expm1(x) * c) * y
	return tmp

Julia

function code(c, x, y)
	tmp = 0.0
	if ((y <= -116000.0) || !(y <= 1.52e-148))
		tmp = Float64(log1p(Float64(y * expm1(x))) * c);
	else
		tmp = Float64(Float64(expm1(x) * c) * y);
	end
	return tmp
end

Wolfram

code[c_, x_, y_] := If[Or[LessEqual[y, -116000.0], N[Not[LessEqual[y, 1.52e-148]], $MachinePrecision]], N[(N[Log[1 + N[(y * N[(Exp[x] - 1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c), $MachinePrecision], N[(N[(N[(Exp[x] - 1), $MachinePrecision] * c), $MachinePrecision] * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -116000 or 1.52000000000000002e-148 < y

   1. Initial program 36.3%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 36.3

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

   4. Applied rewrites 99.7%

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

   if -116000 < y < 1.52000000000000002e-148

   1. Initial program 51.3%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 51.3

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

   4. Applied rewrites 90.5%

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

   5. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-expm1.f64 99.9

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

   7. Applied rewrites 99.9%

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

4. Final simplification 99.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -116000 \lor \neg \left(y \leq 1.52 \cdot 10^{-148}\right):\\ \;\;\;\;\mathsf{log1p}\left(y \cdot \mathsf{expm1}\left(x\right)\right) \cdot c\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{expm1}\left(x\right) \cdot c\right) \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 2: 89.3% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -3.6 \cdot 10^{+20} \lor \neg \left(y \leq 7400000\right):\\ \;\;\;\;\mathsf{log1p}\left(y \cdot \left(\mathsf{fma}\left(0.5, x, 1\right) \cdot x\right)\right) \cdot c\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{expm1}\left(x\right) \cdot c\right) \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (c x y)
 :precision binary64
 (if (or (<= y -3.6e+20) (not (<= y 7400000.0)))
   (* (log1p (* y (* (fma 0.5 x 1.0) x))) c)
   (* (* (expm1 x) c) y)))

C

double code(double c, double x, double y) {
	double tmp;
	if ((y <= -3.6e+20) || !(y <= 7400000.0)) {
		tmp = log1p((y * (fma(0.5, x, 1.0) * x))) * c;
	} else {
		tmp = (expm1(x) * c) * y;
	}
	return tmp;
}

Julia

function code(c, x, y)
	tmp = 0.0
	if ((y <= -3.6e+20) || !(y <= 7400000.0))
		tmp = Float64(log1p(Float64(y * Float64(fma(0.5, x, 1.0) * x))) * c);
	else
		tmp = Float64(Float64(expm1(x) * c) * y);
	end
	return tmp
end

Wolfram

code[c_, x_, y_] := If[Or[LessEqual[y, -3.6e+20], N[Not[LessEqual[y, 7400000.0]], $MachinePrecision]], N[(N[Log[1 + N[(y * N[(N[(0.5 * x + 1.0), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c), $MachinePrecision], N[(N[(N[(Exp[x] - 1), $MachinePrecision] * c), $MachinePrecision] * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -3.6e20 or 7.4e6 < y

   1. Initial program 36.4%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 36.4

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

   4. Applied rewrites 99.7%

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

   5. Taylor expanded in x around 0

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

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. lower-fma.f64 74.1

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

   7. Applied rewrites 74.1%

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

   if -3.6e20 < y < 7.4e6

   1. Initial program 48.1%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 48.1

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

   4. Applied rewrites 92.5%

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

   5. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-expm1.f64 97.9

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

   7. Applied rewrites 97.9%

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

4. Final simplification 88.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -3.6 \cdot 10^{+20} \lor \neg \left(y \leq 7400000\right):\\ \;\;\;\;\mathsf{log1p}\left(y \cdot \left(\mathsf{fma}\left(0.5, x, 1\right) \cdot x\right)\right) \cdot c\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{expm1}\left(x\right) \cdot c\right) \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 3: 82.1% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.2 \cdot 10^{+144} \lor \neg \left(y \leq 10^{+186}\right):\\ \;\;\;\;c \cdot \log \left(\mathsf{fma}\left(y, x, 1\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{expm1}\left(x\right) \cdot c\right) \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (c x y)
 :precision binary64
 (if (or (<= y -1.2e+144) (not (<= y 1e+186)))
   (* c (log (fma y x 1.0)))
   (* (* (expm1 x) c) y)))

C

double code(double c, double x, double y) {
	double tmp;
	if ((y <= -1.2e+144) || !(y <= 1e+186)) {
		tmp = c * log(fma(y, x, 1.0));
	} else {
		tmp = (expm1(x) * c) * y;
	}
	return tmp;
}

Julia

function code(c, x, y)
	tmp = 0.0
	if ((y <= -1.2e+144) || !(y <= 1e+186))
		tmp = Float64(c * log(fma(y, x, 1.0)));
	else
		tmp = Float64(Float64(expm1(x) * c) * y);
	end
	return tmp
end

Wolfram

code[c_, x_, y_] := If[Or[LessEqual[y, -1.2e+144], N[Not[LessEqual[y, 1e+186]], $MachinePrecision]], N[(c * N[Log[N[(y * x + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision], N[(N[(N[(Exp[x] - 1), $MachinePrecision] * c), $MachinePrecision] * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1.2e144 or 9.9999999999999998e185 < y

   1. Initial program 39.6%

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

   3. 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)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. log-E N/A

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

      3. metadata-eval N/A

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

      4. log-E N/A

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

      5. associate-*r* N/A

         \[\leadsto c \cdot \log \left(\color{blue}{\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 {\color{blue}{1}}^{2} + 1\right) \]

      7. metadata-eval N/A

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

      8. *-rgt-identity N/A

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

      9. *-commutative N/A

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

      10. lower-fma.f64 56.0

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

   5. Applied rewrites 56.0%

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

   if -1.2e144 < y < 9.9999999999999998e185

   1. Initial program 44.3%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 44.3

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

   4. Applied rewrites 94.3%

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

   5. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-expm1.f64 88.2

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

   7. Applied rewrites 88.2%

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

4. Final simplification 82.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.2 \cdot 10^{+144} \lor \neg \left(y \leq 10^{+186}\right):\\ \;\;\;\;c \cdot \log \left(\mathsf{fma}\left(y, x, 1\right)\right)\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{expm1}\left(x\right) \cdot c\right) \cdot y\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 78.9% accurate, 1.9× speedup

Math

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

FPCore

(FPCore (c x y)
 :precision binary64
 (if (<= y 7400000.0) (* (* (expm1 x) c) y) (* c (* y x))))

C

double code(double c, double x, double y) {
	double tmp;
	if (y <= 7400000.0) {
		tmp = (expm1(x) * c) * y;
	} else {
		tmp = c * (y * x);
	}
	return tmp;
}

Java

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < 7.4e6

   1. Initial program 48.9%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 48.9

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

   4. Applied rewrites 94.6%

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

   5. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-expm1.f64 78.6

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

   7. Applied rewrites 78.6%

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

   if 7.4e6 < y

   1. Initial program 10.2%

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

   3. Taylor expanded in x around 0

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

      1. log-E N/A

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

      2. metadata-eval N/A

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

      3. log-E N/A

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

      4. associate-*r* N/A

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

      5. log-E N/A

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

      6. metadata-eval N/A

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

      7. *-rgt-identity N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 57.9

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

   5. Applied rewrites 57.9%

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

Alternative 5: 63.7% accurate, 6.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;c \leq 0.027:\\ \;\;\;\;\left(c \cdot y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\left(\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, x, 0.5\right), x, 1\right) \cdot x\right) \cdot c\right) \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (c x y)
 :precision binary64
 (if (<= c 0.027)
   (* (* c y) x)
   (* (* (* (fma (fma 0.16666666666666666 x 0.5) x 1.0) x) c) y)))

C

double code(double c, double x, double y) {
	double tmp;
	if (c <= 0.027) {
		tmp = (c * y) * x;
	} else {
		tmp = ((fma(fma(0.16666666666666666, x, 0.5), x, 1.0) * x) * c) * y;
	}
	return tmp;
}

Julia

function code(c, x, y)
	tmp = 0.0
	if (c <= 0.027)
		tmp = Float64(Float64(c * y) * x);
	else
		tmp = Float64(Float64(Float64(fma(fma(0.16666666666666666, x, 0.5), x, 1.0) * x) * c) * y);
	end
	return tmp
end

Wolfram

code[c_, x_, y_] := If[LessEqual[c, 0.027], N[(N[(c * y), $MachinePrecision] * x), $MachinePrecision], N[(N[(N[(N[(N[(0.16666666666666666 * x + 0.5), $MachinePrecision] * x + 1.0), $MachinePrecision] * x), $MachinePrecision] * c), $MachinePrecision] * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if c < 0.0269999999999999997

   1. Initial program 47.5%

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

   3. Taylor expanded in x around 0

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

      1. associate-*r* N/A

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

      2. log-E N/A

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

      3. *-rgt-identity N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. *-rgt-identity N/A

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

      8. metadata-eval N/A

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

      9. log-E N/A

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

      10. log-E N/A

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

      11. metadata-eval N/A

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

      12. log-E N/A

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

      13. lower-*.f64 N/A

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

      14. log-E N/A

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

      15. *-rgt-identity N/A

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

      16. lower-*.f64 61.6

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

   5. Applied rewrites 61.6%

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

   if 0.0269999999999999997 < c

   1. Initial program 28.2%

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

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 28.2

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

   4. Applied rewrites 94.9%

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

   5. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower-expm1.f64 74.6

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

   7. Applied rewrites 74.6%

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

   8. Taylor expanded in x around 0

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

   10. Applied rewrites 59.4%

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

Alternative 6: 63.6% accurate, 12.8× speedup

Math

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

FPCore

(FPCore (c x y)
 :precision binary64
 (if (<= c 1e-13) (* (* c y) x) (* (* x c) y)))

C

double code(double c, double x, double y) {
	double tmp;
	if (c <= 1e-13) {
		tmp = (c * y) * x;
	} else {
		tmp = (x * c) * y;
	}
	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 <= 1d-13) then
        tmp = (c * y) * x
    else
        tmp = (x * c) * y
    end if
    code = tmp
end function

Java

public static double code(double c, double x, double y) {
	double tmp;
	if (c <= 1e-13) {
		tmp = (c * y) * x;
	} else {
		tmp = (x * c) * y;
	}
	return tmp;
}

Python

def code(c, x, y):
	tmp = 0
	if c <= 1e-13:
		tmp = (c * y) * x
	else:
		tmp = (x * c) * y
	return tmp

Julia

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

MATLAB

function tmp_2 = code(c, x, y)
	tmp = 0.0;
	if (c <= 1e-13)
		tmp = (c * y) * x;
	else
		tmp = (x * c) * y;
	end
	tmp_2 = tmp;
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if c < 1e-13

   1. Initial program 47.3%

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

   3. Taylor expanded in x around 0

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

      1. associate-*r* N/A

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

      2. log-E N/A

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

      3. *-rgt-identity N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. *-rgt-identity N/A

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

      8. metadata-eval N/A

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

      9. log-E N/A

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

      10. log-E N/A

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

      11. metadata-eval N/A

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

      12. log-E N/A

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

      13. lower-*.f64 N/A

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

      14. log-E N/A

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

      15. *-rgt-identity N/A

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

      16. lower-*.f64 61.9

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

   5. Applied rewrites 61.9%

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

   if 1e-13 < c

   1. Initial program 29.5%

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

   3. Taylor expanded in x around 0

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

      1. associate-*r* N/A

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

      2. log-E N/A

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

      3. *-rgt-identity N/A

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

      4. *-commutative N/A

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

      5. associate-*l* N/A

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

      6. *-commutative N/A

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

      7. *-rgt-identity N/A

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

      8. metadata-eval N/A

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

      9. log-E N/A

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

      10. log-E N/A

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

      11. metadata-eval N/A

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

      12. log-E N/A

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

      13. lower-*.f64 N/A

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

      14. log-E N/A

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

      15. *-rgt-identity N/A

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

      16. lower-*.f64 51.5

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

   5. Applied rewrites 51.5%

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

   7. Applied rewrites 58.4%

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

Alternative 7: 61.9% accurate, 19.8× 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 43.4%

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

3. Taylor expanded in x around 0

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

   1. associate-*r* N/A

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

   2. log-E N/A

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

   3. *-rgt-identity N/A

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

   4. *-commutative N/A

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

   5. associate-*l* N/A

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

   6. *-commutative N/A

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

   7. *-rgt-identity N/A

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

   8. metadata-eval N/A

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

   9. log-E N/A

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

   10. log-E N/A

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

   11. metadata-eval N/A

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

   12. log-E N/A

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

   13. lower-*.f64 N/A

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

   14. log-E N/A

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

   15. *-rgt-identity N/A

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

   16. lower-*.f64 59.7

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

5. Applied rewrites 59.7%

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

Developer Target 1: 93.2% accurate, 1.0× 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 2024346 
(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)))))