Logarithmic Transform

Percentage Accurate: 41.6% → 98.8%

Time: 12.4s

Alternatives: 12

Speedup: 19.8×

• could not determine a ground truth

  1. c = -2.727583646264366e+224
  2. x = 2.0084124836055265e+24
  3. y = 5.778296671757233e+61

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.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: 98.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -9 \cdot 10^{-13}:\\ \;\;\;\;\mathsf{log1p}\left(y \cdot \mathsf{expm1}\left(x\right)\right) \cdot c\\ \mathbf{elif}\;y \leq 2.6 \cdot 10^{-18}:\\ \;\;\;\;\left(y \cdot c\right) \cdot \mathsf{expm1}\left(x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{log1p}\left(\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) \cdot y\right) \cdot c\\ \end{array} \end{array} \]

FPCore

(FPCore (c x y)
 :precision binary64
 (if (<= y -9e-13)
   (* (log1p (* y (expm1 x))) c)
   (if (<= y 2.6e-18)
     (* (* y c) (expm1 x))
     (*
      (log1p
       (*
        (*
         (fma
          (fma (fma 0.041666666666666664 x 0.16666666666666666) x 0.5)
          x
          1.0)
         x)
        y))
      c))))

C

double code(double c, double x, double y) {
	double tmp;
	if (y <= -9e-13) {
		tmp = log1p((y * expm1(x))) * c;
	} else if (y <= 2.6e-18) {
		tmp = (y * c) * expm1(x);
	} else {
		tmp = log1p(((fma(fma(fma(0.041666666666666664, x, 0.16666666666666666), x, 0.5), x, 1.0) * x) * y)) * c;
	}
	return tmp;
}

Julia

function code(c, x, y)
	tmp = 0.0
	if (y <= -9e-13)
		tmp = Float64(log1p(Float64(y * expm1(x))) * c);
	elseif (y <= 2.6e-18)
		tmp = Float64(Float64(y * c) * expm1(x));
	else
		tmp = Float64(log1p(Float64(Float64(fma(fma(fma(0.041666666666666664, x, 0.16666666666666666), x, 0.5), x, 1.0) * x) * y)) * c);
	end
	return tmp
end

Wolfram

code[c_, x_, y_] := If[LessEqual[y, -9e-13], N[(N[Log[1 + N[(y * N[(Exp[x] - 1), $MachinePrecision]), $MachinePrecision]], $MachinePrecision] * c), $MachinePrecision], If[LessEqual[y, 2.6e-18], N[(N[(y * c), $MachinePrecision] * N[(Exp[x] - 1), $MachinePrecision]), $MachinePrecision], N[(N[Log[1 + N[(N[(N[(N[(N[(0.041666666666666664 * x + 0.16666666666666666), $MachinePrecision] * x + 0.5), $MachinePrecision] * x + 1.0), $MachinePrecision] * x), $MachinePrecision] * y), $MachinePrecision]], $MachinePrecision] * c), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -9e-13

   1. Initial program 40.0%

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

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

      4. lift-log.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lower-log1p.f64 40.1

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 40.1

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

      10. lift--.f64 N/A

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

      11. lift-pow.f64 N/A

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

      12. pow-to-exp N/A

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

      13. lift-E.f64 N/A

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

      14. log-E N/A

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

      15. *-lft-identity N/A

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

      16. lower-expm1.f64 99.6

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

   4. Applied rewrites 99.6%

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

   if -9e-13 < y < 2.6e-18

   1. Initial program 44.0%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower-pow.f64 N/A

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

      8. lower-E.f64 62.4

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

   5. Applied rewrites 62.4%

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

   7. Applied rewrites 99.4%

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

   9. Applied rewrites 99.4%

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

   if 2.6e-18 < y

   1. Initial program 16.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 c \cdot \log \left(1 + \color{blue}{\left(x \cdot \left(\log \mathsf{E}\left(\right) + x \cdot \left(\frac{1}{2} \cdot {\log \mathsf{E}\left(\right)}^{2} + x \cdot \left(\frac{1}{24} \cdot \left(x \cdot {\log \mathsf{E}\left(\right)}^{4}\right) + \frac{1}{6} \cdot {\log \mathsf{E}\left(\right)}^{3}\right)\right)\right)\right)} \cdot y\right) \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 45.0%

      \[\leadsto c \cdot \log \left(1 + \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)} \cdot y\right) \]
   6. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 45.0

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

      4. lift-log.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lower-log1p.f64 97.1

         \[\leadsto \color{blue}{\mathsf{log1p}\left(\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) \cdot y\right)} \cdot c \]

   7. Applied rewrites 97.1%

      \[\leadsto \color{blue}{\mathsf{log1p}\left(\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) \cdot y\right) \cdot c} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 2: 89.7% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.3 \cdot 10^{+33}:\\ \;\;\;\;\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\\ \mathbf{elif}\;y \leq 2.6 \cdot 10^{-18}:\\ \;\;\;\;\left(y \cdot c\right) \cdot \mathsf{expm1}\left(x\right)\\ \mathbf{else}:\\ \;\;\;\;\mathsf{log1p}\left(\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) \cdot y\right) \cdot c\\ \end{array} \end{array} \]

FPCore

(FPCore (c x y)
 :precision binary64
 (if (<= y -1.3e+33)
   (* (log1p (* y (* (fma (fma 0.16666666666666666 x 0.5) x 1.0) x))) c)
   (if (<= y 2.6e-18)
     (* (* y c) (expm1 x))
     (*
      (log1p
       (*
        (*
         (fma
          (fma (fma 0.041666666666666664 x 0.16666666666666666) x 0.5)
          x
          1.0)
         x)
        y))
      c))))

C

double code(double c, double x, double y) {
	double tmp;
	if (y <= -1.3e+33) {
		tmp = log1p((y * (fma(fma(0.16666666666666666, x, 0.5), x, 1.0) * x))) * c;
	} else if (y <= 2.6e-18) {
		tmp = (y * c) * expm1(x);
	} else {
		tmp = log1p(((fma(fma(fma(0.041666666666666664, x, 0.16666666666666666), x, 0.5), x, 1.0) * x) * y)) * c;
	}
	return tmp;
}

Julia

function code(c, x, y)
	tmp = 0.0
	if (y <= -1.3e+33)
		tmp = Float64(log1p(Float64(y * Float64(fma(fma(0.16666666666666666, x, 0.5), x, 1.0) * x))) * c);
	elseif (y <= 2.6e-18)
		tmp = Float64(Float64(y * c) * expm1(x));
	else
		tmp = Float64(log1p(Float64(Float64(fma(fma(fma(0.041666666666666664, x, 0.16666666666666666), x, 0.5), x, 1.0) * x) * y)) * c);
	end
	return tmp
end

Wolfram

code[c_, x_, y_] := If[LessEqual[y, -1.3e+33], 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], If[LessEqual[y, 2.6e-18], N[(N[(y * c), $MachinePrecision] * N[(Exp[x] - 1), $MachinePrecision]), $MachinePrecision], N[(N[Log[1 + N[(N[(N[(N[(N[(0.041666666666666664 * x + 0.16666666666666666), $MachinePrecision] * x + 0.5), $MachinePrecision] * x + 1.0), $MachinePrecision] * x), $MachinePrecision] * y), $MachinePrecision]], $MachinePrecision] * c), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if y < -1.2999999999999999e33

   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. lift-log.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lower-log1p.f64 45.2

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 45.2

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

      10. lift--.f64 N/A

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

      11. lift-pow.f64 N/A

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

      12. pow-to-exp N/A

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

      13. lift-E.f64 N/A

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

      14. log-E N/A

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

      15. *-lft-identity N/A

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

      16. lower-expm1.f64 99.7

          \[\leadsto \mathsf{log1p}\left(y \cdot \color{blue}{\mathsf{expm1}\left(x\right)}\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 + 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 65.3

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

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

   if -1.2999999999999999e33 < y < 2.6e-18

   1. Initial program 42.1%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower-pow.f64 N/A

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

      8. lower-E.f64 58.7

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

   5. Applied rewrites 58.7%

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

   7. Applied rewrites 99.0%

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

   9. Applied rewrites 99.0%

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

   if 2.6e-18 < y

   1. Initial program 16.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 c \cdot \log \left(1 + \color{blue}{\left(x \cdot \left(\log \mathsf{E}\left(\right) + x \cdot \left(\frac{1}{2} \cdot {\log \mathsf{E}\left(\right)}^{2} + x \cdot \left(\frac{1}{24} \cdot \left(x \cdot {\log \mathsf{E}\left(\right)}^{4}\right) + \frac{1}{6} \cdot {\log \mathsf{E}\left(\right)}^{3}\right)\right)\right)\right)} \cdot y\right) \]
   4. Step-by-step derivation

      1. *-commutative N/A

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

      2. lower-*.f64 N/A

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

   5. Applied rewrites 45.0%

      \[\leadsto c \cdot \log \left(1 + \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)} \cdot y\right) \]
   6. Step-by-step derivation

      1. lift-*.f64 N/A

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

      2. *-commutative N/A

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

      3. lower-*.f64 45.0

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

      4. lift-log.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lower-log1p.f64 97.1

         \[\leadsto \color{blue}{\mathsf{log1p}\left(\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) \cdot y\right)} \cdot c \]

   7. Applied rewrites 97.1%

      \[\leadsto \color{blue}{\mathsf{log1p}\left(\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) \cdot y\right) \cdot c} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 89.7% accurate, 1.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;y \leq -1.3 \cdot 10^{+33} \lor \neg \left(y \leq 2.6 \cdot 10^{-18}\right):\\ \;\;\;\;\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\\ \mathbf{else}:\\ \;\;\;\;\left(y \cdot c\right) \cdot \mathsf{expm1}\left(x\right)\\ \end{array} \end{array} \]

FPCore

(FPCore (c x y)
 :precision binary64
 (if (or (<= y -1.3e+33) (not (<= y 2.6e-18)))
   (* (log1p (* y (* (fma (fma 0.16666666666666666 x 0.5) x 1.0) x))) c)
   (* (* y c) (expm1 x))))

C

double code(double c, double x, double y) {
	double tmp;
	if ((y <= -1.3e+33) || !(y <= 2.6e-18)) {
		tmp = log1p((y * (fma(fma(0.16666666666666666, x, 0.5), x, 1.0) * x))) * c;
	} else {
		tmp = (y * c) * expm1(x);
	}
	return tmp;
}

Julia

function code(c, x, y)
	tmp = 0.0
	if ((y <= -1.3e+33) || !(y <= 2.6e-18))
		tmp = Float64(log1p(Float64(y * Float64(fma(fma(0.16666666666666666, x, 0.5), x, 1.0) * x))) * c);
	else
		tmp = Float64(Float64(y * c) * expm1(x));
	end
	return tmp
end

Wolfram

code[c_, x_, y_] := If[Or[LessEqual[y, -1.3e+33], N[Not[LessEqual[y, 2.6e-18]], $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], N[(N[(y * c), $MachinePrecision] * N[(Exp[x] - 1), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if y < -1.2999999999999999e33 or 2.6e-18 < y

   1. Initial program 34.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 34.1

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

      4. lift-log.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lower-log1p.f64 34.2

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 34.2

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

      10. lift--.f64 N/A

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

      11. lift-pow.f64 N/A

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

      12. pow-to-exp N/A

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

      13. lift-E.f64 N/A

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

      14. log-E N/A

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

      15. *-lft-identity N/A

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

      16. lower-expm1.f64 98.6

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

   4. Applied rewrites 98.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 77.8

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

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

   if -1.2999999999999999e33 < y < 2.6e-18

   1. Initial program 42.1%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower-pow.f64 N/A

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

      8. lower-E.f64 58.7

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

   5. Applied rewrites 58.7%

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

   7. Applied rewrites 99.0%

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

   9. Applied rewrites 99.0%

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

4. Final simplification 91.8%

   \[\leadsto \begin{array}{l} \mathbf{if}\;y \leq -1.3 \cdot 10^{+33} \lor \neg \left(y \leq 2.6 \cdot 10^{-18}\right):\\ \;\;\;\;\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\\ \mathbf{else}:\\ \;\;\;\;\left(y \cdot c\right) \cdot \mathsf{expm1}\left(x\right)\\ \end{array} \]
5. Add Preprocessing

Alternative 4: 88.6% accurate, 1.6× speedup

Math

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

FPCore

(FPCore (c x y)
 :precision binary64
 (if (or (<= y -1.1e+80) (not (<= y 2.6e-18)))
   (* (log1p (* y (* (fma 0.5 x 1.0) x))) c)
   (* (* y c) (expm1 x))))

C

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -1.10000000000000001e80 or 2.6e-18 < y

   1. Initial program 31.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 31.4

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

      4. lift-log.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lower-log1p.f64 31.5

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 31.5

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

      10. lift--.f64 N/A

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

      11. lift-pow.f64 N/A

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

      12. pow-to-exp N/A

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

      13. lift-E.f64 N/A

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

      14. log-E N/A

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

      15. *-lft-identity N/A

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

      16. lower-expm1.f64 98.4

          \[\leadsto \mathsf{log1p}\left(y \cdot \color{blue}{\mathsf{expm1}\left(x\right)}\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 78.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 78.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 -1.10000000000000001e80 < y < 2.6e-18

   1. Initial program 42.9%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower-pow.f64 N/A

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

      8. lower-E.f64 56.5

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

   5. Applied rewrites 56.5%

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

   7. Applied rewrites 97.0%

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

   9. Applied rewrites 97.0%

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

4. Final simplification 91.2%

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

Alternative 5: 79.2% accurate, 1.8× speedup

Math

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

FPCore

(FPCore (c x y)
 :precision binary64
 (if (<= y -3.4e+192) (* c (log (fma y x 1.0))) (* (* y c) (expm1 x))))

C

double code(double c, double x, double y) {
	double tmp;
	if (y <= -3.4e+192) {
		tmp = c * log(fma(y, x, 1.0));
	} else {
		tmp = (y * c) * expm1(x);
	}
	return tmp;
}

Julia

function code(c, x, y)
	tmp = 0.0
	if (y <= -3.4e+192)
		tmp = Float64(c * log(fma(y, x, 1.0)));
	else
		tmp = Float64(Float64(y * c) * expm1(x));
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if y < -3.39999999999999996e192

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

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

   5. Applied rewrites 53.4%

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

   if -3.39999999999999996e192 < y

   1. Initial program 39.0%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower-pow.f64 N/A

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

      8. lower-E.f64 45.3

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

   5. Applied rewrites 45.3%

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

   7. Applied rewrites 86.7%

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

   9. Applied rewrites 86.7%

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

Alternative 6: 77.2% accurate, 1.9× speedup

Math

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

C

double code(double c, double x, double y) {
	double tmp;
	if (c <= 5e-12) {
		tmp = (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 (c <= 5e-12) {
		tmp = (y * Math.expm1(x)) * c;
	} else {
		tmp = (Math.expm1(x) * c) * y;
	}
	return tmp;
}

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if c < 4.9999999999999997e-12

   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. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower-pow.f64 N/A

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

      8. lower-E.f64 51.2

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

   5. Applied rewrites 51.2%

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

   7. Applied rewrites 80.0%

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

   9. Applied rewrites 78.2%

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

   if 4.9999999999999997e-12 < c

   1. Initial program 18.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 18.9

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

      4. lift-log.f64 N/A

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

      5. lift-+.f64 N/A

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

      6. lower-log1p.f64 32.8

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

      7. lift-*.f64 N/A

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

      8. *-commutative N/A

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

      9. lower-*.f64 32.8

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

      10. lift--.f64 N/A

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

      11. lift-pow.f64 N/A

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

      12. pow-to-exp N/A

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

      13. lift-E.f64 N/A

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

      14. log-E N/A

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

      15. *-lft-identity N/A

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

      16. lower-expm1.f64 81.6

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

   4. Applied rewrites 81.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 86.3

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

   7. Applied rewrites 86.3%

      \[\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 7: 76.9% accurate, 2.0× speedup

Math

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

FPCore

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

C

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

Java

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

Python

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

Julia

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

Wolfram

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

Derivation

1. Initial program 39.4%

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

3. Taylor expanded in y around 0

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

   1. *-commutative N/A

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

   2. associate-*r* N/A

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

   3. lower-*.f64 N/A

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

   4. *-commutative N/A

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

   5. lower-*.f64 N/A

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

   6. lower--.f64 N/A

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

   7. lower-pow.f64 N/A

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

   8. lower-E.f64 42.7

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

5. Applied rewrites 42.7%

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

7. Applied rewrites 81.7%

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

9. Applied rewrites 81.7%

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

Alternative 8: 63.5% accurate, 5.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;c \leq 2.1 \cdot 10^{+43}:\\ \;\;\;\;\left(c \cdot y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\left(\mathsf{fma}\left(x \cdot x, \mathsf{fma}\left(\mathsf{fma}\left(0.041666666666666664, x, 0.16666666666666666\right), x, 0.5\right), x\right) \cdot c\right) \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (c x y)
 :precision binary64
 (if (<= c 2.1e+43)
   (* (* c y) x)
   (*
    (*
     (fma
      (* x x)
      (fma (fma 0.041666666666666664 x 0.16666666666666666) x 0.5)
      x)
     c)
    y)))

C

double code(double c, double x, double y) {
	double tmp;
	if (c <= 2.1e+43) {
		tmp = (c * y) * x;
	} else {
		tmp = (fma((x * x), fma(fma(0.041666666666666664, x, 0.16666666666666666), x, 0.5), x) * c) * y;
	}
	return tmp;
}

Julia

function code(c, x, y)
	tmp = 0.0
	if (c <= 2.1e+43)
		tmp = Float64(Float64(c * y) * x);
	else
		tmp = Float64(Float64(fma(Float64(x * x), fma(fma(0.041666666666666664, x, 0.16666666666666666), x, 0.5), x) * c) * y);
	end
	return tmp
end

Wolfram

code[c_, x_, y_] := If[LessEqual[c, 2.1e+43], N[(N[(c * y), $MachinePrecision] * x), $MachinePrecision], N[(N[(N[(N[(x * x), $MachinePrecision] * N[(N[(0.041666666666666664 * x + 0.16666666666666666), $MachinePrecision] * x + 0.5), $MachinePrecision] + x), $MachinePrecision] * c), $MachinePrecision] * y), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if c < 2.10000000000000002e43

   1. Initial program 46.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. *-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 70.5

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

   5. Applied rewrites 70.5%

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

   if 2.10000000000000002e43 < c

   1. Initial program 19.0%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower-pow.f64 N/A

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

      8. lower-E.f64 22.7

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

   5. Applied rewrites 22.7%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 70.9%

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

   9. Taylor expanded in x around 0

      \[\leadsto \left(\left(x \cdot \left(\log \mathsf{E}\left(\right) + x \cdot \left(\frac{1}{2} \cdot {\log \mathsf{E}\left(\right)}^{2} + x \cdot \left(\frac{1}{24} \cdot \left(x \cdot {\log \mathsf{E}\left(\right)}^{4}\right) + \frac{1}{6} \cdot {\log \mathsf{E}\left(\right)}^{3}\right)\right)\right)\right) \cdot c\right) \cdot y \]
   10. Step-by-step derivation

   11. Applied rewrites 72.3%

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

Alternative 9: 63.5% accurate, 5.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;c \leq 2.1 \cdot 10^{+43}:\\ \;\;\;\;\left(c \cdot y\right) \cdot x\\ \mathbf{else}:\\ \;\;\;\;\left(\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) \cdot c\right) \cdot y\\ \end{array} \end{array} \]

FPCore

(FPCore (c x y)
 :precision binary64
 (if (<= c 2.1e+43)
   (* (* c y) x)
   (*
    (*
     (*
      (fma (fma (fma 0.041666666666666664 x 0.16666666666666666) x 0.5) x 1.0)
      x)
     c)
    y)))

C

double code(double c, double x, double y) {
	double tmp;
	if (c <= 2.1e+43) {
		tmp = (c * y) * x;
	} else {
		tmp = ((fma(fma(fma(0.041666666666666664, x, 0.16666666666666666), x, 0.5), x, 1.0) * x) * c) * y;
	}
	return tmp;
}

Julia

function code(c, x, y)
	tmp = 0.0
	if (c <= 2.1e+43)
		tmp = Float64(Float64(c * y) * x);
	else
		tmp = Float64(Float64(Float64(fma(fma(fma(0.041666666666666664, x, 0.16666666666666666), x, 0.5), x, 1.0) * x) * c) * y);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if c < 2.10000000000000002e43

   1. Initial program 46.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. *-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 70.5

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

   5. Applied rewrites 70.5%

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

   if 2.10000000000000002e43 < c

   1. Initial program 19.0%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower-pow.f64 N/A

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

      8. lower-E.f64 22.7

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

   5. Applied rewrites 22.7%

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

   6. Taylor expanded in x around 0

      \[\leadsto \left(\left(x \cdot \left(\log \mathsf{E}\left(\right) + x \cdot \left(\frac{1}{2} \cdot {\log \mathsf{E}\left(\right)}^{2} + x \cdot \left(\frac{1}{24} \cdot \left(x \cdot {\log \mathsf{E}\left(\right)}^{4}\right) + \frac{1}{6} \cdot {\log \mathsf{E}\left(\right)}^{3}\right)\right)\right)\right) \cdot c\right) \cdot y \]
   7. Step-by-step derivation

   8. Applied rewrites 72.2%

      \[\leadsto \left(\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) \cdot c\right) \cdot y \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 10: 63.4% accurate, 7.8× speedup

Math

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

FPCore

(FPCore (c x y)
 :precision binary64
 (if (<= c 2.1e+43) (* (* c y) x) (* (* (* (fma 0.5 x 1.0) x) c) y)))

C

double code(double c, double x, double y) {
	double tmp;
	if (c <= 2.1e+43) {
		tmp = (c * y) * x;
	} else {
		tmp = ((fma(0.5, x, 1.0) * x) * c) * y;
	}
	return tmp;
}

Julia

function code(c, x, y)
	tmp = 0.0
	if (c <= 2.1e+43)
		tmp = Float64(Float64(c * y) * x);
	else
		tmp = Float64(Float64(Float64(fma(0.5, x, 1.0) * x) * c) * y);
	end
	return tmp
end

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if c < 2.10000000000000002e43

   1. Initial program 46.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. *-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 70.5

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

   5. Applied rewrites 70.5%

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

   if 2.10000000000000002e43 < c

   1. Initial program 19.0%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower-pow.f64 N/A

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

      8. lower-E.f64 22.7

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

   5. Applied rewrites 22.7%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 71.7%

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

Alternative 11: 63.4% accurate, 12.8× speedup

Math

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

C

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

Fortran

real(8) function code(c, x, y)
    real(8), intent (in) :: c
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    real(8) :: tmp
    if (c <= 1.35d+145) 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 <= 1.35e+145) {
		tmp = (c * y) * x;
	} else {
		tmp = (x * c) * y;
	}
	return tmp;
}

Python

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

Julia

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

Wolfram

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

Derivation

1. Split input into 2 regimes

2. if c < 1.35000000000000011e145

   1. Initial program 43.9%

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

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

   5. Applied rewrites 70.6%

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

   if 1.35000000000000011e145 < c

   1. Initial program 14.9%

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

   3. Taylor expanded in y around 0

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

      1. *-commutative N/A

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

      2. associate-*r* N/A

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

      3. lower-*.f64 N/A

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

      4. *-commutative N/A

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

      5. lower-*.f64 N/A

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

      6. lower--.f64 N/A

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

      7. lower-pow.f64 N/A

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

      8. lower-E.f64 14.9

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

   5. Applied rewrites 14.9%

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

   6. Taylor expanded in x around 0

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

   8. Applied rewrites 70.8%

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

Alternative 12: 62.1% 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

real(8) function code(c, x, y)
    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 39.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 70.2

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

5. Applied rewrites 70.2%

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

Developer Target 1: 94.0% 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 2024338 
(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)))))