Two window-washers clean windows on the side of a building, reflected in the blue-tinted glass.
Two window washers who are in love with each other, try not to show it as they work.
You can not infer they are in love.
exists e1 s1 s2 x1 x2 x3 x4 x5 x6.(n_glass(x6) & a_blue-tinted(s2) & Theme(s2,x6) & n_side(x3) & a_topic(x1) & on(x1,x3) & of(x3,x4) & in(e1,x6) & Theme(e1,x5) & v_reflect(e1) & (x4 = x5) & n_building(x4) & n_window(x1) & a_clean(s1) & Theme(s1,x1) & of(x1,x2) & n_window-washer(x2) & card_eq_2(x1))
exists p1 x1 x2 x3.(-exists e1 p2.(Topic(e1,p2) & Actor(e1,x1) & v_try(e1) & exists e2 p3.(exists e3.(Actor(e3,x1) & v_work(e3)) & as(e2,p3) & Theme(e2,x2) & Actor(e2,x1) & v_show(e2))) & n_thing(x1) & n_thing(x2) & all x5.(n_other(x5) -> with(p1,x5)) & exists x4.(in(x3,x4) & n_love(x4)) & (x1 = x3) & n_washer(x1) & of(x1,x2) & n_window(x2) & card_eq_2(x1))