Yet another Jimmy challenge by his original father. See these other lovely challenges.

As you all know, recently we've been seeing challenges related to Jimmy on platforms. Now, Jimmy is an acrobat as I mentioned before, and he's got other tricks up his sleeve.

One of these tricks is hanging by ropes. Here's an example of a rope Jimmy could hang from:

 ||
 ||
 ||
 ||
 ||
 ||

When Jimmy hangs on a rope, it looks like this:

 ||
 ||
 /o
 ||
 ||
 ||

He can hang on the left or the right of the rope, so this:

 ||
 ||
 ||
 /o
 ||
 ||

is also valid. But he cannot hang by just one body part, so anything like this:

 ||
 ||
 ||
 /o|
 ||
 ||

is invalid. Note that when he is hanging by one body part the other half of the rope is visible because Jimmy does not cover it up.

Also, Jimmy does not like hanging on the bottom of the rope - it scares him - so this:

 ||
 ||
 ||
 ||
 ||
 /o

is invalid.

The challenge

Take input of a Jimmy situation like the ones above, and output whether Jimmy will hang on to the rope or not through a truthy or falsy value.

The specifics

• 
  

  Write a program that takes input. This can be through a function or any other appropriate input method.

  
  
  
  1. The input should be a scene of one Jimmy and a rope as exemplified above.
  
  



• The program should output a truthy or falsy value to the console based on whether Jimmy can hang on to the rope or if he would fall off the rope, respectively.



• 
  

  The criteria for Jimmy being able to hang on the rope:

  
  
  

  1. Two of his body parts are on the rope.

  
  

  2. He is not on the bottom of the rope.

  
  

  3. He is not floating in mid-air.

  
  



• You can assume the rope will be straight, made up of || segments, and will be longer than one character in height.




• You can assume one whole rope and one singular Jimmy will be present in your scene, no more and no less.




• You can assume there will be no trailing newlines at the bottom of the rope.




• You must cover any amount of leading or trailing spaces before and after the rope.

Test cases

 ||
 ||
 || TRUTHY
 /o
 ||
 ||


 ||
 ||
 /o| FALSY
 ||
 ||


 ||
 /o TRUTHY
 ||


 ||
 /o FALSY


 /o
 || TRUTHY


 ||
 ||
 /o || FALSY
 ||
 ||

Scoring

This is code-golf, so lowest score in bytes wins after about a week.

Leaderboard

You can view the leaderboard for this post by expanding the widget/snippet below. In order for your post to be included in the rankings, you need a header (# header text) with the following info:

• The name of the language (end it with a comma , or dash -), followed by...




• The byte count, as the last number to appear in your header.

For example, JavaScript (ES6), 72 bytes is valid, but Fortran, 143 bytes (8-bit) is invalid because the byte count is not the last number in the header (your answer will be recognized as 8 bytes - don't take advantage of this).

<!-- Run the snippet to see the leaderboard. Report any bugs to @xMikee1 on Github. --> <iframe src="https://xmikee1.github.io/ppcg-leaderboard/?id=187759" width="100%" height="100%" style="border:none;">Oops, your browser is too old to view this content! Please upgrade to a newer version of your browser that supports HTML5.</iframe><style>html,bodymargin:0;padding:0;height:100%;overflow:hidden</style>

Python 3, 41 bytes

lambda x:any("|"not in i for i in x[:-1])

A function that takes input as a list of strings, each string being a different line.

-11 bytes thanks to xnor!

Try it online! (If you want to try more test cases, just put a "." after each set of lines in the input box.)

Takes advantage of the fact that if Jimmy is fully on the rope, no parts of the rope (no "|") will be showing. It checks if there are any lines that do not have "|", which means that Jimmy is fully on the rope.

Python 2 or 3, 33 bytes

lambda l:min(map(max,l[:-1]))<'|'

An unnamed function accepting a list of lines

Try it online!

How?

There needs to be a section of rope obscured by Jimmy that is not the bottom one.

lambda l:min(map(max,l[:-1]))<'|'
lambda l: - a function taking l (the lines as strings)
 l[:-1] - strip off the last line
 map(max, ) - maximum of each line (where '|'>'o'>''>'/'>' ')
 min( ) - minimum
 <'|' - is less than '|' (hence not rope since '|' is maximal)

Jelly,  9 7  6 bytes

Ṗ<”|ṀẠ

A monadic Link accepting a list of lines

Try it online!

How?

There needs to be a section of rope obscured by Jimmy that is not the bottom one.

Ṗ<”|ṀẠ - Main Link: list of lines of characters
Ṗ - remove last line
 ”| - pipe character
 < - less than? (vectorises) - Note that all other characters are
 Ṁ - maximum
 Ạ - all?