Please could you explain the thought process in translating sentences into logical notations?

Under many operating systems, users can schedule a task to be run at a specified time in the future. In Unix-like operating systems, this type of scheduled job is called a cron job. (For example, a backup might run nightly at 2:00am, and a scrratch drive might be emptied out weekly on Friday night at 11:50pm.) Let T={1,2,,tmax} be a set of times (measured in minutes, let's say), and let J be a set of jobs. Let scheduledAt be a predicate so that scheduled At (j,t) is true if and only if job j is scheduled at time t. (Assume that jobs do not last more than one minute.) Formalize the following conditions using only standard quantifiers, arithmetic operators, logical connectives, and the scheduled At predicate. 3.145 There is never more than one job scheduled at the same time. 3.146 Every job is scheduled at least once. 3.147 Job A is never run twice within two minutes. 3.148 Job B is run at least three times. 3.149 Job C is run at most twice. 3.150 Job D is run sometime after the last time that Job E is run. 3.151 Job F is run at least once between consecutive executions of Job G