Logarithmic Transform

Percentage Accurate: 40.6% → 99.1%

Time: 33.7s

Alternatives: 10

Speedup: 19.8×

• Could not converge on a ground truth

  1. c = -3.326145414417726e+101
  2. x = 5.558843346793782e+107
  3. y = 2.7101801777995755e+55

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: 40.6% 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: 99.1% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.6 \cdot 10^{-65} \lor \neg \left(y \leq 9.5 \cdot 10^{-62}\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 -1.6e-65) (not (<= y 9.5e-62)))
   (* (log1p (* y (expm1 x))) c)
   (* (* (expm1 x) c) y)))

C

double code(double c, double x, double y) {
	double tmp;
	if ((y <= -1.6e-65) || !(y <= 9.5e-62)) {
		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 <= -1.6e-65) || !(y <= 9.5e-62)) {
		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 <= -1.6e-65) or not (y <= 9.5e-62):
		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 <= -1.6e-65) || !(y <= 9.5e-62))
		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, -1.6e-65], N[Not[LessEqual[y, 9.5e-62]], $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 < -1.6e-65 or 9.49999999999999951e-62 < y

   1. Initial program 40.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 40.3

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

   4. Applied rewrites 99.0%

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

   if -1.6e-65 < y < 9.49999999999999951e-62

   1. Initial program 49.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 49.2

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

   4. Applied rewrites 86.0%

      \[\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.8

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

   7. Applied rewrites 99.8%

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.6 \cdot 10^{-65} \lor \neg \left(y \leq 9.5 \cdot 10^{-62}\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.0% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -4.9 \cdot 10^{+27}:\\ \;\;\;\;\mathsf{log1p}\left(y \cdot \left(\mathsf{fma}\left(0.16666666666666666 \cdot x, x, 1\right) \cdot x\right)\right) \cdot c\\ \mathbf{elif}\;y \leq 1.25 \cdot 10^{-16}:\\ \;\;\;\;\left(\mathsf{expm1}\left(x\right) \cdot c\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;\mathsf{log1p}\left(y \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right), x, 0.5\right), x, 1\right) \cdot x\right)\right) \cdot c\\ \end{array} \end{array} \]

FPCore

(FPCore (c x y)
 :precision binary64
 (if (<= y -4.9e+27)
   (* (log1p (* y (* (fma (* 0.16666666666666666 x) x 1.0) x))) c)
   (if (<= y 1.25e-16)
     (* (* (expm1 x) c) y)
     (*
      (log1p
       (*
        y
        (*
         (fma
          (fma (fma 0.041666666666666664 x 0.16666666666666666) x 0.5)
          x
          1.0)
         x)))
      c))))

C

double code(double c, double x, double y) {
	double tmp;
	if (y <= -4.9e+27) {
		tmp = log1p((y * (fma((0.16666666666666666 * x), x, 1.0) * x))) * c;
	} else if (y <= 1.25e-16) {
		tmp = (expm1(x) * c) * y;
	} else {
		tmp = log1p((y * (fma(fma(fma(0.041666666666666664, x, 0.16666666666666666), x, 0.5), x, 1.0) * x))) * c;
	}
	return tmp;
}

Julia

function code(c, x, y)
	tmp = 0.0
	if (y <= -4.9e+27)
		tmp = Float64(log1p(Float64(y * Float64(fma(Float64(0.16666666666666666 * x), x, 1.0) * x))) * c);
	elseif (y <= 1.25e-16)
		tmp = Float64(Float64(expm1(x) * c) * y);
	else
		tmp = Float64(log1p(Float64(y * Float64(fma(fma(fma(0.041666666666666664, x, 0.16666666666666666), x, 0.5), x, 1.0) * x))) * c);
	end
	return tmp
end

Wolfram

code[c_, x_, y_] := If[LessEqual[y, -4.9e+27], N[(N[Log[1 + N[(y * N[(N[(N[(0.16666666666666666 * x), $MachinePrecision] * x + 1.0), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c), $MachinePrecision], If[LessEqual[y, 1.25e-16], N[(N[(N[(Exp[x] - 1), $MachinePrecision] * c), $MachinePrecision] * y), $MachinePrecision], N[(N[Log[1 + N[(y * N[(N[(N[(N[(0.041666666666666664 * x + 0.16666666666666666), $MachinePrecision] * x + 0.5), $MachinePrecision] * x + 1.0), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -4.90000000000000015e27

   1. Initial program 60.5%

      \[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 60.5

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

   4. Applied rewrites 99.6%

      \[\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 + x \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot x\right)\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 + x \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot x\right)\right) \cdot x\right)}\right) \cdot c \]

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-fma.f64 50.9

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

   7. Applied rewrites 50.9%

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

   8. Taylor expanded in x around inf

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

   10. Applied rewrites 50.9%

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

   if -4.90000000000000015e27 < y < 1.2500000000000001e-16

   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 89.7%

      \[\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.2

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

   7. Applied rewrites 99.2%

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

   if 1.2500000000000001e-16 < y

   1. Initial program 26.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 26.3

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

   4. Applied rewrites 97.4%

      \[\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 + x \cdot \left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right)\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 + x \cdot \left(\frac{1}{2} + x \cdot \left(\frac{1}{6} + \frac{1}{24} \cdot x\right)\right)\right) \cdot x\right)}\right) \cdot c \]

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. +-commutative N/A

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

      7. *-commutative N/A

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

      8. lower-fma.f64 N/A

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

      9. +-commutative N/A

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

      10. lower-fma.f64 97.4

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

   7. Applied rewrites 97.4%

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

Alternative 3: 89.0% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -4.9 \cdot 10^{+27}:\\ \;\;\;\;\mathsf{log1p}\left(y \cdot \left(\mathsf{fma}\left(0.16666666666666666 \cdot x, x, 1\right) \cdot x\right)\right) \cdot c\\ \mathbf{elif}\;y \leq 1.25 \cdot 10^{-16}:\\ \;\;\;\;\left(\mathsf{expm1}\left(x\right) \cdot c\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;\mathsf{log1p}\left(y \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, x, 0.5\right), x, 1\right) \cdot x\right)\right) \cdot c\\ \end{array} \end{array} \]

FPCore

(FPCore (c x y)
 :precision binary64
 (if (<= y -4.9e+27)
   (* (log1p (* y (* (fma (* 0.16666666666666666 x) x 1.0) x))) c)
   (if (<= y 1.25e-16)
     (* (* (expm1 x) c) y)
     (* (log1p (* y (* (fma (fma 0.16666666666666666 x 0.5) x 1.0) x))) c))))

C

double code(double c, double x, double y) {
	double tmp;
	if (y <= -4.9e+27) {
		tmp = log1p((y * (fma((0.16666666666666666 * x), x, 1.0) * x))) * c;
	} else if (y <= 1.25e-16) {
		tmp = (expm1(x) * c) * y;
	} else {
		tmp = log1p((y * (fma(fma(0.16666666666666666, x, 0.5), x, 1.0) * x))) * c;
	}
	return tmp;
}

Julia

function code(c, x, y)
	tmp = 0.0
	if (y <= -4.9e+27)
		tmp = Float64(log1p(Float64(y * Float64(fma(Float64(0.16666666666666666 * x), x, 1.0) * x))) * c);
	elseif (y <= 1.25e-16)
		tmp = Float64(Float64(expm1(x) * c) * y);
	else
		tmp = Float64(log1p(Float64(y * Float64(fma(fma(0.16666666666666666, x, 0.5), x, 1.0) * x))) * c);
	end
	return tmp
end

Wolfram

code[c_, x_, y_] := If[LessEqual[y, -4.9e+27], N[(N[Log[1 + N[(y * N[(N[(N[(0.16666666666666666 * x), $MachinePrecision] * x + 1.0), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c), $MachinePrecision], If[LessEqual[y, 1.25e-16], N[(N[(N[(Exp[x] - 1), $MachinePrecision] * c), $MachinePrecision] * y), $MachinePrecision], N[(N[Log[1 + N[(y * N[(N[(N[(0.16666666666666666 * x + 0.5), $MachinePrecision] * x + 1.0), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -4.90000000000000015e27

   1. Initial program 60.5%

      \[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 60.5

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

   4. Applied rewrites 99.6%

      \[\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 + x \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot x\right)\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 + x \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot x\right)\right) \cdot x\right)}\right) \cdot c \]

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-fma.f64 50.9

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

   7. Applied rewrites 50.9%

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

   8. Taylor expanded in x around inf

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

   10. Applied rewrites 50.9%

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

   if -4.90000000000000015e27 < y < 1.2500000000000001e-16

   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 89.7%

      \[\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.2

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

   7. Applied rewrites 99.2%

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

   if 1.2500000000000001e-16 < y

   1. Initial program 26.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 26.3

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

   4. Applied rewrites 97.4%

      \[\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 + x \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot x\right)\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 + x \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot x\right)\right) \cdot x\right)}\right) \cdot c \]

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-fma.f64 97.0

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

   7. Applied rewrites 97.0%

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

Alternative 4: 87.5% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -3.5 \cdot 10^{+120} \lor \neg \left(y \leq 1.25 \cdot 10^{-16}\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.5e+120) (not (<= y 1.25e-16)))
   (* (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.5e+120) || !(y <= 1.25e-16)) {
		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.5e+120) || !(y <= 1.25e-16))
		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.5e+120], N[Not[LessEqual[y, 1.25e-16]], $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.50000000000000007e120 or 1.2500000000000001e-16 < 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. 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 39.6

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

   4. Applied rewrites 98.4%

      \[\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 75.0

         \[\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 75.0%

      \[\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.50000000000000007e120 < y < 1.2500000000000001e-16

   1. Initial program 46.5%

      \[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 46.5

         \[\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 94.8

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

   7. Applied rewrites 94.8%

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

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -3.5 \cdot 10^{+120} \lor \neg \left(y \leq 1.25 \cdot 10^{-16}\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 5: 89.0% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -4.9 \cdot 10^{+27}:\\ \;\;\;\;\mathsf{log1p}\left(y \cdot \left(\mathsf{fma}\left(0.16666666666666666 \cdot x, x, 1\right) \cdot x\right)\right) \cdot c\\ \mathbf{elif}\;y \leq 1.25 \cdot 10^{-16}:\\ \;\;\;\;\left(\mathsf{expm1}\left(x\right) \cdot c\right) \cdot y\\ \mathbf{else}:\\ \;\;\;\;\mathsf{log1p}\left(y \cdot \left(\mathsf{fma}\left(0.5, x, 1\right) \cdot x\right)\right) \cdot c\\ \end{array} \end{array} \]

FPCore

(FPCore (c x y)
 :precision binary64
 (if (<= y -4.9e+27)
   (* (log1p (* y (* (fma (* 0.16666666666666666 x) x 1.0) x))) c)
   (if (<= y 1.25e-16)
     (* (* (expm1 x) c) y)
     (* (log1p (* y (* (fma 0.5 x 1.0) x))) c))))

C

double code(double c, double x, double y) {
	double tmp;
	if (y <= -4.9e+27) {
		tmp = log1p((y * (fma((0.16666666666666666 * x), x, 1.0) * x))) * c;
	} else if (y <= 1.25e-16) {
		tmp = (expm1(x) * c) * y;
	} else {
		tmp = log1p((y * (fma(0.5, x, 1.0) * x))) * c;
	}
	return tmp;
}

Julia

function code(c, x, y)
	tmp = 0.0
	if (y <= -4.9e+27)
		tmp = Float64(log1p(Float64(y * Float64(fma(Float64(0.16666666666666666 * x), x, 1.0) * x))) * c);
	elseif (y <= 1.25e-16)
		tmp = Float64(Float64(expm1(x) * c) * y);
	else
		tmp = Float64(log1p(Float64(y * Float64(fma(0.5, x, 1.0) * x))) * c);
	end
	return tmp
end

Wolfram

code[c_, x_, y_] := If[LessEqual[y, -4.9e+27], N[(N[Log[1 + N[(y * N[(N[(N[(0.16666666666666666 * x), $MachinePrecision] * x + 1.0), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c), $MachinePrecision], If[LessEqual[y, 1.25e-16], N[(N[(N[(Exp[x] - 1), $MachinePrecision] * c), $MachinePrecision] * y), $MachinePrecision], N[(N[Log[1 + N[(y * N[(N[(0.5 * x + 1.0), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -4.90000000000000015e27

   1. Initial program 60.5%

      \[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 60.5

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

   4. Applied rewrites 99.6%

      \[\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 + x \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot x\right)\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 + x \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot x\right)\right) \cdot x\right)}\right) \cdot c \]

      2. lower-*.f64 N/A

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

      3. +-commutative N/A

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

      4. *-commutative N/A

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

      5. lower-fma.f64 N/A

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

      6. +-commutative N/A

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

      7. lower-fma.f64 50.9

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

   7. Applied rewrites 50.9%

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

   8. Taylor expanded in x around inf

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

   10. Applied rewrites 50.9%

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

   if -4.90000000000000015e27 < y < 1.2500000000000001e-16

   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 89.7%

      \[\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.2

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

   7. Applied rewrites 99.2%

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

   if 1.2500000000000001e-16 < y

   1. Initial program 26.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 26.3

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

   4. Applied rewrites 97.4%

      \[\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 96.7

         \[\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 96.7%

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

Alternative 6: 81.4% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -2.8 \cdot 10^{+165} \lor \neg \left(y \leq 6.2 \cdot 10^{+147}\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 -2.8e+165) (not (<= y 6.2e+147)))
   (* c (log (fma y x 1.0)))
   (* (* (expm1 x) c) y)))

C

double code(double c, double x, double y) {
	double tmp;
	if ((y <= -2.8e+165) || !(y <= 6.2e+147)) {
		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 <= -2.8e+165) || !(y <= 6.2e+147))
		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, -2.8e+165], N[Not[LessEqual[y, 6.2e+147]], $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 < -2.7999999999999998e165 or 6.2000000000000001e147 < y

   1. Initial program 41.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 \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 57.2

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

   5. Applied rewrites 57.2%

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

   if -2.7999999999999998e165 < y < 6.2000000000000001e147

   1. Initial program 45.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 45.2

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

   4. Applied rewrites 91.8%

      \[\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 91.1

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

   7. Applied rewrites 91.1%

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

4. Final simplification 84.5%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -2.8 \cdot 10^{+165} \lor \neg \left(y \leq 6.2 \cdot 10^{+147}\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 7: 76.3% accurate, 1.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;c \leq 10^{-29}:\\ \;\;\;\;c \cdot \left(\mathsf{expm1}\left(x\right) \cdot y\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 (<= c 1e-29) (* c (* (expm1 x) y)) (* (* (expm1 x) c) y)))

C

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

Java

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if c < 9.99999999999999943e-30

   1. Initial program 50.7%

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

   4. Applied rewrites 82.2%

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

   5. Taylor expanded in y around 0

      \[\leadsto c \cdot \color{blue}{\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. lower-*.f64 N/A

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

      3. lower-expm1.f64 75.6

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

   7. Applied rewrites 75.6%

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

   if 9.99999999999999943e-30 < c

   1. Initial program 26.6%

      \[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 26.6

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

   4. Applied rewrites 89.1%

      \[\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 75.2

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

   7. Applied rewrites 75.2%

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

Alternative 8: 76.5% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Initial program 44.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 44.4

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

4. Applied rewrites 92.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 76.7

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

7. Applied rewrites 76.7%

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

Alternative 9: 62.8% accurate, 12.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;c \leq 10^{-30}:\\ \;\;\;\;\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-30) (* (* c y) x) (* (* x c) y)))

C

double code(double c, double x, double y) {
	double tmp;
	if (c <= 1e-30) {
		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-30) 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-30) {
		tmp = (c * y) * x;
	} else {
		tmp = (x * c) * y;
	}
	return tmp;
}

Python

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

Julia

function code(c, x, y)
	tmp = 0.0
	if (c <= 1e-30)
		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-30)
		tmp = (c * y) * x;
	else
		tmp = (x * c) * y;
	end
	tmp_2 = tmp;
end

Wolfram

code[c_, x_, y_] := If[LessEqual[c, 1e-30], 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-30

   1. Initial program 50.7%

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

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

      4. *-lft-identity N/A

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

      5. *-commutative N/A

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

      6. associate-*l* N/A

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

      7. *-commutative N/A

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

      8. *-lft-identity N/A

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

      9. *-commutative N/A

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

      10. log-E N/A

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

      11. lower-*.f64 N/A

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

      12. log-E N/A

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

      13. metadata-eval N/A

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

      14. log-E N/A

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

      15. log-E N/A

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

      16. metadata-eval N/A

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

      17. *-rgt-identity N/A

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

      18. lower-*.f64 66.7

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

   5. Applied rewrites 66.7%

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

   if 1e-30 < c

   1. Initial program 26.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 \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. *-commutative N/A

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

      4. *-lft-identity N/A

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

      5. *-commutative N/A

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

      6. associate-*l* N/A

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

      7. *-commutative N/A

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

      8. *-lft-identity N/A

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

      9. *-commutative N/A

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

      10. log-E N/A

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

      11. lower-*.f64 N/A

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

      12. log-E N/A

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

      13. metadata-eval N/A

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

      14. log-E N/A

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

      15. log-E N/A

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

      16. metadata-eval N/A

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

      17. *-rgt-identity N/A

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

      18. lower-*.f64 50.1

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

   5. Applied rewrites 50.1%

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

   7. Applied rewrites 54.8%

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

Alternative 10: 61.4% 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 44.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. *-commutative N/A

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

   4. *-lft-identity N/A

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

   5. *-commutative N/A

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

   6. associate-*l* N/A

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

   7. *-commutative N/A

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

   8. *-lft-identity N/A

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

   9. *-commutative N/A

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

   10. log-E N/A

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

   11. lower-*.f64 N/A

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

   12. log-E N/A

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

   13. metadata-eval N/A

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

   14. log-E N/A

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

   15. log-E N/A

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

   16. metadata-eval N/A

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

   17. *-rgt-identity N/A

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

   18. lower-*.f64 62.3

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

5. Applied rewrites 62.3%

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

Developer Target 1: 93.6% 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 2024352 
(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)))))