expfmod (used to be hard to sample)

Average Error: 59.7 → 59.7

Time: 26.3s

Precision: binary64

Cost: 32704

Math

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

↓

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

FPCore

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

↓

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

C

double code(double x) {
	return fmod(exp(x), sqrt(cos(x))) * exp(-x);
}

↓

double code(double x) {
	return (0.0 - (-1.0 - (fmod(exp(x), sqrt(cos(x))) * exp(-x)))) - 1.0;
}

Fortran

real(8) function code(x)
    real(8), intent (in) :: x
    code = mod(exp(x), sqrt(cos(x))) * exp(-x)
end function

↓

real(8) function code(x)
    real(8), intent (in) :: x
    code = (0.0d0 - ((-1.0d0) - (mod(exp(x), sqrt(cos(x))) * exp(-x)))) - 1.0d0
end function

Python

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

↓

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

Julia

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

↓

function code(x)
	return Float64(Float64(0.0 - Float64(-1.0 - Float64(rem(exp(x), sqrt(cos(x))) * exp(Float64(-x))))) - 1.0)
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]

↓

code[x_] := N[(N[(0.0 - N[(-1.0 - 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]), $MachinePrecision]), $MachinePrecision] - 1.0), $MachinePrecision]

Derivation

1. Initial program 59.7

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

2. Applied egg-rr 59.7

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

3. Final simplification 59.7

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

Alternatives

Alternative 1
Error	59.7
Cost	32576

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

Alternative 2
Error	59.7
Cost	32320

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

Alternative 3
Error	59.8
Cost	26240

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

Alternative 4
Error	59.9
Cost	19776

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

Alternative 5
Error	59.9
Cost	19712

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

Alternative 6
Error	59.9
Cost	19520

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

Alternative 7
Error	60.3
Cost	13312

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

Alternative 8
Error	60.3
Cost	13184

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

Alternative 9
Error	60.6
Cost	12928

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

Reproduce

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