expfmod (used to be hard to sample)

Percentage Accurate: 6.8% → 58.3%

Time: 8.2s

Alternatives: 9

Speedup: 3.9×

• could not determine a ground truth

  1. x = -17160964503.492178

Specification

Math

\[\begin{array}{l} \\ \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* (fmod (exp x) (sqrt (cos x))) (exp (- x))))

C

double code(double x) {
	return fmod(exp(x), sqrt(cos(x))) * 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 = mod(exp(x), sqrt(cos(x))) * exp(-x)
end function

Python

def code(x):
	return math.fmod(math.exp(x), math.sqrt(math.cos(x))) * math.exp(-x)

Julia

function code(x)
	return Float64(rem(exp(x), sqrt(cos(x))) * exp(Float64(-x)))
end

Wolfram

code[x_] := N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]

Initial Program: 6.8% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* (fmod (exp x) (sqrt (cos x))) (exp (- x))))

C

double code(double x) {
	return fmod(exp(x), sqrt(cos(x))) * 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 = mod(exp(x), sqrt(cos(x))) * exp(-x)
end function

Python

def code(x):
	return math.fmod(math.exp(x), math.sqrt(math.cos(x))) * math.exp(-x)

Julia

function code(x)
	return Float64(rem(exp(x), sqrt(cos(x))) * exp(Float64(-x)))
end

Wolfram

code[x_] := N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]

Alternative 1: 58.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := e^{-x}\\ t_1 := \left(1 \bmod \left(\left(\left(e^{\log \left(x \cdot x\right) \cdot -1} - 0.25\right) \cdot x\right) \cdot x\right)\right) \cdot t\_0\\ \mathbf{if}\;x \leq -1 \cdot 10^{-16}:\\ \;\;\;\;\frac{\left(\left(e^{x}\right) \bmod 1\right)}{e^{x}}\\ \mathbf{elif}\;x \leq -1 \cdot 10^{-76}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;x \leq -1 \cdot 10^{-151}:\\ \;\;\;\;\left(1 \bmod \left(\left(\frac{{x}^{-4} - 0.0625}{{x}^{-2} - -0.25} \cdot x\right) \cdot x\right)\right) \cdot t\_0\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (exp (- x)))
        (t_1
         (* (fmod 1.0 (* (* (- (exp (* (log (* x x)) -1.0)) 0.25) x) x)) t_0)))
   (if (<= x -1e-16)
     (/ (fmod (exp x) 1.0) (exp x))
     (if (<= x -1e-76)
       t_1
       (if (<= x -1e-151)
         (*
          (fmod
           1.0
           (* (* (/ (- (pow x -4.0) 0.0625) (- (pow x -2.0) -0.25)) x) x))
          t_0)
         t_1)))))

C

double code(double x) {
	double t_0 = exp(-x);
	double t_1 = fmod(1.0, (((exp((log((x * x)) * -1.0)) - 0.25) * x) * x)) * t_0;
	double tmp;
	if (x <= -1e-16) {
		tmp = fmod(exp(x), 1.0) / exp(x);
	} else if (x <= -1e-76) {
		tmp = t_1;
	} else if (x <= -1e-151) {
		tmp = fmod(1.0, ((((pow(x, -4.0) - 0.0625) / (pow(x, -2.0) - -0.25)) * x) * x)) * t_0;
	} else {
		tmp = t_1;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8) :: t_0
    real(8) :: t_1
    real(8) :: tmp
    t_0 = exp(-x)
    t_1 = mod(1.0d0, (((exp((log((x * x)) * (-1.0d0))) - 0.25d0) * x) * x)) * t_0
    if (x <= (-1d-16)) then
        tmp = mod(exp(x), 1.0d0) / exp(x)
    else if (x <= (-1d-76)) then
        tmp = t_1
    else if (x <= (-1d-151)) then
        tmp = mod(1.0d0, (((((x ** (-4.0d0)) - 0.0625d0) / ((x ** (-2.0d0)) - (-0.25d0))) * x) * x)) * t_0
    else
        tmp = t_1
    end if
    code = tmp
end function

Python

def code(x):
	t_0 = math.exp(-x)
	t_1 = math.fmod(1.0, (((math.exp((math.log((x * x)) * -1.0)) - 0.25) * x) * x)) * t_0
	tmp = 0
	if x <= -1e-16:
		tmp = math.fmod(math.exp(x), 1.0) / math.exp(x)
	elif x <= -1e-76:
		tmp = t_1
	elif x <= -1e-151:
		tmp = math.fmod(1.0, ((((math.pow(x, -4.0) - 0.0625) / (math.pow(x, -2.0) - -0.25)) * x) * x)) * t_0
	else:
		tmp = t_1
	return tmp

Julia

function code(x)
	t_0 = exp(Float64(-x))
	t_1 = Float64(rem(1.0, Float64(Float64(Float64(exp(Float64(log(Float64(x * x)) * -1.0)) - 0.25) * x) * x)) * t_0)
	tmp = 0.0
	if (x <= -1e-16)
		tmp = Float64(rem(exp(x), 1.0) / exp(x));
	elseif (x <= -1e-76)
		tmp = t_1;
	elseif (x <= -1e-151)
		tmp = Float64(rem(1.0, Float64(Float64(Float64(Float64((x ^ -4.0) - 0.0625) / Float64((x ^ -2.0) - -0.25)) * x) * x)) * t_0);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[x_] := Block[{t$95$0 = N[Exp[(-x)], $MachinePrecision]}, Block[{t$95$1 = N[(N[With[{TMP1 = 1.0, TMP2 = N[(N[(N[(N[Exp[N[(N[Log[N[(x * x), $MachinePrecision]], $MachinePrecision] * -1.0), $MachinePrecision]], $MachinePrecision] - 0.25), $MachinePrecision] * x), $MachinePrecision] * x), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * t$95$0), $MachinePrecision]}, If[LessEqual[x, -1e-16], N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] / N[Exp[x], $MachinePrecision]), $MachinePrecision], If[LessEqual[x, -1e-76], t$95$1, If[LessEqual[x, -1e-151], N[(N[With[{TMP1 = 1.0, TMP2 = N[(N[(N[(N[(N[Power[x, -4.0], $MachinePrecision] - 0.0625), $MachinePrecision] / N[(N[Power[x, -2.0], $MachinePrecision] - -0.25), $MachinePrecision]), $MachinePrecision] * x), $MachinePrecision] * x), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * t$95$0), $MachinePrecision], t$95$1]]]]]

Derivation

1. Split input into 3 regimes

2. if x < -9.9999999999999998e-17

   1. Initial program 85.0%

      \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   2. Taylor expanded in x around 0

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

   4. Applied rewrites 84.6%

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

      1. lift-*.f64 N/A

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

      2. lift-neg.f64 N/A

         \[\leadsto \left(\left(e^{x}\right) \bmod 1\right) \cdot e^{\color{blue}{\mathsf{neg}\left(x\right)}} \]

      3. lift-exp.f64 N/A

         \[\leadsto \left(\left(e^{x}\right) \bmod 1\right) \cdot \color{blue}{e^{\mathsf{neg}\left(x\right)}} \]

      4. exp-neg N/A

         \[\leadsto \left(\left(e^{x}\right) \bmod 1\right) \cdot \color{blue}{\frac{1}{e^{x}}} \]

      5. associate-*r/ N/A

         \[\leadsto \color{blue}{\frac{\left(\left(e^{x}\right) \bmod 1\right) \cdot 1}{e^{x}}} \]

      6. lower-/.f64 N/A

         \[\leadsto \color{blue}{\frac{\left(\left(e^{x}\right) \bmod 1\right) \cdot 1}{e^{x}}} \]

      7. lower-*.f64 N/A

         \[\leadsto \frac{\color{blue}{\left(\left(e^{x}\right) \bmod 1\right) \cdot 1}}{e^{x}} \]

      8. lift-exp.f64 85.0

         \[\leadsto \frac{\left(\left(e^{x}\right) \bmod 1\right) \cdot 1}{\color{blue}{e^{x}}} \]

   6. Applied rewrites 85.0%

      \[\leadsto \color{blue}{\frac{\left(\left(e^{x}\right) \bmod 1\right) \cdot 1}{e^{x}}} \]
   7. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \frac{\color{blue}{\left(\left(e^{x}\right) \bmod 1\right) \cdot 1}}{e^{x}} \]

      2. *-rgt-identity 85.0

         \[\leadsto \frac{\color{blue}{\left(\left(e^{x}\right) \bmod 1\right)}}{e^{x}} \]

   8. Applied rewrites 85.0%

      \[\leadsto \color{blue}{\frac{\left(\left(e^{x}\right) \bmod 1\right)}{e^{x}}} \]

   if -9.9999999999999998e-17 < x < -9.99999999999999927e-77 or -9.9999999999999994e-152 < x

   1. Initial program 4.9%

      \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   2. Taylor expanded in x around 0

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   3. Step-by-step derivation

   4. Applied rewrites 26.0%

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   5. Taylor expanded in x around 0

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

      1. +-commutative N/A

         \[\leadsto \left(1 \bmod \left(\frac{-1}{4} \cdot {x}^{2} + \color{blue}{1}\right)\right) \cdot e^{-x} \]

      2. *-commutative N/A

         \[\leadsto \left(1 \bmod \left({x}^{2} \cdot \frac{-1}{4} + 1\right)\right) \cdot e^{-x} \]

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

         \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot e^{-x} \]

      5. lower-*.f64 26.0

         \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)\right) \cdot e^{-x} \]

   7. Applied rewrites 26.0%

      \[\leadsto \left(1 \bmod \color{blue}{\left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)}\right) \cdot e^{-x} \]

   8. Taylor expanded in x around inf

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

      1. *-commutative N/A

         \[\leadsto \left(1 \bmod \left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot {x}^{\color{blue}{2}}\right)\right) \cdot e^{-x} \]

      2. pow2 N/A

         \[\leadsto \left(1 \bmod \left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot \left(x \cdot x\right)\right)\right) \cdot e^{-x} \]

      3. associate-*r* N/A

         \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      5. lower-*.f64 N/A

         \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      6. lower--.f64 N/A

         \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      7. pow-flip N/A

         \[\leadsto \left(1 \bmod \left(\left(\left({x}^{\left(\mathsf{neg}\left(2\right)\right)} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      8. lower-pow.f64 N/A

         \[\leadsto \left(1 \bmod \left(\left(\left({x}^{\left(\mathsf{neg}\left(2\right)\right)} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      9. metadata-eval 48.5

         \[\leadsto \left(1 \bmod \left(\left(\left({x}^{-2} - 0.25\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

   10. Applied rewrites 48.5%

       \[\leadsto \left(1 \bmod \left(\left(\left({x}^{-2} - 0.25\right) \cdot x\right) \cdot \color{blue}{x}\right)\right) \cdot e^{-x} \]
   11. Step-by-step derivation

       1. lift-pow.f64 N/A

          \[\leadsto \left(1 \bmod \left(\left(\left({x}^{-2} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       2. metadata-eval N/A

          \[\leadsto \left(1 \bmod \left(\left(\left({x}^{\left(2 \cdot -1\right)} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       3. pow-pow N/A

          \[\leadsto \left(1 \bmod \left(\left(\left({\left({x}^{2}\right)}^{-1} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       4. pow-to-exp N/A

          \[\leadsto \left(1 \bmod \left(\left(\left(e^{\log \left({x}^{2}\right) \cdot -1} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       5. lower-exp.f64 N/A

          \[\leadsto \left(1 \bmod \left(\left(\left(e^{\log \left({x}^{2}\right) \cdot -1} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       6. lower-*.f64 N/A

          \[\leadsto \left(1 \bmod \left(\left(\left(e^{\log \left({x}^{2}\right) \cdot -1} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       7. lower-log.f64 N/A

          \[\leadsto \left(1 \bmod \left(\left(\left(e^{\log \left({x}^{2}\right) \cdot -1} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       8. pow2 N/A

          \[\leadsto \left(1 \bmod \left(\left(\left(e^{\log \left(x \cdot x\right) \cdot -1} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       9. lift-*.f64 53.1

          \[\leadsto \left(1 \bmod \left(\left(\left(e^{\log \left(x \cdot x\right) \cdot -1} - 0.25\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

   12. Applied rewrites 53.1%

       \[\leadsto \left(1 \bmod \left(\left(\left(e^{\log \left(x \cdot x\right) \cdot -1} - 0.25\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

   if -9.99999999999999927e-77 < x < -9.9999999999999994e-152

   1. Initial program 3.1%

      \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   2. Taylor expanded in x around 0

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   3. Step-by-step derivation

   4. Applied rewrites 3.1%

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   5. Taylor expanded in x around 0

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

      1. +-commutative N/A

         \[\leadsto \left(1 \bmod \left(\frac{-1}{4} \cdot {x}^{2} + \color{blue}{1}\right)\right) \cdot e^{-x} \]

      2. *-commutative N/A

         \[\leadsto \left(1 \bmod \left({x}^{2} \cdot \frac{-1}{4} + 1\right)\right) \cdot e^{-x} \]

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

         \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot e^{-x} \]

      5. lower-*.f64 3.1

         \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)\right) \cdot e^{-x} \]

   7. Applied rewrites 3.1%

      \[\leadsto \left(1 \bmod \color{blue}{\left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)}\right) \cdot e^{-x} \]

   8. Taylor expanded in x around inf

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

      1. *-commutative N/A

         \[\leadsto \left(1 \bmod \left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot {x}^{\color{blue}{2}}\right)\right) \cdot e^{-x} \]

      2. pow2 N/A

         \[\leadsto \left(1 \bmod \left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot \left(x \cdot x\right)\right)\right) \cdot e^{-x} \]

      3. associate-*r* N/A

         \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      5. lower-*.f64 N/A

         \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      6. lower--.f64 N/A

         \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      7. pow-flip N/A

         \[\leadsto \left(1 \bmod \left(\left(\left({x}^{\left(\mathsf{neg}\left(2\right)\right)} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      8. lower-pow.f64 N/A

         \[\leadsto \left(1 \bmod \left(\left(\left({x}^{\left(\mathsf{neg}\left(2\right)\right)} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      9. metadata-eval 9.8

         \[\leadsto \left(1 \bmod \left(\left(\left({x}^{-2} - 0.25\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

   10. Applied rewrites 9.8%

       \[\leadsto \left(1 \bmod \left(\left(\left({x}^{-2} - 0.25\right) \cdot x\right) \cdot \color{blue}{x}\right)\right) \cdot e^{-x} \]
   11. Step-by-step derivation

       1. lift--.f64 N/A

          \[\leadsto \left(1 \bmod \left(\left(\left({x}^{-2} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       2. lift-pow.f64 N/A

          \[\leadsto \left(1 \bmod \left(\left(\left({x}^{-2} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       3. metadata-eval N/A

          \[\leadsto \left(1 \bmod \left(\left(\left({x}^{\left(\mathsf{neg}\left(2\right)\right)} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       4. pow-flip N/A

          \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       5. flip-- N/A

          \[\leadsto \left(1 \bmod \left(\left(\frac{\frac{1}{{x}^{2}} \cdot \frac{1}{{x}^{2}} - \frac{1}{4} \cdot \frac{1}{4}}{\frac{1}{{x}^{2}} + \frac{1}{4}} \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       6. lower-/.f64 N/A

          \[\leadsto \left(1 \bmod \left(\left(\frac{\frac{1}{{x}^{2}} \cdot \frac{1}{{x}^{2}} - \frac{1}{4} \cdot \frac{1}{4}}{\frac{1}{{x}^{2}} + \frac{1}{4}} \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       7. lower--.f64 N/A

          \[\leadsto \left(1 \bmod \left(\left(\frac{\frac{1}{{x}^{2}} \cdot \frac{1}{{x}^{2}} - \frac{1}{4} \cdot \frac{1}{4}}{\frac{1}{{x}^{2}} + \frac{1}{4}} \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       8. pow-flip N/A

          \[\leadsto \left(1 \bmod \left(\left(\frac{{x}^{\left(\mathsf{neg}\left(2\right)\right)} \cdot \frac{1}{{x}^{2}} - \frac{1}{4} \cdot \frac{1}{4}}{\frac{1}{{x}^{2}} + \frac{1}{4}} \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       9. metadata-eval N/A

          \[\leadsto \left(1 \bmod \left(\left(\frac{{x}^{-2} \cdot \frac{1}{{x}^{2}} - \frac{1}{4} \cdot \frac{1}{4}}{\frac{1}{{x}^{2}} + \frac{1}{4}} \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       10. pow-flip N/A

           \[\leadsto \left(1 \bmod \left(\left(\frac{{x}^{-2} \cdot {x}^{\left(\mathsf{neg}\left(2\right)\right)} - \frac{1}{4} \cdot \frac{1}{4}}{\frac{1}{{x}^{2}} + \frac{1}{4}} \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       11. metadata-eval N/A

           \[\leadsto \left(1 \bmod \left(\left(\frac{{x}^{-2} \cdot {x}^{-2} - \frac{1}{4} \cdot \frac{1}{4}}{\frac{1}{{x}^{2}} + \frac{1}{4}} \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       12. pow-prod-up N/A

           \[\leadsto \left(1 \bmod \left(\left(\frac{{x}^{\left(-2 + -2\right)} - \frac{1}{4} \cdot \frac{1}{4}}{\frac{1}{{x}^{2}} + \frac{1}{4}} \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       13. lower-pow.f64 N/A

           \[\leadsto \left(1 \bmod \left(\left(\frac{{x}^{\left(-2 + -2\right)} - \frac{1}{4} \cdot \frac{1}{4}}{\frac{1}{{x}^{2}} + \frac{1}{4}} \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       14. metadata-eval N/A

           \[\leadsto \left(1 \bmod \left(\left(\frac{{x}^{-4} - \frac{1}{4} \cdot \frac{1}{4}}{\frac{1}{{x}^{2}} + \frac{1}{4}} \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       15. metadata-eval N/A

           \[\leadsto \left(1 \bmod \left(\left(\frac{{x}^{-4} - \frac{1}{16}}{\frac{1}{{x}^{2}} + \frac{1}{4}} \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       16. metadata-eval N/A

           \[\leadsto \left(1 \bmod \left(\left(\frac{{x}^{-4} - \frac{1}{16}}{\frac{1}{{x}^{2}} + \frac{1}{2} \cdot \frac{1}{2}} \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

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

           \[\leadsto \left(1 \bmod \left(\left(\frac{{x}^{-4} - \frac{1}{16}}{\frac{1}{{x}^{2}} - \left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot \frac{1}{2}} \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       18. metadata-eval N/A

           \[\leadsto \left(1 \bmod \left(\left(\frac{{x}^{-4} - \frac{1}{16}}{\frac{1}{{x}^{2}} - \frac{-1}{2} \cdot \frac{1}{2}} \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       19. metadata-eval N/A

           \[\leadsto \left(1 \bmod \left(\left(\frac{{x}^{-4} - \frac{1}{16}}{\frac{1}{{x}^{2}} - \frac{-1}{4}} \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       20. lower--.f64 N/A

           \[\leadsto \left(1 \bmod \left(\left(\frac{{x}^{-4} - \frac{1}{16}}{\frac{1}{{x}^{2}} - \frac{-1}{4}} \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       21. pow-flip N/A

           \[\leadsto \left(1 \bmod \left(\left(\frac{{x}^{-4} - \frac{1}{16}}{{x}^{\left(\mathsf{neg}\left(2\right)\right)} - \frac{-1}{4}} \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       22. metadata-eval N/A

           \[\leadsto \left(1 \bmod \left(\left(\frac{{x}^{-4} - \frac{1}{16}}{{x}^{-2} - \frac{-1}{4}} \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       23. lift-pow.f64 99.0

           \[\leadsto \left(1 \bmod \left(\left(\frac{{x}^{-4} - 0.0625}{{x}^{-2} - -0.25} \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

   12. Applied rewrites 99.0%

       \[\leadsto \left(1 \bmod \left(\left(\frac{{x}^{-4} - 0.0625}{{x}^{-2} - -0.25} \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 2: 54.3% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := e^{-x}\\ \mathbf{if}\;\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot t\_0 \leq 0:\\ \;\;\;\;\left(1 \bmod \left(\left(\left(e^{\log \left(x \cdot x\right) \cdot -1} - 0.25\right) \cdot x\right) \cdot x\right)\right) \cdot t\_0\\ \mathbf{else}:\\ \;\;\;\;\left(\left(x - -1\right) \bmod 1\right) \cdot t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (exp (- x))))
   (if (<= (* (fmod (exp x) (sqrt (cos x))) t_0) 0.0)
     (* (fmod 1.0 (* (* (- (exp (* (log (* x x)) -1.0)) 0.25) x) x)) t_0)
     (* (fmod (- x -1.0) 1.0) t_0))))

C

double code(double x) {
	double t_0 = exp(-x);
	double tmp;
	if ((fmod(exp(x), sqrt(cos(x))) * t_0) <= 0.0) {
		tmp = fmod(1.0, (((exp((log((x * x)) * -1.0)) - 0.25) * x) * x)) * t_0;
	} else {
		tmp = fmod((x - -1.0), 1.0) * t_0;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8) :: t_0
    real(8) :: tmp
    t_0 = exp(-x)
    if ((mod(exp(x), sqrt(cos(x))) * t_0) <= 0.0d0) then
        tmp = mod(1.0d0, (((exp((log((x * x)) * (-1.0d0))) - 0.25d0) * x) * x)) * t_0
    else
        tmp = mod((x - (-1.0d0)), 1.0d0) * t_0
    end if
    code = tmp
end function

Python

def code(x):
	t_0 = math.exp(-x)
	tmp = 0
	if (math.fmod(math.exp(x), math.sqrt(math.cos(x))) * t_0) <= 0.0:
		tmp = math.fmod(1.0, (((math.exp((math.log((x * x)) * -1.0)) - 0.25) * x) * x)) * t_0
	else:
		tmp = math.fmod((x - -1.0), 1.0) * t_0
	return tmp

Julia

function code(x)
	t_0 = exp(Float64(-x))
	tmp = 0.0
	if (Float64(rem(exp(x), sqrt(cos(x))) * t_0) <= 0.0)
		tmp = Float64(rem(1.0, Float64(Float64(Float64(exp(Float64(log(Float64(x * x)) * -1.0)) - 0.25) * x) * x)) * t_0);
	else
		tmp = Float64(rem(Float64(x - -1.0), 1.0) * t_0);
	end
	return tmp
end

Wolfram

code[x_] := Block[{t$95$0 = N[Exp[(-x)], $MachinePrecision]}, If[LessEqual[N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * t$95$0), $MachinePrecision], 0.0], N[(N[With[{TMP1 = 1.0, TMP2 = N[(N[(N[(N[Exp[N[(N[Log[N[(x * x), $MachinePrecision]], $MachinePrecision] * -1.0), $MachinePrecision]], $MachinePrecision] - 0.25), $MachinePrecision] * x), $MachinePrecision] * x), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * t$95$0), $MachinePrecision], N[(N[With[{TMP1 = N[(x - -1.0), $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * t$95$0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) < 0.0

   1. Initial program 4.3%

      \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   2. Taylor expanded in x around 0

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   3. Step-by-step derivation

   4. Applied rewrites 4.3%

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   5. Taylor expanded in x around 0

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

      1. +-commutative N/A

         \[\leadsto \left(1 \bmod \left(\frac{-1}{4} \cdot {x}^{2} + \color{blue}{1}\right)\right) \cdot e^{-x} \]

      2. *-commutative N/A

         \[\leadsto \left(1 \bmod \left({x}^{2} \cdot \frac{-1}{4} + 1\right)\right) \cdot e^{-x} \]

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

         \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot e^{-x} \]

      5. lower-*.f64 4.3

         \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)\right) \cdot e^{-x} \]

   7. Applied rewrites 4.3%

      \[\leadsto \left(1 \bmod \color{blue}{\left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)}\right) \cdot e^{-x} \]

   8. Taylor expanded in x around inf

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

      1. *-commutative N/A

         \[\leadsto \left(1 \bmod \left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot {x}^{\color{blue}{2}}\right)\right) \cdot e^{-x} \]

      2. pow2 N/A

         \[\leadsto \left(1 \bmod \left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot \left(x \cdot x\right)\right)\right) \cdot e^{-x} \]

      3. associate-*r* N/A

         \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      5. lower-*.f64 N/A

         \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      6. lower--.f64 N/A

         \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      7. pow-flip N/A

         \[\leadsto \left(1 \bmod \left(\left(\left({x}^{\left(\mathsf{neg}\left(2\right)\right)} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      8. lower-pow.f64 N/A

         \[\leadsto \left(1 \bmod \left(\left(\left({x}^{\left(\mathsf{neg}\left(2\right)\right)} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      9. metadata-eval 31.4

         \[\leadsto \left(1 \bmod \left(\left(\left({x}^{-2} - 0.25\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

   10. Applied rewrites 31.4%

       \[\leadsto \left(1 \bmod \left(\left(\left({x}^{-2} - 0.25\right) \cdot x\right) \cdot \color{blue}{x}\right)\right) \cdot e^{-x} \]
   11. Step-by-step derivation

       1. lift-pow.f64 N/A

          \[\leadsto \left(1 \bmod \left(\left(\left({x}^{-2} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       2. metadata-eval N/A

          \[\leadsto \left(1 \bmod \left(\left(\left({x}^{\left(2 \cdot -1\right)} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       3. pow-pow N/A

          \[\leadsto \left(1 \bmod \left(\left(\left({\left({x}^{2}\right)}^{-1} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       4. pow-to-exp N/A

          \[\leadsto \left(1 \bmod \left(\left(\left(e^{\log \left({x}^{2}\right) \cdot -1} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       5. lower-exp.f64 N/A

          \[\leadsto \left(1 \bmod \left(\left(\left(e^{\log \left({x}^{2}\right) \cdot -1} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       6. lower-*.f64 N/A

          \[\leadsto \left(1 \bmod \left(\left(\left(e^{\log \left({x}^{2}\right) \cdot -1} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       7. lower-log.f64 N/A

          \[\leadsto \left(1 \bmod \left(\left(\left(e^{\log \left({x}^{2}\right) \cdot -1} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       8. pow2 N/A

          \[\leadsto \left(1 \bmod \left(\left(\left(e^{\log \left(x \cdot x\right) \cdot -1} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       9. lift-*.f64 42.5

          \[\leadsto \left(1 \bmod \left(\left(\left(e^{\log \left(x \cdot x\right) \cdot -1} - 0.25\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

   12. Applied rewrites 42.5%

       \[\leadsto \left(1 \bmod \left(\left(\left(e^{\log \left(x \cdot x\right) \cdot -1} - 0.25\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

   if 0.0 < (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x)))

   1. Initial program 14.5%

      \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   2. Taylor expanded in x around 0

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   3. Step-by-step derivation

   4. Applied rewrites 81.8%

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   5. Taylor expanded in x around 0

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

      1. +-commutative N/A

         \[\leadsto \left(1 \bmod \left(\frac{-1}{4} \cdot {x}^{2} + \color{blue}{1}\right)\right) \cdot e^{-x} \]

      2. *-commutative N/A

         \[\leadsto \left(1 \bmod \left({x}^{2} \cdot \frac{-1}{4} + 1\right)\right) \cdot e^{-x} \]

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

         \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot e^{-x} \]

      5. lower-*.f64 81.7

         \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)\right) \cdot e^{-x} \]

   7. Applied rewrites 81.7%

      \[\leadsto \left(1 \bmod \color{blue}{\left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)}\right) \cdot e^{-x} \]

   8. Taylor expanded in x around 0

      \[\leadsto \left(1 \bmod 1\right) \cdot e^{-x} \]
   9. Step-by-step derivation

   10. Applied rewrites 80.8%

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

   11. Taylor expanded in x around 0

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

       1. +-commutative N/A

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

       2. metadata-eval N/A

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

       3. metadata-eval N/A

          \[\leadsto \left(\left(x + \left(\mathsf{neg}\left(-1\right)\right) \cdot 1\right) \bmod 1\right) \cdot e^{-x} \]

       4. fp-cancel-sub-sign N/A

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

       5. metadata-eval N/A

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

       6. lower--.f64 90.5

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

   13. Applied rewrites 90.5%

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

Alternative 3: 47.3% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := e^{-x}\\ \mathbf{if}\;\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot t\_0 \leq 0:\\ \;\;\;\;\left(1 \bmod \left(\left(\mathsf{fma}\left(\frac{-1}{x}, \frac{-1}{x}, -0.25\right) \cdot x\right) \cdot x\right)\right) \cdot t\_0\\ \mathbf{else}:\\ \;\;\;\;\left(\left(x - -1\right) \bmod 1\right) \cdot t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (exp (- x))))
   (if (<= (* (fmod (exp x) (sqrt (cos x))) t_0) 0.0)
     (* (fmod 1.0 (* (* (fma (/ -1.0 x) (/ -1.0 x) -0.25) x) x)) t_0)
     (* (fmod (- x -1.0) 1.0) t_0))))

C

double code(double x) {
	double t_0 = exp(-x);
	double tmp;
	if ((fmod(exp(x), sqrt(cos(x))) * t_0) <= 0.0) {
		tmp = fmod(1.0, ((fma((-1.0 / x), (-1.0 / x), -0.25) * x) * x)) * t_0;
	} else {
		tmp = fmod((x - -1.0), 1.0) * t_0;
	}
	return tmp;
}

Julia

function code(x)
	t_0 = exp(Float64(-x))
	tmp = 0.0
	if (Float64(rem(exp(x), sqrt(cos(x))) * t_0) <= 0.0)
		tmp = Float64(rem(1.0, Float64(Float64(fma(Float64(-1.0 / x), Float64(-1.0 / x), -0.25) * x) * x)) * t_0);
	else
		tmp = Float64(rem(Float64(x - -1.0), 1.0) * t_0);
	end
	return tmp
end

Wolfram

code[x_] := Block[{t$95$0 = N[Exp[(-x)], $MachinePrecision]}, If[LessEqual[N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * t$95$0), $MachinePrecision], 0.0], N[(N[With[{TMP1 = 1.0, TMP2 = N[(N[(N[(N[(-1.0 / x), $MachinePrecision] * N[(-1.0 / x), $MachinePrecision] + -0.25), $MachinePrecision] * x), $MachinePrecision] * x), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * t$95$0), $MachinePrecision], N[(N[With[{TMP1 = N[(x - -1.0), $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * t$95$0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) < 0.0

   1. Initial program 4.3%

      \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   2. Taylor expanded in x around 0

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   3. Step-by-step derivation

   4. Applied rewrites 4.3%

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   5. Taylor expanded in x around 0

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

      1. +-commutative N/A

         \[\leadsto \left(1 \bmod \left(\frac{-1}{4} \cdot {x}^{2} + \color{blue}{1}\right)\right) \cdot e^{-x} \]

      2. *-commutative N/A

         \[\leadsto \left(1 \bmod \left({x}^{2} \cdot \frac{-1}{4} + 1\right)\right) \cdot e^{-x} \]

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

         \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot e^{-x} \]

      5. lower-*.f64 4.3

         \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)\right) \cdot e^{-x} \]

   7. Applied rewrites 4.3%

      \[\leadsto \left(1 \bmod \color{blue}{\left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)}\right) \cdot e^{-x} \]

   8. Taylor expanded in x around inf

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

      1. *-commutative N/A

         \[\leadsto \left(1 \bmod \left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot {x}^{\color{blue}{2}}\right)\right) \cdot e^{-x} \]

      2. pow2 N/A

         \[\leadsto \left(1 \bmod \left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot \left(x \cdot x\right)\right)\right) \cdot e^{-x} \]

      3. associate-*r* N/A

         \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      5. lower-*.f64 N/A

         \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      6. lower--.f64 N/A

         \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      7. pow-flip N/A

         \[\leadsto \left(1 \bmod \left(\left(\left({x}^{\left(\mathsf{neg}\left(2\right)\right)} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      8. lower-pow.f64 N/A

         \[\leadsto \left(1 \bmod \left(\left(\left({x}^{\left(\mathsf{neg}\left(2\right)\right)} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      9. metadata-eval 31.4

         \[\leadsto \left(1 \bmod \left(\left(\left({x}^{-2} - 0.25\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

   10. Applied rewrites 31.4%

       \[\leadsto \left(1 \bmod \left(\left(\left({x}^{-2} - 0.25\right) \cdot x\right) \cdot \color{blue}{x}\right)\right) \cdot e^{-x} \]
   11. Step-by-step derivation

       1. lift--.f64 N/A

          \[\leadsto \left(1 \bmod \left(\left(\left({x}^{-2} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       2. lift-pow.f64 N/A

          \[\leadsto \left(1 \bmod \left(\left(\left({x}^{-2} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       3. metadata-eval N/A

          \[\leadsto \left(1 \bmod \left(\left(\left({x}^{\left(\mathsf{neg}\left(2\right)\right)} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       4. pow-flip N/A

          \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       5. metadata-eval N/A

          \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{2} \cdot \frac{1}{2}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

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

          \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} + \left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot \frac{1}{2}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       7. metadata-eval N/A

          \[\leadsto \left(1 \bmod \left(\left(\left(\frac{-1 \cdot -1}{{x}^{2}} + \left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot \frac{1}{2}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       8. pow2 N/A

          \[\leadsto \left(1 \bmod \left(\left(\left(\frac{-1 \cdot -1}{x \cdot x} + \left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot \frac{1}{2}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       9. times-frac N/A

          \[\leadsto \left(1 \bmod \left(\left(\left(\frac{-1}{x} \cdot \frac{-1}{x} + \left(\mathsf{neg}\left(\frac{1}{2}\right)\right) \cdot \frac{1}{2}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       10. metadata-eval N/A

           \[\leadsto \left(1 \bmod \left(\left(\left(\frac{-1}{x} \cdot \frac{-1}{x} + \frac{-1}{2} \cdot \frac{1}{2}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       11. metadata-eval N/A

           \[\leadsto \left(1 \bmod \left(\left(\left(\frac{-1}{x} \cdot \frac{-1}{x} + \frac{-1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       12. lower-fma.f64 N/A

           \[\leadsto \left(1 \bmod \left(\left(\mathsf{fma}\left(\frac{-1}{x}, \frac{-1}{x}, \frac{-1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       13. lower-/.f64 N/A

           \[\leadsto \left(1 \bmod \left(\left(\mathsf{fma}\left(\frac{-1}{x}, \frac{-1}{x}, \frac{-1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       14. lower-/.f64 33.1

           \[\leadsto \left(1 \bmod \left(\left(\mathsf{fma}\left(\frac{-1}{x}, \frac{-1}{x}, -0.25\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

   12. Applied rewrites 33.1%

       \[\leadsto \left(1 \bmod \left(\left(\mathsf{fma}\left(\frac{-1}{x}, \frac{-1}{x}, -0.25\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

   if 0.0 < (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x)))

   1. Initial program 14.5%

      \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   2. Taylor expanded in x around 0

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   3. Step-by-step derivation

   4. Applied rewrites 81.8%

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   5. Taylor expanded in x around 0

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

      1. +-commutative N/A

         \[\leadsto \left(1 \bmod \left(\frac{-1}{4} \cdot {x}^{2} + \color{blue}{1}\right)\right) \cdot e^{-x} \]

      2. *-commutative N/A

         \[\leadsto \left(1 \bmod \left({x}^{2} \cdot \frac{-1}{4} + 1\right)\right) \cdot e^{-x} \]

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

         \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot e^{-x} \]

      5. lower-*.f64 81.7

         \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)\right) \cdot e^{-x} \]

   7. Applied rewrites 81.7%

      \[\leadsto \left(1 \bmod \color{blue}{\left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)}\right) \cdot e^{-x} \]

   8. Taylor expanded in x around 0

      \[\leadsto \left(1 \bmod 1\right) \cdot e^{-x} \]
   9. Step-by-step derivation

   10. Applied rewrites 80.8%

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

   11. Taylor expanded in x around 0

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

       1. +-commutative N/A

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

       2. metadata-eval N/A

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

       3. metadata-eval N/A

          \[\leadsto \left(\left(x + \left(\mathsf{neg}\left(-1\right)\right) \cdot 1\right) \bmod 1\right) \cdot e^{-x} \]

       4. fp-cancel-sub-sign N/A

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

       5. metadata-eval N/A

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

       6. lower--.f64 90.5

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

   13. Applied rewrites 90.5%

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

Alternative 4: 46.7% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := e^{-x}\\ \mathbf{if}\;\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot t\_0 \leq 0:\\ \;\;\;\;\left(1 \bmod \left(\left(\left(\frac{1}{x \cdot x} - 0.25\right) \cdot x\right) \cdot x\right)\right) \cdot t\_0\\ \mathbf{else}:\\ \;\;\;\;\left(\left(x - -1\right) \bmod 1\right) \cdot t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (let* ((t_0 (exp (- x))))
   (if (<= (* (fmod (exp x) (sqrt (cos x))) t_0) 0.0)
     (* (fmod 1.0 (* (* (- (/ 1.0 (* x x)) 0.25) x) x)) t_0)
     (* (fmod (- x -1.0) 1.0) t_0))))

C

double code(double x) {
	double t_0 = exp(-x);
	double tmp;
	if ((fmod(exp(x), sqrt(cos(x))) * t_0) <= 0.0) {
		tmp = fmod(1.0, ((((1.0 / (x * x)) - 0.25) * x) * x)) * t_0;
	} else {
		tmp = fmod((x - -1.0), 1.0) * t_0;
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8) :: t_0
    real(8) :: tmp
    t_0 = exp(-x)
    if ((mod(exp(x), sqrt(cos(x))) * t_0) <= 0.0d0) then
        tmp = mod(1.0d0, ((((1.0d0 / (x * x)) - 0.25d0) * x) * x)) * t_0
    else
        tmp = mod((x - (-1.0d0)), 1.0d0) * t_0
    end if
    code = tmp
end function

Python

def code(x):
	t_0 = math.exp(-x)
	tmp = 0
	if (math.fmod(math.exp(x), math.sqrt(math.cos(x))) * t_0) <= 0.0:
		tmp = math.fmod(1.0, ((((1.0 / (x * x)) - 0.25) * x) * x)) * t_0
	else:
		tmp = math.fmod((x - -1.0), 1.0) * t_0
	return tmp

Julia

function code(x)
	t_0 = exp(Float64(-x))
	tmp = 0.0
	if (Float64(rem(exp(x), sqrt(cos(x))) * t_0) <= 0.0)
		tmp = Float64(rem(1.0, Float64(Float64(Float64(Float64(1.0 / Float64(x * x)) - 0.25) * x) * x)) * t_0);
	else
		tmp = Float64(rem(Float64(x - -1.0), 1.0) * t_0);
	end
	return tmp
end

Wolfram

code[x_] := Block[{t$95$0 = N[Exp[(-x)], $MachinePrecision]}, If[LessEqual[N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * t$95$0), $MachinePrecision], 0.0], N[(N[With[{TMP1 = 1.0, TMP2 = N[(N[(N[(N[(1.0 / N[(x * x), $MachinePrecision]), $MachinePrecision] - 0.25), $MachinePrecision] * x), $MachinePrecision] * x), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * t$95$0), $MachinePrecision], N[(N[With[{TMP1 = N[(x - -1.0), $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * t$95$0), $MachinePrecision]]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) < 0.0

   1. Initial program 4.3%

      \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   2. Taylor expanded in x around 0

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   3. Step-by-step derivation

   4. Applied rewrites 4.3%

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   5. Taylor expanded in x around 0

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

      1. +-commutative N/A

         \[\leadsto \left(1 \bmod \left(\frac{-1}{4} \cdot {x}^{2} + \color{blue}{1}\right)\right) \cdot e^{-x} \]

      2. *-commutative N/A

         \[\leadsto \left(1 \bmod \left({x}^{2} \cdot \frac{-1}{4} + 1\right)\right) \cdot e^{-x} \]

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

         \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot e^{-x} \]

      5. lower-*.f64 4.3

         \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)\right) \cdot e^{-x} \]

   7. Applied rewrites 4.3%

      \[\leadsto \left(1 \bmod \color{blue}{\left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)}\right) \cdot e^{-x} \]

   8. Taylor expanded in x around inf

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

      1. *-commutative N/A

         \[\leadsto \left(1 \bmod \left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot {x}^{\color{blue}{2}}\right)\right) \cdot e^{-x} \]

      2. pow2 N/A

         \[\leadsto \left(1 \bmod \left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot \left(x \cdot x\right)\right)\right) \cdot e^{-x} \]

      3. associate-*r* N/A

         \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      5. lower-*.f64 N/A

         \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      6. lower--.f64 N/A

         \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      7. pow-flip N/A

         \[\leadsto \left(1 \bmod \left(\left(\left({x}^{\left(\mathsf{neg}\left(2\right)\right)} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      8. lower-pow.f64 N/A

         \[\leadsto \left(1 \bmod \left(\left(\left({x}^{\left(\mathsf{neg}\left(2\right)\right)} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      9. metadata-eval 31.4

         \[\leadsto \left(1 \bmod \left(\left(\left({x}^{-2} - 0.25\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

   10. Applied rewrites 31.4%

       \[\leadsto \left(1 \bmod \left(\left(\left({x}^{-2} - 0.25\right) \cdot x\right) \cdot \color{blue}{x}\right)\right) \cdot e^{-x} \]
   11. Step-by-step derivation

       1. lift-pow.f64 N/A

          \[\leadsto \left(1 \bmod \left(\left(\left({x}^{-2} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       2. metadata-eval N/A

          \[\leadsto \left(1 \bmod \left(\left(\left({x}^{\left(\mathsf{neg}\left(2\right)\right)} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       3. pow-flip N/A

          \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       4. lower-/.f64 N/A

          \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       5. pow2 N/A

          \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{x \cdot x} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

       6. lift-*.f64 32.4

          \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{x \cdot x} - 0.25\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

   12. Applied rewrites 32.4%

       \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{x \cdot x} - 0.25\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

   if 0.0 < (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x)))

   1. Initial program 14.5%

      \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   2. Taylor expanded in x around 0

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   3. Step-by-step derivation

   4. Applied rewrites 81.8%

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   5. Taylor expanded in x around 0

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

      1. +-commutative N/A

         \[\leadsto \left(1 \bmod \left(\frac{-1}{4} \cdot {x}^{2} + \color{blue}{1}\right)\right) \cdot e^{-x} \]

      2. *-commutative N/A

         \[\leadsto \left(1 \bmod \left({x}^{2} \cdot \frac{-1}{4} + 1\right)\right) \cdot e^{-x} \]

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

         \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot e^{-x} \]

      5. lower-*.f64 81.7

         \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)\right) \cdot e^{-x} \]

   7. Applied rewrites 81.7%

      \[\leadsto \left(1 \bmod \color{blue}{\left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)}\right) \cdot e^{-x} \]

   8. Taylor expanded in x around 0

      \[\leadsto \left(1 \bmod 1\right) \cdot e^{-x} \]
   9. Step-by-step derivation

   10. Applied rewrites 80.8%

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

   11. Taylor expanded in x around 0

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

       1. +-commutative N/A

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

       2. metadata-eval N/A

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

       3. metadata-eval N/A

          \[\leadsto \left(\left(x + \left(\mathsf{neg}\left(-1\right)\right) \cdot 1\right) \bmod 1\right) \cdot e^{-x} \]

       4. fp-cancel-sub-sign N/A

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

       5. metadata-eval N/A

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

       6. lower--.f64 90.5

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

   13. Applied rewrites 90.5%

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

Alternative 5: 25.5% accurate, 0.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \leq 2:\\ \;\;\;\;\left(\left(x - -1\right) \bmod \left(\sqrt{1}\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(0.5, x, -1\right), x, 1\right)\\ \mathbf{else}:\\ \;\;\;\;\left(1 \bmod 1\right) \cdot 1\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= (* (fmod (exp x) (sqrt (cos x))) (exp (- x))) 2.0)
   (* (fmod (- x -1.0) (sqrt 1.0)) (fma (fma 0.5 x -1.0) x 1.0))
   (* (fmod 1.0 1.0) 1.0)))

C

double code(double x) {
	double tmp;
	if ((fmod(exp(x), sqrt(cos(x))) * exp(-x)) <= 2.0) {
		tmp = fmod((x - -1.0), sqrt(1.0)) * fma(fma(0.5, x, -1.0), x, 1.0);
	} else {
		tmp = fmod(1.0, 1.0) * 1.0;
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (Float64(rem(exp(x), sqrt(cos(x))) * exp(Float64(-x))) <= 2.0)
		tmp = Float64(rem(Float64(x - -1.0), sqrt(1.0)) * fma(fma(0.5, x, -1.0), x, 1.0));
	else
		tmp = Float64(rem(1.0, 1.0) * 1.0);
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[N[(N[With[{TMP1 = N[Exp[x], $MachinePrecision], TMP2 = N[Sqrt[N[Cos[x], $MachinePrecision]], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision], 2.0], N[(N[With[{TMP1 = N[(x - -1.0), $MachinePrecision], TMP2 = N[Sqrt[1.0], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[(N[(0.5 * x + -1.0), $MachinePrecision] * x + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[With[{TMP1 = 1.0, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x))) < 2

   1. Initial program 8.6%

      \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   2. Taylor expanded in x around 0

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   3. Step-by-step derivation

   4. Applied rewrites 4.5%

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 4.2%

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

   8. Taylor expanded in x around 0

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

      1. +-commutative N/A

         \[\leadsto \left(1 \bmod \left(\sqrt{1}\right)\right) \cdot \left(x \cdot \left(\frac{1}{2} \cdot x - 1\right) + \color{blue}{1}\right) \]

      2. *-commutative N/A

         \[\leadsto \left(1 \bmod \left(\sqrt{1}\right)\right) \cdot \left(\left(\frac{1}{2} \cdot x - 1\right) \cdot x + 1\right) \]

      3. lower-fma.f64 N/A

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

      4. metadata-eval N/A

         \[\leadsto \left(1 \bmod \left(\sqrt{1}\right)\right) \cdot \mathsf{fma}\left(\frac{1}{2} \cdot x - 1 \cdot 1, x, 1\right) \]

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

         \[\leadsto \left(1 \bmod \left(\sqrt{1}\right)\right) \cdot \mathsf{fma}\left(\frac{1}{2} \cdot x + \left(\mathsf{neg}\left(1\right)\right) \cdot 1, x, 1\right) \]

      6. metadata-eval N/A

         \[\leadsto \left(1 \bmod \left(\sqrt{1}\right)\right) \cdot \mathsf{fma}\left(\frac{1}{2} \cdot x + -1 \cdot 1, x, 1\right) \]

      7. metadata-eval N/A

         \[\leadsto \left(1 \bmod \left(\sqrt{1}\right)\right) \cdot \mathsf{fma}\left(\frac{1}{2} \cdot x + -1, x, 1\right) \]

      8. lower-fma.f64 4.2

         \[\leadsto \left(1 \bmod \left(\sqrt{1}\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(0.5, x, -1\right), x, 1\right) \]

   10. Applied rewrites 4.2%

       \[\leadsto \left(1 \bmod \left(\sqrt{1}\right)\right) \cdot \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, x, -1\right), x, 1\right)} \]

   11. Taylor expanded in x around 0

       \[\leadsto \left(\color{blue}{\left(1 + x\right)} \bmod \left(\sqrt{1}\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, x, -1\right), x, 1\right) \]
   12. Step-by-step derivation

       1. +-commutative N/A

          \[\leadsto \left(\left(x + \color{blue}{1}\right) \bmod \left(\sqrt{1}\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, x, -1\right), x, 1\right) \]

       2. metadata-eval N/A

          \[\leadsto \left(\left(x + 1 \cdot \color{blue}{1}\right) \bmod \left(\sqrt{1}\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, x, -1\right), x, 1\right) \]

       3. metadata-eval N/A

          \[\leadsto \left(\left(x + \left(\mathsf{neg}\left(-1\right)\right) \cdot 1\right) \bmod \left(\sqrt{1}\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, x, -1\right), x, 1\right) \]

       4. fp-cancel-sub-sign N/A

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

       5. metadata-eval N/A

          \[\leadsto \left(\left(x - -1\right) \bmod \left(\sqrt{1}\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, x, -1\right), x, 1\right) \]

       6. lower--.f64 7.2

          \[\leadsto \left(\left(x - \color{blue}{-1}\right) \bmod \left(\sqrt{1}\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(0.5, x, -1\right), x, 1\right) \]

   13. Applied rewrites 7.2%

       \[\leadsto \left(\color{blue}{\left(x - -1\right)} \bmod \left(\sqrt{1}\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(0.5, x, -1\right), x, 1\right) \]

   if 2 < (*.f64 (fmod.f64 (exp.f64 x) (sqrt.f64 (cos.f64 x))) (exp.f64 (neg.f64 x)))

   1. Initial program 0.0%

      \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   2. Taylor expanded in x around 0

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   3. Step-by-step derivation

   4. Applied rewrites 98.1%

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   5. Taylor expanded in x around 0

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

      1. +-commutative N/A

         \[\leadsto \left(1 \bmod \left(\frac{-1}{4} \cdot {x}^{2} + \color{blue}{1}\right)\right) \cdot e^{-x} \]

      2. *-commutative N/A

         \[\leadsto \left(1 \bmod \left({x}^{2} \cdot \frac{-1}{4} + 1\right)\right) \cdot e^{-x} \]

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

         \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot e^{-x} \]

      5. lower-*.f64 98.1

         \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)\right) \cdot e^{-x} \]

   7. Applied rewrites 98.1%

      \[\leadsto \left(1 \bmod \color{blue}{\left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)}\right) \cdot e^{-x} \]

   8. Taylor expanded in x around 0

      \[\leadsto \left(1 \bmod 1\right) \cdot e^{-x} \]
   9. Step-by-step derivation

   10. Applied rewrites 98.1%

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

   11. Taylor expanded in x around 0

       \[\leadsto \left(1 \bmod 1\right) \cdot \color{blue}{1} \]
   12. Step-by-step derivation

   13. Applied rewrites 98.1%

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

Alternative 6: 45.5% accurate, 1.8× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq -1 \cdot 10^{-309}:\\ \;\;\;\;\left(1 \bmod \left(\left(\left({x}^{-2} - 0.25\right) \cdot x\right) \cdot x\right)\right) \cdot 1\\ \mathbf{else}:\\ \;\;\;\;\left(\left(x - -1\right) \bmod 1\right) \cdot e^{-x}\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x -1e-309)
   (* (fmod 1.0 (* (* (- (pow x -2.0) 0.25) x) x)) 1.0)
   (* (fmod (- x -1.0) 1.0) (exp (- x)))))

C

double code(double x) {
	double tmp;
	if (x <= -1e-309) {
		tmp = fmod(1.0, (((pow(x, -2.0) - 0.25) * x) * x)) * 1.0;
	} else {
		tmp = fmod((x - -1.0), 1.0) * exp(-x);
	}
	return tmp;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(x)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8) :: tmp
    if (x <= (-1d-309)) then
        tmp = mod(1.0d0, ((((x ** (-2.0d0)) - 0.25d0) * x) * x)) * 1.0d0
    else
        tmp = mod((x - (-1.0d0)), 1.0d0) * exp(-x)
    end if
    code = tmp
end function

Python

def code(x):
	tmp = 0
	if x <= -1e-309:
		tmp = math.fmod(1.0, (((math.pow(x, -2.0) - 0.25) * x) * x)) * 1.0
	else:
		tmp = math.fmod((x - -1.0), 1.0) * math.exp(-x)
	return tmp

Julia

function code(x)
	tmp = 0.0
	if (x <= -1e-309)
		tmp = Float64(rem(1.0, Float64(Float64(Float64((x ^ -2.0) - 0.25) * x) * x)) * 1.0);
	else
		tmp = Float64(rem(Float64(x - -1.0), 1.0) * exp(Float64(-x)));
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[x, -1e-309], N[(N[With[{TMP1 = 1.0, TMP2 = N[(N[(N[(N[Power[x, -2.0], $MachinePrecision] - 0.25), $MachinePrecision] * x), $MachinePrecision] * x), $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * 1.0), $MachinePrecision], N[(N[With[{TMP1 = N[(x - -1.0), $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < -1.000000000000002e-309

   1. Initial program 8.6%

      \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   2. Taylor expanded in x around 0

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   3. Step-by-step derivation

   4. Applied rewrites 3.4%

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   5. Taylor expanded in x around 0

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

      1. +-commutative N/A

         \[\leadsto \left(1 \bmod \left(\frac{-1}{4} \cdot {x}^{2} + \color{blue}{1}\right)\right) \cdot e^{-x} \]

      2. *-commutative N/A

         \[\leadsto \left(1 \bmod \left({x}^{2} \cdot \frac{-1}{4} + 1\right)\right) \cdot e^{-x} \]

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

         \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot e^{-x} \]

      5. lower-*.f64 3.4

         \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)\right) \cdot e^{-x} \]

   7. Applied rewrites 3.4%

      \[\leadsto \left(1 \bmod \color{blue}{\left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)}\right) \cdot e^{-x} \]

   8. Taylor expanded in x around inf

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

      1. *-commutative N/A

         \[\leadsto \left(1 \bmod \left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot {x}^{\color{blue}{2}}\right)\right) \cdot e^{-x} \]

      2. pow2 N/A

         \[\leadsto \left(1 \bmod \left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot \left(x \cdot x\right)\right)\right) \cdot e^{-x} \]

      3. associate-*r* N/A

         \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      4. lower-*.f64 N/A

         \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      5. lower-*.f64 N/A

         \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      6. lower--.f64 N/A

         \[\leadsto \left(1 \bmod \left(\left(\left(\frac{1}{{x}^{2}} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      7. pow-flip N/A

         \[\leadsto \left(1 \bmod \left(\left(\left({x}^{\left(\mathsf{neg}\left(2\right)\right)} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      8. lower-pow.f64 N/A

         \[\leadsto \left(1 \bmod \left(\left(\left({x}^{\left(\mathsf{neg}\left(2\right)\right)} - \frac{1}{4}\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

      9. metadata-eval 55.1

         \[\leadsto \left(1 \bmod \left(\left(\left({x}^{-2} - 0.25\right) \cdot x\right) \cdot x\right)\right) \cdot e^{-x} \]

   10. Applied rewrites 55.1%

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

   11. Taylor expanded in x around 0

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

   13. Applied rewrites 56.4%

       \[\leadsto \left(1 \bmod \left(\left(\left({x}^{-2} - 0.25\right) \cdot x\right) \cdot x\right)\right) \cdot \color{blue}{1} \]

   if -1.000000000000002e-309 < x

   1. Initial program 5.7%

      \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   2. Taylor expanded in x around 0

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   3. Step-by-step derivation

   4. Applied rewrites 37.0%

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   5. Taylor expanded in x around 0

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

      1. +-commutative N/A

         \[\leadsto \left(1 \bmod \left(\frac{-1}{4} \cdot {x}^{2} + \color{blue}{1}\right)\right) \cdot e^{-x} \]

      2. *-commutative N/A

         \[\leadsto \left(1 \bmod \left({x}^{2} \cdot \frac{-1}{4} + 1\right)\right) \cdot e^{-x} \]

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

         \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot e^{-x} \]

      5. lower-*.f64 37.0

         \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)\right) \cdot e^{-x} \]

   7. Applied rewrites 37.0%

      \[\leadsto \left(1 \bmod \color{blue}{\left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)}\right) \cdot e^{-x} \]

   8. Taylor expanded in x around 0

      \[\leadsto \left(1 \bmod 1\right) \cdot e^{-x} \]
   9. Step-by-step derivation

   10. Applied rewrites 36.8%

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

   11. Taylor expanded in x around 0

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

       1. +-commutative N/A

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

       2. metadata-eval N/A

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

       3. metadata-eval N/A

          \[\leadsto \left(\left(x + \left(\mathsf{neg}\left(-1\right)\right) \cdot 1\right) \bmod 1\right) \cdot e^{-x} \]

       4. fp-cancel-sub-sign N/A

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

       5. metadata-eval N/A

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

       6. lower--.f64 38.1

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

   13. Applied rewrites 38.1%

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

Alternative 7: 25.5% accurate, 2.0× speedup

Math

\[\begin{array}{l} \\ \left(\left(x - -1\right) \bmod 1\right) \cdot e^{-x} \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* (fmod (- x -1.0) 1.0) (exp (- x))))

C

double code(double x) {
	return fmod((x - -1.0), 1.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 = mod((x - (-1.0d0)), 1.0d0) * exp(-x)
end function

Python

def code(x):
	return math.fmod((x - -1.0), 1.0) * math.exp(-x)

Julia

function code(x)
	return Float64(rem(Float64(x - -1.0), 1.0) * exp(Float64(-x)))
end

Wolfram

code[x_] := N[(N[With[{TMP1 = N[(x - -1.0), $MachinePrecision], TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[Exp[(-x)], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 6.8%

   \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

2. Taylor expanded in x around 0

   \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
3. Step-by-step derivation

4. Applied rewrites 23.4%

   \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

5. Taylor expanded in x around 0

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

   1. +-commutative N/A

      \[\leadsto \left(1 \bmod \left(\frac{-1}{4} \cdot {x}^{2} + \color{blue}{1}\right)\right) \cdot e^{-x} \]

   2. *-commutative N/A

      \[\leadsto \left(1 \bmod \left({x}^{2} \cdot \frac{-1}{4} + 1\right)\right) \cdot e^{-x} \]

   3. lower-fma.f64 N/A

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

   4. unpow2 N/A

      \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot e^{-x} \]

   5. lower-*.f64 23.4

      \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)\right) \cdot e^{-x} \]

7. Applied rewrites 23.4%

   \[\leadsto \left(1 \bmod \color{blue}{\left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)}\right) \cdot e^{-x} \]

8. Taylor expanded in x around 0

   \[\leadsto \left(1 \bmod 1\right) \cdot e^{-x} \]
9. Step-by-step derivation

10. Applied rewrites 23.2%

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

11. Taylor expanded in x around 0

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

    1. +-commutative N/A

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

    2. metadata-eval N/A

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

    3. metadata-eval N/A

       \[\leadsto \left(\left(x + \left(\mathsf{neg}\left(-1\right)\right) \cdot 1\right) \bmod 1\right) \cdot e^{-x} \]

    4. fp-cancel-sub-sign N/A

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

    5. metadata-eval N/A

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

    6. lower--.f64 25.5

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

13. Applied rewrites 25.5%

    \[\leadsto \left(\color{blue}{\left(x - -1\right)} \bmod 1\right) \cdot e^{-x} \]
14. Add Preprocessing

Alternative 8: 25.9% accurate, 2.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;x \leq 50:\\ \;\;\;\;\left(\left(\mathsf{fma}\left(\mathsf{fma}\left(0.5, x, 1\right), x, 1\right)\right) \bmod \left(\sqrt{1}\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(0.5, x, -1\right), x, 1\right)\\ \mathbf{else}:\\ \;\;\;\;\left(1 \bmod 1\right) \cdot 1\\ \end{array} \end{array} \]

FPCore

(FPCore (x)
 :precision binary64
 (if (<= x 50.0)
   (*
    (fmod (fma (fma 0.5 x 1.0) x 1.0) (sqrt 1.0))
    (fma (fma 0.5 x -1.0) x 1.0))
   (* (fmod 1.0 1.0) 1.0)))

C

double code(double x) {
	double tmp;
	if (x <= 50.0) {
		tmp = fmod(fma(fma(0.5, x, 1.0), x, 1.0), sqrt(1.0)) * fma(fma(0.5, x, -1.0), x, 1.0);
	} else {
		tmp = fmod(1.0, 1.0) * 1.0;
	}
	return tmp;
}

Julia

function code(x)
	tmp = 0.0
	if (x <= 50.0)
		tmp = Float64(rem(fma(fma(0.5, x, 1.0), x, 1.0), sqrt(1.0)) * fma(fma(0.5, x, -1.0), x, 1.0));
	else
		tmp = Float64(rem(1.0, 1.0) * 1.0);
	end
	return tmp
end

Wolfram

code[x_] := If[LessEqual[x, 50.0], N[(N[With[{TMP1 = N[(N[(0.5 * x + 1.0), $MachinePrecision] * x + 1.0), $MachinePrecision], TMP2 = N[Sqrt[1.0], $MachinePrecision]}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * N[(N[(0.5 * x + -1.0), $MachinePrecision] * x + 1.0), $MachinePrecision]), $MachinePrecision], N[(N[With[{TMP1 = 1.0, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * 1.0), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if x < 50

   1. Initial program 8.5%

      \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   2. Taylor expanded in x around 0

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   3. Step-by-step derivation

   4. Applied rewrites 4.5%

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   5. Taylor expanded in x around 0

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

   7. Applied rewrites 4.2%

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

   8. Taylor expanded in x around 0

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

      1. +-commutative N/A

         \[\leadsto \left(1 \bmod \left(\sqrt{1}\right)\right) \cdot \left(x \cdot \left(\frac{1}{2} \cdot x - 1\right) + \color{blue}{1}\right) \]

      2. *-commutative N/A

         \[\leadsto \left(1 \bmod \left(\sqrt{1}\right)\right) \cdot \left(\left(\frac{1}{2} \cdot x - 1\right) \cdot x + 1\right) \]

      3. lower-fma.f64 N/A

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

      4. metadata-eval N/A

         \[\leadsto \left(1 \bmod \left(\sqrt{1}\right)\right) \cdot \mathsf{fma}\left(\frac{1}{2} \cdot x - 1 \cdot 1, x, 1\right) \]

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

         \[\leadsto \left(1 \bmod \left(\sqrt{1}\right)\right) \cdot \mathsf{fma}\left(\frac{1}{2} \cdot x + \left(\mathsf{neg}\left(1\right)\right) \cdot 1, x, 1\right) \]

      6. metadata-eval N/A

         \[\leadsto \left(1 \bmod \left(\sqrt{1}\right)\right) \cdot \mathsf{fma}\left(\frac{1}{2} \cdot x + -1 \cdot 1, x, 1\right) \]

      7. metadata-eval N/A

         \[\leadsto \left(1 \bmod \left(\sqrt{1}\right)\right) \cdot \mathsf{fma}\left(\frac{1}{2} \cdot x + -1, x, 1\right) \]

      8. lower-fma.f64 4.2

         \[\leadsto \left(1 \bmod \left(\sqrt{1}\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(0.5, x, -1\right), x, 1\right) \]

   10. Applied rewrites 4.2%

       \[\leadsto \left(1 \bmod \left(\sqrt{1}\right)\right) \cdot \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, x, -1\right), x, 1\right)} \]

   11. Taylor expanded in x around 0

       \[\leadsto \left(\color{blue}{\left(1 + x \cdot \left(1 + \frac{1}{2} \cdot x\right)\right)} \bmod \left(\sqrt{1}\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, x, -1\right), x, 1\right) \]
   12. Step-by-step derivation

       1. +-commutative N/A

          \[\leadsto \left(\left(x \cdot \left(1 + \frac{1}{2} \cdot x\right) + \color{blue}{1}\right) \bmod \left(\sqrt{1}\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, x, -1\right), x, 1\right) \]

       2. *-commutative N/A

          \[\leadsto \left(\left(\left(1 + \frac{1}{2} \cdot x\right) \cdot x + 1\right) \bmod \left(\sqrt{1}\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, x, -1\right), x, 1\right) \]

       3. lower-fma.f64 N/A

          \[\leadsto \left(\left(\mathsf{fma}\left(1 + \frac{1}{2} \cdot x, \color{blue}{x}, 1\right)\right) \bmod \left(\sqrt{1}\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, x, -1\right), x, 1\right) \]

       4. +-commutative N/A

          \[\leadsto \left(\left(\mathsf{fma}\left(\frac{1}{2} \cdot x + 1, x, 1\right)\right) \bmod \left(\sqrt{1}\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, x, -1\right), x, 1\right) \]

       5. lower-fma.f64 7.6

          \[\leadsto \left(\left(\mathsf{fma}\left(\mathsf{fma}\left(0.5, x, 1\right), x, 1\right)\right) \bmod \left(\sqrt{1}\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(0.5, x, -1\right), x, 1\right) \]

   13. Applied rewrites 7.6%

       \[\leadsto \left(\color{blue}{\left(\mathsf{fma}\left(\mathsf{fma}\left(0.5, x, 1\right), x, 1\right)\right)} \bmod \left(\sqrt{1}\right)\right) \cdot \mathsf{fma}\left(\mathsf{fma}\left(0.5, x, -1\right), x, 1\right) \]

   if 50 < x

   1. Initial program 0.1%

      \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   2. Taylor expanded in x around 0

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
   3. Step-by-step derivation

   4. Applied rewrites 99.7%

      \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

   5. Taylor expanded in x around 0

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

      1. +-commutative N/A

         \[\leadsto \left(1 \bmod \left(\frac{-1}{4} \cdot {x}^{2} + \color{blue}{1}\right)\right) \cdot e^{-x} \]

      2. *-commutative N/A

         \[\leadsto \left(1 \bmod \left({x}^{2} \cdot \frac{-1}{4} + 1\right)\right) \cdot e^{-x} \]

      3. lower-fma.f64 N/A

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

      4. unpow2 N/A

         \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot e^{-x} \]

      5. lower-*.f64 99.7

         \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)\right) \cdot e^{-x} \]

   7. Applied rewrites 99.7%

      \[\leadsto \left(1 \bmod \color{blue}{\left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)}\right) \cdot e^{-x} \]

   8. Taylor expanded in x around 0

      \[\leadsto \left(1 \bmod 1\right) \cdot e^{-x} \]
   9. Step-by-step derivation

   10. Applied rewrites 99.7%

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

   11. Taylor expanded in x around 0

       \[\leadsto \left(1 \bmod 1\right) \cdot \color{blue}{1} \]
   12. Step-by-step derivation

   13. Applied rewrites 99.7%

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

Alternative 9: 23.2% accurate, 3.9× speedup

Math

\[\begin{array}{l} \\ \left(1 \bmod 1\right) \cdot 1 \end{array} \]

FPCore

(FPCore (x) :precision binary64 (* (fmod 1.0 1.0) 1.0))

C

double code(double x) {
	return fmod(1.0, 1.0) * 1.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
    code = mod(1.0d0, 1.0d0) * 1.0d0
end function

Python

def code(x):
	return math.fmod(1.0, 1.0) * 1.0

Julia

function code(x)
	return Float64(rem(1.0, 1.0) * 1.0)
end

Wolfram

code[x_] := N[(N[With[{TMP1 = 1.0, TMP2 = 1.0}, Mod[Abs[TMP1], Abs[TMP2]] * Sign[TMP1]], $MachinePrecision] * 1.0), $MachinePrecision]

Derivation

1. Initial program 6.8%

   \[\left(\left(e^{x}\right) \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

2. Taylor expanded in x around 0

   \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]
3. Step-by-step derivation

4. Applied rewrites 23.4%

   \[\leadsto \left(\color{blue}{1} \bmod \left(\sqrt{\cos x}\right)\right) \cdot e^{-x} \]

5. Taylor expanded in x around 0

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

   1. +-commutative N/A

      \[\leadsto \left(1 \bmod \left(\frac{-1}{4} \cdot {x}^{2} + \color{blue}{1}\right)\right) \cdot e^{-x} \]

   2. *-commutative N/A

      \[\leadsto \left(1 \bmod \left({x}^{2} \cdot \frac{-1}{4} + 1\right)\right) \cdot e^{-x} \]

   3. lower-fma.f64 N/A

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

   4. unpow2 N/A

      \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, \frac{-1}{4}, 1\right)\right)\right) \cdot e^{-x} \]

   5. lower-*.f64 23.4

      \[\leadsto \left(1 \bmod \left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)\right) \cdot e^{-x} \]

7. Applied rewrites 23.4%

   \[\leadsto \left(1 \bmod \color{blue}{\left(\mathsf{fma}\left(x \cdot x, -0.25, 1\right)\right)}\right) \cdot e^{-x} \]

8. Taylor expanded in x around 0

   \[\leadsto \left(1 \bmod 1\right) \cdot e^{-x} \]
9. Step-by-step derivation

10. Applied rewrites 23.2%

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

11. Taylor expanded in x around 0

    \[\leadsto \left(1 \bmod 1\right) \cdot \color{blue}{1} \]
12. Step-by-step derivation

13. Applied rewrites 23.2%

    \[\leadsto \left(1 \bmod 1\right) \cdot \color{blue}{1} \]
14. Add Preprocessing

Reproduce

herbie shell --seed 2025095 
(FPCore (x)
  :name "expfmod (used to be hard to sample)"
  :precision binary64
  (* (fmod (exp x) (sqrt (cos x))) (exp (- x))))