Consider a relation R in R defined as
R={(a,b):a<b}
For any a∈R, we have (a,a)∉R since a cannot be strictly less than a itself. In fact, a=a.
∴R is not reflexive.
Now, (1,2)∈R(as1<2)
But, 2 is not less than 1.
∴(2,1)∉R
∴R is not symmetric.
Now, let (a,b),(b,c)∈R.
⇒a<b and b<c
⇒a<c
⇒(a,c)∈R
∴R is transitive.
Hence, relation R is transitive but not reflexive and symmetric.