exp2 (problem 3.3.7)

Percentage Accurate: 54.2% → 100.0%

Time: 10.7s

Alternatives: 8

Speedup: 34.8×

Specification

\[\left|x\right| \leq 710\]

Math

\[\begin{array}{l} \\ \left(e^{x} - 2\right) + e^{-x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (+ (- (exp x) 2.0) (exp (- x))))

C

double code(double x) {
	return (exp(x) - 2.0) + exp(-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(x)
use fmin_fmax_functions
    real(8), intent (in) :: x
    code = (exp(x) - 2.0d0) + exp(-x)
end function

Java

public static double code(double x) {
	return (Math.exp(x) - 2.0) + Math.exp(-x);
}

Python

def code(x):
	return (math.exp(x) - 2.0) + math.exp(-x)

Julia

function code(x)
	return Float64(Float64(exp(x) - 2.0) + exp(Float64(-x)))
end

MATLAB

function tmp = code(x)
	tmp = (exp(x) - 2.0) + exp(-x);
end

Wolfram

code[x_] := N[(N[(N[Exp[x], $MachinePrecision] - 2.0), $MachinePrecision] + N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]

Initial Program: 54.2% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(e^{x} - 2\right) + e^{-x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (+ (- (exp x) 2.0) (exp (- x))))

C

double code(double x) {
	return (exp(x) - 2.0) + exp(-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(x)
use fmin_fmax_functions
    real(8), intent (in) :: x
    code = (exp(x) - 2.0d0) + exp(-x)
end function

Java

public static double code(double x) {
	return (Math.exp(x) - 2.0) + Math.exp(-x);
}

Python

def code(x):
	return (math.exp(x) - 2.0) + math.exp(-x)

Julia

function code(x)
	return Float64(Float64(exp(x) - 2.0) + exp(Float64(-x)))
end

MATLAB

function tmp = code(x)
	tmp = (exp(x) - 2.0) + exp(-x);
end

Wolfram

code[x_] := N[(N[(N[Exp[x], $MachinePrecision] - 2.0), $MachinePrecision] + N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]

Alternative 1: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x\_m \leq 0.11:\\ \;\;\;\;\mathsf{fma}\left(x\_m, x\_m \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(x\_m \cdot x\_m, 4.96031746031746 \cdot 10^{-5}, 0.002777777777777778\right) \cdot x\_m, x\_m, 0.08333333333333333\right) \cdot x\_m\right), x\_m\right) \cdot x\_m\\ \mathbf{else}:\\ \;\;\;\;e^{x\_m} - \left(2 - e^{-x\_m}\right)\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m)
 :precision binary64
 (if (<= x_m 0.11)
   (*
    (fma
     x_m
     (*
      x_m
      (*
       (fma
        (* (fma (* x_m x_m) 4.96031746031746e-5 0.002777777777777778) x_m)
        x_m
        0.08333333333333333)
       x_m))
     x_m)
    x_m)
   (- (exp x_m) (- 2.0 (exp (- x_m))))))

C

x_m = fabs(x);
double code(double x_m) {
	double tmp;
	if (x_m <= 0.11) {
		tmp = fma(x_m, (x_m * (fma((fma((x_m * x_m), 4.96031746031746e-5, 0.002777777777777778) * x_m), x_m, 0.08333333333333333) * x_m)), x_m) * x_m;
	} else {
		tmp = exp(x_m) - (2.0 - exp(-x_m));
	}
	return tmp;
}

Julia

x_m = abs(x)
function code(x_m)
	tmp = 0.0
	if (x_m <= 0.11)
		tmp = Float64(fma(x_m, Float64(x_m * Float64(fma(Float64(fma(Float64(x_m * x_m), 4.96031746031746e-5, 0.002777777777777778) * x_m), x_m, 0.08333333333333333) * x_m)), x_m) * x_m);
	else
		tmp = Float64(exp(x_m) - Float64(2.0 - exp(Float64(-x_m))));
	end
	return tmp
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := If[LessEqual[x$95$m, 0.11], N[(N[(x$95$m * N[(x$95$m * N[(N[(N[(N[(N[(x$95$m * x$95$m), $MachinePrecision] * 4.96031746031746e-5 + 0.002777777777777778), $MachinePrecision] * x$95$m), $MachinePrecision] * x$95$m + 0.08333333333333333), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision] + x$95$m), $MachinePrecision] * x$95$m), $MachinePrecision], N[(N[Exp[x$95$m], $MachinePrecision] - N[(2.0 - N[Exp[(-x$95$m)], $MachinePrecision]), $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 0.110000000000000001

   1. Initial program 55.8%

      \[\left(e^{x} - 2\right) + e^{-x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{{x}^{2} \cdot \left(1 + {x}^{2} \cdot \left(\frac{1}{12} + {x}^{2} \cdot \left(\frac{1}{360} + \frac{1}{20160} \cdot {x}^{2}\right)\right)\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(1 + {x}^{2} \cdot \left(\frac{1}{12} + {x}^{2} \cdot \left(\frac{1}{360} + \frac{1}{20160} \cdot {x}^{2}\right)\right)\right) \cdot {x}^{2}} \]

      2. unpow2 N/A

         \[\leadsto \left(1 + {x}^{2} \cdot \left(\frac{1}{12} + {x}^{2} \cdot \left(\frac{1}{360} + \frac{1}{20160} \cdot {x}^{2}\right)\right)\right) \cdot \color{blue}{\left(x \cdot x\right)} \]

      3. associate-*r* N/A

         \[\leadsto \color{blue}{\left(\left(1 + {x}^{2} \cdot \left(\frac{1}{12} + {x}^{2} \cdot \left(\frac{1}{360} + \frac{1}{20160} \cdot {x}^{2}\right)\right)\right) \cdot x\right) \cdot x} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\left(1 + {x}^{2} \cdot \left(\frac{1}{12} + {x}^{2} \cdot \left(\frac{1}{360} + \frac{1}{20160} \cdot {x}^{2}\right)\right)\right) \cdot x\right) \cdot x} \]

   5. Applied rewrites 98.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{3}, \mathsf{fma}\left(\mathsf{fma}\left(4.96031746031746 \cdot 10^{-5}, x \cdot x, 0.002777777777777778\right), x \cdot x, 0.08333333333333333\right), x\right) \cdot x} \]
   6. Step-by-step derivation

   7. Applied rewrites 98.8%

      \[\leadsto \mathsf{fma}\left(\left(x \cdot x\right) \cdot x, \mathsf{fma}\left(\mathsf{fma}\left(4.96031746031746 \cdot 10^{-5}, x \cdot x, 0.002777777777777778\right), x \cdot x, 0.08333333333333333\right), x\right) \cdot x \]
   8. Step-by-step derivation

   9. Applied rewrites 98.8%

      \[\leadsto \mathsf{fma}\left(x, x \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(4.96031746031746 \cdot 10^{-5}, x \cdot x, 0.002777777777777778\right), x \cdot x, 0.08333333333333333\right) \cdot x\right), x\right) \cdot x \]
   10. Step-by-step derivation

   11. Applied rewrites 98.8%

       \[\leadsto \mathsf{fma}\left(x, x \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(x \cdot x, 4.96031746031746 \cdot 10^{-5}, 0.002777777777777778\right) \cdot x, x, 0.08333333333333333\right) \cdot x\right), x\right) \cdot x \]

   if 0.110000000000000001 < x

   1. Initial program 99.4%

      \[\left(e^{x} - 2\right) + e^{-x} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \color{blue}{\left(e^{x} - 2\right) + e^{-x}} \]

      2. lift--.f64 N/A

         \[\leadsto \color{blue}{\left(e^{x} - 2\right)} + e^{-x} \]

      3. associate-+l- N/A

         \[\leadsto \color{blue}{e^{x} - \left(2 - e^{-x}\right)} \]

      4. lower--.f64 N/A

         \[\leadsto \color{blue}{e^{x} - \left(2 - e^{-x}\right)} \]

      5. lower--.f64 99.4

         \[\leadsto e^{x} - \color{blue}{\left(2 - e^{-x}\right)} \]

   4. Applied rewrites 99.4%

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

Alternative 2: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x\_m \leq 0.102:\\ \;\;\;\;\mathsf{fma}\left(x\_m, x\_m \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(x\_m \cdot x\_m, 4.96031746031746 \cdot 10^{-5}, 0.002777777777777778\right) \cdot x\_m, x\_m, 0.08333333333333333\right) \cdot x\_m\right), x\_m\right) \cdot x\_m\\ \mathbf{else}:\\ \;\;\;\;\left(e^{x\_m} - 2\right) + e^{-x\_m}\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m)
 :precision binary64
 (if (<= x_m 0.102)
   (*
    (fma
     x_m
     (*
      x_m
      (*
       (fma
        (* (fma (* x_m x_m) 4.96031746031746e-5 0.002777777777777778) x_m)
        x_m
        0.08333333333333333)
       x_m))
     x_m)
    x_m)
   (+ (- (exp x_m) 2.0) (exp (- x_m)))))

C

x_m = fabs(x);
double code(double x_m) {
	double tmp;
	if (x_m <= 0.102) {
		tmp = fma(x_m, (x_m * (fma((fma((x_m * x_m), 4.96031746031746e-5, 0.002777777777777778) * x_m), x_m, 0.08333333333333333) * x_m)), x_m) * x_m;
	} else {
		tmp = (exp(x_m) - 2.0) + exp(-x_m);
	}
	return tmp;
}

Julia

x_m = abs(x)
function code(x_m)
	tmp = 0.0
	if (x_m <= 0.102)
		tmp = Float64(fma(x_m, Float64(x_m * Float64(fma(Float64(fma(Float64(x_m * x_m), 4.96031746031746e-5, 0.002777777777777778) * x_m), x_m, 0.08333333333333333) * x_m)), x_m) * x_m);
	else
		tmp = Float64(Float64(exp(x_m) - 2.0) + exp(Float64(-x_m)));
	end
	return tmp
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := If[LessEqual[x$95$m, 0.102], N[(N[(x$95$m * N[(x$95$m * N[(N[(N[(N[(N[(x$95$m * x$95$m), $MachinePrecision] * 4.96031746031746e-5 + 0.002777777777777778), $MachinePrecision] * x$95$m), $MachinePrecision] * x$95$m + 0.08333333333333333), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision] + x$95$m), $MachinePrecision] * x$95$m), $MachinePrecision], N[(N[(N[Exp[x$95$m], $MachinePrecision] - 2.0), $MachinePrecision] + N[Exp[(-x$95$m)], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 0.101999999999999993

   1. Initial program 55.8%

      \[\left(e^{x} - 2\right) + e^{-x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{{x}^{2} \cdot \left(1 + {x}^{2} \cdot \left(\frac{1}{12} + {x}^{2} \cdot \left(\frac{1}{360} + \frac{1}{20160} \cdot {x}^{2}\right)\right)\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(1 + {x}^{2} \cdot \left(\frac{1}{12} + {x}^{2} \cdot \left(\frac{1}{360} + \frac{1}{20160} \cdot {x}^{2}\right)\right)\right) \cdot {x}^{2}} \]

      2. unpow2 N/A

         \[\leadsto \left(1 + {x}^{2} \cdot \left(\frac{1}{12} + {x}^{2} \cdot \left(\frac{1}{360} + \frac{1}{20160} \cdot {x}^{2}\right)\right)\right) \cdot \color{blue}{\left(x \cdot x\right)} \]

      3. associate-*r* N/A

         \[\leadsto \color{blue}{\left(\left(1 + {x}^{2} \cdot \left(\frac{1}{12} + {x}^{2} \cdot \left(\frac{1}{360} + \frac{1}{20160} \cdot {x}^{2}\right)\right)\right) \cdot x\right) \cdot x} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\left(1 + {x}^{2} \cdot \left(\frac{1}{12} + {x}^{2} \cdot \left(\frac{1}{360} + \frac{1}{20160} \cdot {x}^{2}\right)\right)\right) \cdot x\right) \cdot x} \]

   5. Applied rewrites 98.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{3}, \mathsf{fma}\left(\mathsf{fma}\left(4.96031746031746 \cdot 10^{-5}, x \cdot x, 0.002777777777777778\right), x \cdot x, 0.08333333333333333\right), x\right) \cdot x} \]
   6. Step-by-step derivation

   7. Applied rewrites 98.8%

      \[\leadsto \mathsf{fma}\left(\left(x \cdot x\right) \cdot x, \mathsf{fma}\left(\mathsf{fma}\left(4.96031746031746 \cdot 10^{-5}, x \cdot x, 0.002777777777777778\right), x \cdot x, 0.08333333333333333\right), x\right) \cdot x \]
   8. Step-by-step derivation

   9. Applied rewrites 98.8%

      \[\leadsto \mathsf{fma}\left(x, x \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(4.96031746031746 \cdot 10^{-5}, x \cdot x, 0.002777777777777778\right), x \cdot x, 0.08333333333333333\right) \cdot x\right), x\right) \cdot x \]
   10. Step-by-step derivation

   11. Applied rewrites 98.8%

       \[\leadsto \mathsf{fma}\left(x, x \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(x \cdot x, 4.96031746031746 \cdot 10^{-5}, 0.002777777777777778\right) \cdot x, x, 0.08333333333333333\right) \cdot x\right), x\right) \cdot x \]

   if 0.101999999999999993 < x

   1. Initial program 99.4%

      \[\left(e^{x} - 2\right) + e^{-x} \]
   2. Add Preprocessing
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 100.0% accurate, 1.8× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \begin{array}{l} \mathbf{if}\;x\_m \leq 0.105:\\ \;\;\;\;\mathsf{fma}\left(x\_m, x\_m \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(x\_m \cdot x\_m, 4.96031746031746 \cdot 10^{-5}, 0.002777777777777778\right) \cdot x\_m, x\_m, 0.08333333333333333\right) \cdot x\_m\right), x\_m\right) \cdot x\_m\\ \mathbf{else}:\\ \;\;\;\;2 \cdot \cosh x\_m - 2\\ \end{array} \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m)
 :precision binary64
 (if (<= x_m 0.105)
   (*
    (fma
     x_m
     (*
      x_m
      (*
       (fma
        (* (fma (* x_m x_m) 4.96031746031746e-5 0.002777777777777778) x_m)
        x_m
        0.08333333333333333)
       x_m))
     x_m)
    x_m)
   (- (* 2.0 (cosh x_m)) 2.0)))

C

x_m = fabs(x);
double code(double x_m) {
	double tmp;
	if (x_m <= 0.105) {
		tmp = fma(x_m, (x_m * (fma((fma((x_m * x_m), 4.96031746031746e-5, 0.002777777777777778) * x_m), x_m, 0.08333333333333333) * x_m)), x_m) * x_m;
	} else {
		tmp = (2.0 * cosh(x_m)) - 2.0;
	}
	return tmp;
}

Julia

x_m = abs(x)
function code(x_m)
	tmp = 0.0
	if (x_m <= 0.105)
		tmp = Float64(fma(x_m, Float64(x_m * Float64(fma(Float64(fma(Float64(x_m * x_m), 4.96031746031746e-5, 0.002777777777777778) * x_m), x_m, 0.08333333333333333) * x_m)), x_m) * x_m);
	else
		tmp = Float64(Float64(2.0 * cosh(x_m)) - 2.0);
	end
	return tmp
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := If[LessEqual[x$95$m, 0.105], N[(N[(x$95$m * N[(x$95$m * N[(N[(N[(N[(N[(x$95$m * x$95$m), $MachinePrecision] * 4.96031746031746e-5 + 0.002777777777777778), $MachinePrecision] * x$95$m), $MachinePrecision] * x$95$m + 0.08333333333333333), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision] + x$95$m), $MachinePrecision] * x$95$m), $MachinePrecision], N[(N[(2.0 * N[Cosh[x$95$m], $MachinePrecision]), $MachinePrecision] - 2.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 0.104999999999999996

   1. Initial program 55.8%

      \[\left(e^{x} - 2\right) + e^{-x} \]
   2. Add Preprocessing

   3. Taylor expanded in x around 0

      \[\leadsto \color{blue}{{x}^{2} \cdot \left(1 + {x}^{2} \cdot \left(\frac{1}{12} + {x}^{2} \cdot \left(\frac{1}{360} + \frac{1}{20160} \cdot {x}^{2}\right)\right)\right)} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto \color{blue}{\left(1 + {x}^{2} \cdot \left(\frac{1}{12} + {x}^{2} \cdot \left(\frac{1}{360} + \frac{1}{20160} \cdot {x}^{2}\right)\right)\right) \cdot {x}^{2}} \]

      2. unpow2 N/A

         \[\leadsto \left(1 + {x}^{2} \cdot \left(\frac{1}{12} + {x}^{2} \cdot \left(\frac{1}{360} + \frac{1}{20160} \cdot {x}^{2}\right)\right)\right) \cdot \color{blue}{\left(x \cdot x\right)} \]

      3. associate-*r* N/A

         \[\leadsto \color{blue}{\left(\left(1 + {x}^{2} \cdot \left(\frac{1}{12} + {x}^{2} \cdot \left(\frac{1}{360} + \frac{1}{20160} \cdot {x}^{2}\right)\right)\right) \cdot x\right) \cdot x} \]

      4. lower-*.f64 N/A

         \[\leadsto \color{blue}{\left(\left(1 + {x}^{2} \cdot \left(\frac{1}{12} + {x}^{2} \cdot \left(\frac{1}{360} + \frac{1}{20160} \cdot {x}^{2}\right)\right)\right) \cdot x\right) \cdot x} \]

   5. Applied rewrites 98.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{3}, \mathsf{fma}\left(\mathsf{fma}\left(4.96031746031746 \cdot 10^{-5}, x \cdot x, 0.002777777777777778\right), x \cdot x, 0.08333333333333333\right), x\right) \cdot x} \]
   6. Step-by-step derivation

   7. Applied rewrites 98.8%

      \[\leadsto \mathsf{fma}\left(\left(x \cdot x\right) \cdot x, \mathsf{fma}\left(\mathsf{fma}\left(4.96031746031746 \cdot 10^{-5}, x \cdot x, 0.002777777777777778\right), x \cdot x, 0.08333333333333333\right), x\right) \cdot x \]
   8. Step-by-step derivation

   9. Applied rewrites 98.8%

      \[\leadsto \mathsf{fma}\left(x, x \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(4.96031746031746 \cdot 10^{-5}, x \cdot x, 0.002777777777777778\right), x \cdot x, 0.08333333333333333\right) \cdot x\right), x\right) \cdot x \]
   10. Step-by-step derivation

   11. Applied rewrites 98.8%

       \[\leadsto \mathsf{fma}\left(x, x \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(x \cdot x, 4.96031746031746 \cdot 10^{-5}, 0.002777777777777778\right) \cdot x, x, 0.08333333333333333\right) \cdot x\right), x\right) \cdot x \]

   if 0.104999999999999996 < x

   1. Initial program 99.4%

      \[\left(e^{x} - 2\right) + e^{-x} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto \color{blue}{\left(e^{x} - 2\right) + e^{-x}} \]

      2. +-commutative N/A

         \[\leadsto \color{blue}{e^{-x} + \left(e^{x} - 2\right)} \]

      3. lift--.f64 N/A

         \[\leadsto e^{-x} + \color{blue}{\left(e^{x} - 2\right)} \]

      4. associate-+r- N/A

         \[\leadsto \color{blue}{\left(e^{-x} + e^{x}\right) - 2} \]

      5. +-commutative N/A

         \[\leadsto \color{blue}{\left(e^{x} + e^{-x}\right)} - 2 \]

      6. lift-exp.f64 N/A

         \[\leadsto \left(\color{blue}{e^{x}} + e^{-x}\right) - 2 \]

      7. lift-exp.f64 N/A

         \[\leadsto \left(e^{x} + \color{blue}{e^{-x}}\right) - 2 \]

      8. lift-neg.f64 N/A

         \[\leadsto \left(e^{x} + e^{\color{blue}{\mathsf{neg}\left(x\right)}}\right) - 2 \]

      9. lower--.f64 N/A

         \[\leadsto \color{blue}{\left(e^{x} + e^{\mathsf{neg}\left(x\right)}\right) - 2} \]

      10. cosh-undef N/A

          \[\leadsto \color{blue}{2 \cdot \cosh x} - 2 \]

      11. lower-*.f64 N/A

          \[\leadsto \color{blue}{2 \cdot \cosh x} - 2 \]

      12. lower-cosh.f64 99.4

          \[\leadsto 2 \cdot \color{blue}{\cosh x} - 2 \]

   4. Applied rewrites 99.4%

      \[\leadsto \color{blue}{2 \cdot \cosh x - 2} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 4: 99.0% accurate, 4.8× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \mathsf{fma}\left(x\_m, x\_m \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(x\_m \cdot x\_m, 4.96031746031746 \cdot 10^{-5}, 0.002777777777777778\right) \cdot x\_m, x\_m, 0.08333333333333333\right) \cdot x\_m\right), x\_m\right) \cdot x\_m \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m)
 :precision binary64
 (*
  (fma
   x_m
   (*
    x_m
    (*
     (fma
      (* (fma (* x_m x_m) 4.96031746031746e-5 0.002777777777777778) x_m)
      x_m
      0.08333333333333333)
     x_m))
   x_m)
  x_m))

C

x_m = fabs(x);
double code(double x_m) {
	return fma(x_m, (x_m * (fma((fma((x_m * x_m), 4.96031746031746e-5, 0.002777777777777778) * x_m), x_m, 0.08333333333333333) * x_m)), x_m) * x_m;
}

Julia

x_m = abs(x)
function code(x_m)
	return Float64(fma(x_m, Float64(x_m * Float64(fma(Float64(fma(Float64(x_m * x_m), 4.96031746031746e-5, 0.002777777777777778) * x_m), x_m, 0.08333333333333333) * x_m)), x_m) * x_m)
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := N[(N[(x$95$m * N[(x$95$m * N[(N[(N[(N[(N[(x$95$m * x$95$m), $MachinePrecision] * 4.96031746031746e-5 + 0.002777777777777778), $MachinePrecision] * x$95$m), $MachinePrecision] * x$95$m + 0.08333333333333333), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision] + x$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]

Derivation

1. Initial program 56.5%

   \[\left(e^{x} - 2\right) + e^{-x} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

   \[\leadsto \color{blue}{{x}^{2} \cdot \left(1 + {x}^{2} \cdot \left(\frac{1}{12} + {x}^{2} \cdot \left(\frac{1}{360} + \frac{1}{20160} \cdot {x}^{2}\right)\right)\right)} \]
4. Step-by-step derivation

   1. *-commutative N/A

      \[\leadsto \color{blue}{\left(1 + {x}^{2} \cdot \left(\frac{1}{12} + {x}^{2} \cdot \left(\frac{1}{360} + \frac{1}{20160} \cdot {x}^{2}\right)\right)\right) \cdot {x}^{2}} \]

   2. unpow2 N/A

      \[\leadsto \left(1 + {x}^{2} \cdot \left(\frac{1}{12} + {x}^{2} \cdot \left(\frac{1}{360} + \frac{1}{20160} \cdot {x}^{2}\right)\right)\right) \cdot \color{blue}{\left(x \cdot x\right)} \]

   3. associate-*r* N/A

      \[\leadsto \color{blue}{\left(\left(1 + {x}^{2} \cdot \left(\frac{1}{12} + {x}^{2} \cdot \left(\frac{1}{360} + \frac{1}{20160} \cdot {x}^{2}\right)\right)\right) \cdot x\right) \cdot x} \]

   4. lower-*.f64 N/A

      \[\leadsto \color{blue}{\left(\left(1 + {x}^{2} \cdot \left(\frac{1}{12} + {x}^{2} \cdot \left(\frac{1}{360} + \frac{1}{20160} \cdot {x}^{2}\right)\right)\right) \cdot x\right) \cdot x} \]

5. Applied rewrites 97.7%

   \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{3}, \mathsf{fma}\left(\mathsf{fma}\left(4.96031746031746 \cdot 10^{-5}, x \cdot x, 0.002777777777777778\right), x \cdot x, 0.08333333333333333\right), x\right) \cdot x} \]
6. Step-by-step derivation

7. Applied rewrites 97.7%

   \[\leadsto \mathsf{fma}\left(\left(x \cdot x\right) \cdot x, \mathsf{fma}\left(\mathsf{fma}\left(4.96031746031746 \cdot 10^{-5}, x \cdot x, 0.002777777777777778\right), x \cdot x, 0.08333333333333333\right), x\right) \cdot x \]
8. Step-by-step derivation

9. Applied rewrites 97.7%

   \[\leadsto \mathsf{fma}\left(x, x \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(4.96031746031746 \cdot 10^{-5}, x \cdot x, 0.002777777777777778\right), x \cdot x, 0.08333333333333333\right) \cdot x\right), x\right) \cdot x \]
10. Step-by-step derivation

11. Applied rewrites 97.7%

    \[\leadsto \mathsf{fma}\left(x, x \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(x \cdot x, 4.96031746031746 \cdot 10^{-5}, 0.002777777777777778\right) \cdot x, x, 0.08333333333333333\right) \cdot x\right), x\right) \cdot x \]
12. Add Preprocessing

Alternative 5: 98.8% accurate, 6.3× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \mathsf{fma}\left(x\_m, x\_m \cdot \left(\mathsf{fma}\left(x\_m \cdot x\_m, 0.002777777777777778, 0.08333333333333333\right) \cdot x\_m\right), x\_m\right) \cdot x\_m \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m)
 :precision binary64
 (*
  (fma
   x_m
   (* x_m (* (fma (* x_m x_m) 0.002777777777777778 0.08333333333333333) x_m))
   x_m)
  x_m))

C

x_m = fabs(x);
double code(double x_m) {
	return fma(x_m, (x_m * (fma((x_m * x_m), 0.002777777777777778, 0.08333333333333333) * x_m)), x_m) * x_m;
}

Julia

x_m = abs(x)
function code(x_m)
	return Float64(fma(x_m, Float64(x_m * Float64(fma(Float64(x_m * x_m), 0.002777777777777778, 0.08333333333333333) * x_m)), x_m) * x_m)
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := N[(N[(x$95$m * N[(x$95$m * N[(N[(N[(x$95$m * x$95$m), $MachinePrecision] * 0.002777777777777778 + 0.08333333333333333), $MachinePrecision] * x$95$m), $MachinePrecision]), $MachinePrecision] + x$95$m), $MachinePrecision] * x$95$m), $MachinePrecision]

Derivation

1. Initial program 56.5%

   \[\left(e^{x} - 2\right) + e^{-x} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

   \[\leadsto \color{blue}{{x}^{2} \cdot \left(1 + {x}^{2} \cdot \left(\frac{1}{12} + {x}^{2} \cdot \left(\frac{1}{360} + \frac{1}{20160} \cdot {x}^{2}\right)\right)\right)} \]
4. Step-by-step derivation

   1. *-commutative N/A

      \[\leadsto \color{blue}{\left(1 + {x}^{2} \cdot \left(\frac{1}{12} + {x}^{2} \cdot \left(\frac{1}{360} + \frac{1}{20160} \cdot {x}^{2}\right)\right)\right) \cdot {x}^{2}} \]

   2. unpow2 N/A

      \[\leadsto \left(1 + {x}^{2} \cdot \left(\frac{1}{12} + {x}^{2} \cdot \left(\frac{1}{360} + \frac{1}{20160} \cdot {x}^{2}\right)\right)\right) \cdot \color{blue}{\left(x \cdot x\right)} \]

   3. associate-*r* N/A

      \[\leadsto \color{blue}{\left(\left(1 + {x}^{2} \cdot \left(\frac{1}{12} + {x}^{2} \cdot \left(\frac{1}{360} + \frac{1}{20160} \cdot {x}^{2}\right)\right)\right) \cdot x\right) \cdot x} \]

   4. lower-*.f64 N/A

      \[\leadsto \color{blue}{\left(\left(1 + {x}^{2} \cdot \left(\frac{1}{12} + {x}^{2} \cdot \left(\frac{1}{360} + \frac{1}{20160} \cdot {x}^{2}\right)\right)\right) \cdot x\right) \cdot x} \]

5. Applied rewrites 97.7%

   \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{3}, \mathsf{fma}\left(\mathsf{fma}\left(4.96031746031746 \cdot 10^{-5}, x \cdot x, 0.002777777777777778\right), x \cdot x, 0.08333333333333333\right), x\right) \cdot x} \]
6. Step-by-step derivation

7. Applied rewrites 97.7%

   \[\leadsto \mathsf{fma}\left(\left(x \cdot x\right) \cdot x, \mathsf{fma}\left(\mathsf{fma}\left(4.96031746031746 \cdot 10^{-5}, x \cdot x, 0.002777777777777778\right), x \cdot x, 0.08333333333333333\right), x\right) \cdot x \]
8. Step-by-step derivation

9. Applied rewrites 97.7%

   \[\leadsto \mathsf{fma}\left(x, x \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(4.96031746031746 \cdot 10^{-5}, x \cdot x, 0.002777777777777778\right), x \cdot x, 0.08333333333333333\right) \cdot x\right), x\right) \cdot x \]

10. Taylor expanded in x around 0

    \[\leadsto \mathsf{fma}\left(x, x \cdot \left(\left(\frac{1}{12} + \frac{1}{360} \cdot {x}^{2}\right) \cdot x\right), x\right) \cdot x \]
11. Step-by-step derivation

12. Applied rewrites 97.5%

    \[\leadsto \mathsf{fma}\left(x, x \cdot \left(\mathsf{fma}\left(x \cdot x, 0.002777777777777778, 0.08333333333333333\right) \cdot x\right), x\right) \cdot x \]
13. Add Preprocessing

Alternative 6: 98.6% accurate, 9.5× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ \mathsf{fma}\left(0.08333333333333333 \cdot x\_m, x\_m, 1\right) \cdot \left(x\_m \cdot x\_m\right) \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m)
 :precision binary64
 (* (fma (* 0.08333333333333333 x_m) x_m 1.0) (* x_m x_m)))

C

x_m = fabs(x);
double code(double x_m) {
	return fma((0.08333333333333333 * x_m), x_m, 1.0) * (x_m * x_m);
}

Julia

x_m = abs(x)
function code(x_m)
	return Float64(fma(Float64(0.08333333333333333 * x_m), x_m, 1.0) * Float64(x_m * x_m))
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := N[(N[(N[(0.08333333333333333 * x$95$m), $MachinePrecision] * x$95$m + 1.0), $MachinePrecision] * N[(x$95$m * x$95$m), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 56.5%

   \[\left(e^{x} - 2\right) + e^{-x} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

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

   1. +-commutative N/A

      \[\leadsto {x}^{2} \cdot \color{blue}{\left(\frac{1}{12} \cdot {x}^{2} + 1\right)} \]

   2. distribute-lft-in N/A

      \[\leadsto \color{blue}{{x}^{2} \cdot \left(\frac{1}{12} \cdot {x}^{2}\right) + {x}^{2} \cdot 1} \]

   3. *-rgt-identity N/A

      \[\leadsto {x}^{2} \cdot \left(\frac{1}{12} \cdot {x}^{2}\right) + \color{blue}{{x}^{2}} \]

   4. unpow2 N/A

      \[\leadsto {x}^{2} \cdot \left(\frac{1}{12} \cdot {x}^{2}\right) + \color{blue}{x \cdot x} \]

   5. sqr-abs-rev N/A

      \[\leadsto {x}^{2} \cdot \left(\frac{1}{12} \cdot {x}^{2}\right) + \color{blue}{\left|x\right| \cdot \left|x\right|} \]

   6. fp-cancel-sign-sub-inv N/A

      \[\leadsto \color{blue}{{x}^{2} \cdot \left(\frac{1}{12} \cdot {x}^{2}\right) - \left(\mathsf{neg}\left(\left|x\right|\right)\right) \cdot \left|x\right|} \]

   7. fp-cancel-sub-sign-inv N/A

      \[\leadsto \color{blue}{{x}^{2} \cdot \left(\frac{1}{12} \cdot {x}^{2}\right) + \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(\left|x\right|\right)\right)\right)\right) \cdot \left|x\right|} \]

   8. *-commutative N/A

      \[\leadsto {x}^{2} \cdot \color{blue}{\left({x}^{2} \cdot \frac{1}{12}\right)} + \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(\left|x\right|\right)\right)\right)\right) \cdot \left|x\right| \]

   9. associate-*r* N/A

      \[\leadsto \color{blue}{\left({x}^{2} \cdot {x}^{2}\right) \cdot \frac{1}{12}} + \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(\left|x\right|\right)\right)\right)\right) \cdot \left|x\right| \]

   10. distribute-lft-neg-in N/A

       \[\leadsto \left({x}^{2} \cdot {x}^{2}\right) \cdot \frac{1}{12} + \color{blue}{\left(\mathsf{neg}\left(\left(\mathsf{neg}\left(\left|x\right|\right)\right) \cdot \left|x\right|\right)\right)} \]

   11. distribute-lft-neg-in N/A

       \[\leadsto \left({x}^{2} \cdot {x}^{2}\right) \cdot \frac{1}{12} + \left(\mathsf{neg}\left(\color{blue}{\left(\mathsf{neg}\left(\left|x\right| \cdot \left|x\right|\right)\right)}\right)\right) \]

   12. sqr-abs-rev N/A

       \[\leadsto \left({x}^{2} \cdot {x}^{2}\right) \cdot \frac{1}{12} + \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(\color{blue}{x \cdot x}\right)\right)\right)\right) \]

   13. unpow2 N/A

       \[\leadsto \left({x}^{2} \cdot {x}^{2}\right) \cdot \frac{1}{12} + \left(\mathsf{neg}\left(\left(\mathsf{neg}\left(\color{blue}{{x}^{2}}\right)\right)\right)\right) \]

   14. remove-double-neg N/A

       \[\leadsto \left({x}^{2} \cdot {x}^{2}\right) \cdot \frac{1}{12} + \color{blue}{{x}^{2}} \]

   15. lower-fma.f64 N/A

       \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{2} \cdot {x}^{2}, \frac{1}{12}, {x}^{2}\right)} \]

   16. pow-sqr N/A

       \[\leadsto \mathsf{fma}\left(\color{blue}{{x}^{\left(2 \cdot 2\right)}}, \frac{1}{12}, {x}^{2}\right) \]

   17. lower-pow.f64 N/A

       \[\leadsto \mathsf{fma}\left(\color{blue}{{x}^{\left(2 \cdot 2\right)}}, \frac{1}{12}, {x}^{2}\right) \]

   18. metadata-eval N/A

       \[\leadsto \mathsf{fma}\left({x}^{\color{blue}{4}}, \frac{1}{12}, {x}^{2}\right) \]

   19. unpow2 N/A

       \[\leadsto \mathsf{fma}\left({x}^{4}, \frac{1}{12}, \color{blue}{x \cdot x}\right) \]

   20. lower-*.f64 97.1

       \[\leadsto \mathsf{fma}\left({x}^{4}, 0.08333333333333333, \color{blue}{x \cdot x}\right) \]

5. Applied rewrites 97.1%

   \[\leadsto \color{blue}{\mathsf{fma}\left({x}^{4}, 0.08333333333333333, x \cdot x\right)} \]
6. Step-by-step derivation

7. Applied rewrites 97.1%

   \[\leadsto \mathsf{fma}\left(x \cdot x, \color{blue}{\left(x \cdot x\right) \cdot 0.08333333333333333}, x \cdot x\right) \]
8. Step-by-step derivation

9. Applied rewrites 97.1%

   \[\leadsto \mathsf{fma}\left(0.08333333333333333 \cdot x, x, 1\right) \cdot \color{blue}{\left(x \cdot x\right)} \]
10. Add Preprocessing

Alternative 7: 98.1% accurate, 34.8× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ x\_m \cdot x\_m \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m) :precision binary64 (* x_m x_m))

C

x_m = fabs(x);
double code(double x_m) {
	return x_m * x_m;
}

Fortran

x_m =     private
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(x_m)
use fmin_fmax_functions
    real(8), intent (in) :: x_m
    code = x_m * x_m
end function

Java

x_m = Math.abs(x);
public static double code(double x_m) {
	return x_m * x_m;
}

Python

x_m = math.fabs(x)
def code(x_m):
	return x_m * x_m

Julia

x_m = abs(x)
function code(x_m)
	return Float64(x_m * x_m)
end

MATLAB

x_m = abs(x);
function tmp = code(x_m)
	tmp = x_m * x_m;
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := N[(x$95$m * x$95$m), $MachinePrecision]

Derivation

1. Initial program 56.5%

   \[\left(e^{x} - 2\right) + e^{-x} \]
2. Add Preprocessing

3. Taylor expanded in x around 0

   \[\leadsto \color{blue}{{x}^{2}} \]
4. Step-by-step derivation

   1. unpow2 N/A

      \[\leadsto \color{blue}{x \cdot x} \]

   2. lower-*.f64 96.6

      \[\leadsto \color{blue}{x \cdot x} \]

5. Applied rewrites 96.6%

   \[\leadsto \color{blue}{x \cdot x} \]
6. Add Preprocessing

Alternative 8: 51.6% accurate, 52.3× speedup

Math

\[\begin{array}{l} x_m = \left|x\right| \\ 2 - 2 \end{array} \]

FPCore

x_m = (fabs.f64 x)
(FPCore (x_m) :precision binary64 (- 2.0 2.0))

C

x_m = fabs(x);
double code(double x_m) {
	return 2.0 - 2.0;
}

Fortran

x_m =     private
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(x_m)
use fmin_fmax_functions
    real(8), intent (in) :: x_m
    code = 2.0d0 - 2.0d0
end function

Java

x_m = Math.abs(x);
public static double code(double x_m) {
	return 2.0 - 2.0;
}

Python

x_m = math.fabs(x)
def code(x_m):
	return 2.0 - 2.0

Julia

x_m = abs(x)
function code(x_m)
	return Float64(2.0 - 2.0)
end

MATLAB

x_m = abs(x);
function tmp = code(x_m)
	tmp = 2.0 - 2.0;
end

Wolfram

x_m = N[Abs[x], $MachinePrecision]
code[x$95$m_] := N[(2.0 - 2.0), $MachinePrecision]

Derivation

1. Initial program 56.5%

   \[\left(e^{x} - 2\right) + e^{-x} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-+.f64 N/A

      \[\leadsto \color{blue}{\left(e^{x} - 2\right) + e^{-x}} \]

   2. +-commutative N/A

      \[\leadsto \color{blue}{e^{-x} + \left(e^{x} - 2\right)} \]

   3. lift--.f64 N/A

      \[\leadsto e^{-x} + \color{blue}{\left(e^{x} - 2\right)} \]

   4. associate-+r- N/A

      \[\leadsto \color{blue}{\left(e^{-x} + e^{x}\right) - 2} \]

   5. +-commutative N/A

      \[\leadsto \color{blue}{\left(e^{x} + e^{-x}\right)} - 2 \]

   6. lift-exp.f64 N/A

      \[\leadsto \left(\color{blue}{e^{x}} + e^{-x}\right) - 2 \]

   7. lift-exp.f64 N/A

      \[\leadsto \left(e^{x} + \color{blue}{e^{-x}}\right) - 2 \]

   8. lift-neg.f64 N/A

      \[\leadsto \left(e^{x} + e^{\color{blue}{\mathsf{neg}\left(x\right)}}\right) - 2 \]

   9. lower--.f64 N/A

      \[\leadsto \color{blue}{\left(e^{x} + e^{\mathsf{neg}\left(x\right)}\right) - 2} \]

   10. cosh-undef N/A

       \[\leadsto \color{blue}{2 \cdot \cosh x} - 2 \]

   11. lower-*.f64 N/A

       \[\leadsto \color{blue}{2 \cdot \cosh x} - 2 \]

   12. lower-cosh.f64 56.4

       \[\leadsto 2 \cdot \color{blue}{\cosh x} - 2 \]

4. Applied rewrites 56.4%

   \[\leadsto \color{blue}{2 \cdot \cosh x - 2} \]

5. Taylor expanded in x around 0

   \[\leadsto \color{blue}{2} - 2 \]
6. Step-by-step derivation

7. Applied rewrites 52.4%

   \[\leadsto \color{blue}{2} - 2 \]
8. Add Preprocessing

Developer Target 1: 99.9% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := \sinh \left(\frac{x}{2}\right)\\ 4 \cdot \left(t\_0 \cdot t\_0\right) \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (sinh (/ x 2.0)))) (* 4.0 (* t_0 t_0))))

C

double code(double x) {
	double t_0 = sinh((x / 2.0));
	return 4.0 * (t_0 * t_0);
}

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(x)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8) :: t_0
    t_0 = sinh((x / 2.0d0))
    code = 4.0d0 * (t_0 * t_0)
end function

Java

public static double code(double x) {
	double t_0 = Math.sinh((x / 2.0));
	return 4.0 * (t_0 * t_0);
}

Python

def code(x):
	t_0 = math.sinh((x / 2.0))
	return 4.0 * (t_0 * t_0)

Julia

function code(x)
	t_0 = sinh(Float64(x / 2.0))
	return Float64(4.0 * Float64(t_0 * t_0))
end

MATLAB

function tmp = code(x)
	t_0 = sinh((x / 2.0));
	tmp = 4.0 * (t_0 * t_0);
end

Wolfram

code[x_] := Block[{t$95$0 = N[Sinh[N[(x / 2.0), $MachinePrecision]], $MachinePrecision]}, N[(4.0 * N[(t$95$0 * t$95$0), $MachinePrecision]), $MachinePrecision]]

Reproduce

herbie shell --seed 2024364 
(FPCore (x)
  :name "exp2 (problem 3.3.7)"
  :precision binary64
  :pre (<= (fabs x) 710.0)

  :alt
  (! :herbie-platform default (* 4 (* (sinh (/ x 2)) (sinh (/ x 2)))))

  (+ (- (exp x) 2.0) (exp (- x))))