%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV353-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n003.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Wed Jul 20 21:38:08 EDT 2022
% Result : Unsatisfiable 0.21s 0.45s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWV353-2 : TPTP v8.1.0. Released v3.2.0.
% 0.13/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n003.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Wed Jun 15 02:09:40 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.37 ----- Otter 3.2, August 2001 -----
% 0.21/0.37 The process was started by sandbox on n003.cluster.edu,
% 0.21/0.37 Wed Jun 15 02:09:40 2022
% 0.21/0.37 The command was "./sos". The process ID is 23436.
% 0.21/0.37
% 0.21/0.37 set(prolog_style_variables).
% 0.21/0.37 set(auto).
% 0.21/0.37 dependent: set(auto1).
% 0.21/0.37 dependent: set(process_input).
% 0.21/0.37 dependent: clear(print_kept).
% 0.21/0.37 dependent: clear(print_new_demod).
% 0.21/0.37 dependent: clear(print_back_demod).
% 0.21/0.37 dependent: clear(print_back_sub).
% 0.21/0.37 dependent: set(control_memory).
% 0.21/0.37 dependent: assign(max_mem, 12000).
% 0.21/0.37 dependent: assign(pick_given_ratio, 4).
% 0.21/0.37 dependent: assign(stats_level, 1).
% 0.21/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.21/0.37 dependent: assign(sos_limit, 5000).
% 0.21/0.37 dependent: assign(max_weight, 60).
% 0.21/0.37 clear(print_given).
% 0.21/0.37
% 0.21/0.37 list(usable).
% 0.21/0.37
% 0.21/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.21/0.37
% 0.21/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.21/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.21/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.21/0.37 clauses in usable.
% 0.21/0.37
% 0.21/0.37 dependent: set(knuth_bendix).
% 0.21/0.37 dependent: set(para_from).
% 0.21/0.37 dependent: set(para_into).
% 0.21/0.37 dependent: clear(para_from_right).
% 0.21/0.37 dependent: clear(para_into_right).
% 0.21/0.37 dependent: set(para_from_vars).
% 0.21/0.37 dependent: set(eq_units_both_ways).
% 0.21/0.37 dependent: set(dynamic_demod_all).
% 0.21/0.37 dependent: set(dynamic_demod).
% 0.21/0.37 dependent: set(order_eq).
% 0.21/0.37 dependent: set(back_demod).
% 0.21/0.37 dependent: set(lrpo).
% 0.21/0.37 dependent: set(hyper_res).
% 0.21/0.37 dependent: set(unit_deletion).
% 0.21/0.37 dependent: set(factor).
% 0.21/0.37
% 0.21/0.37 ------------> process usable:
% 0.21/0.37
% 0.21/0.37 ------------> process sos:
% 0.21/0.37 Following clause subsumed by 9 during input processing: 0 [copy,9,flip.1] {-} A=A.
% 0.21/0.37
% 0.21/0.37 ======= end of input processing =======
% 0.21/0.43
% 0.21/0.43 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.43
% 0.21/0.43 Stopped by limit on number of solutions
% 0.21/0.43
% 0.21/0.43
% 0.21/0.43 -------------- Softie stats --------------
% 0.21/0.43
% 0.21/0.43 UPDATE_STOP: 300
% 0.21/0.43 SFINDER_TIME_LIMIT: 2
% 0.21/0.43 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.43 number of clauses in intial UL: 4
% 0.21/0.43 number of clauses initially in problem: 8
% 0.21/0.43 percentage of clauses intially in UL: 50
% 0.21/0.43 percentage of distinct symbols occuring in initial UL: 82
% 0.21/0.43 percent of all initial clauses that are short: 87
% 0.21/0.43 absolute distinct symbol count: 29
% 0.21/0.43 distinct predicate count: 2
% 0.21/0.43 distinct function count: 12
% 0.21/0.43 distinct constant count: 15
% 0.21/0.43
% 0.21/0.43 ---------- no more Softie stats ----------
% 0.21/0.43
% 0.21/0.43
% 0.21/0.43
% 0.21/0.43 =========== start of search ===========
% 0.21/0.45
% 0.21/0.45 -------- PROOF --------
% 0.21/0.45 % SZS status Unsatisfiable
% 0.21/0.45 % SZS output start Refutation
% 0.21/0.45
% 0.21/0.45 ----> UNIT CONFLICT at 0.05 sec ----> 20 [binary,19.1,9.1] {-} $F.
% 0.21/0.45
% 0.21/0.45 Length of proof is 4. Level of proof is 3.
% 0.21/0.45
% 0.21/0.45 ---------------- PROOF ----------------
% 0.21/0.45 % SZS status Unsatisfiable
% 0.21/0.45 % SZS output start Refutation
% 0.21/0.45
% 0.21/0.45 1 [] {+} -c_in(c_Message_Omsg_ONonce(v_NB),c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evso)),tc_Message_Omsg).
% 0.21/0.45 2 [] {-} A!=c_Message_Omsg_OKey(v_K)|v_NA!=v_NAa.
% 0.21/0.45 3 [copy,2,flip.2] {+} A!=c_Message_Omsg_OKey(v_K)|v_NAa!=v_NA.
% 0.21/0.45 4 [] {+} -c_in(A,c_Yahalom_Oyahalom,tc_List_Olist(tc_Event_Oevent))| -c_in(c_Event_Oevent_OSays(c_Message_Oagent_OServer,B,c_Message_Omsg_OMPair(c_Message_Omsg_OCrypt(c_Public_OshrK(B),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(C),c_Message_Omsg_OMPair(D,c_Message_Omsg_OMPair(E,F)))),G)),c_List_Oset(A,tc_Event_Oevent),tc_Event_Oevent)|c_in(c_Event_Oevent_OGets(c_Message_Oagent_OServer,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(C),c_Message_Omsg_OCrypt(c_Public_OshrK(C),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(B),c_Message_Omsg_OMPair(E,F))))),c_List_Oset(A,tc_Event_Oevent),tc_Event_Oevent).
% 0.21/0.45 5 [] {+} -c_in(A,c_Yahalom_Oyahalom,tc_List_Olist(tc_Event_Oevent))| -c_in(c_Event_Oevent_OGets(B,c_Message_Omsg_OMPair(C,c_Message_Omsg_OCrypt(c_Public_OshrK(D),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(E),c_Message_Omsg_OMPair(c_Message_Omsg_ONonce(F),G))))),c_List_Oset(A,tc_Event_Oevent),tc_Event_Oevent)| -c_in(c_Event_Oevent_OSays(H,I,c_Message_Omsg_OMPair(J,c_Message_Omsg_OCrypt(c_Public_OshrK(K),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(L),c_Message_Omsg_OMPair(c_Message_Omsg_ONonce(M),G))))),c_List_Oset(A,tc_Event_Oevent),tc_Event_Oevent)|c_in(G,c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,A)),tc_Message_Omsg)|F=M.
% 0.21/0.45 6 [] {+} c_in(v_evso,c_Yahalom_Oyahalom,tc_List_Olist(tc_Event_Oevent)).
% 0.21/0.45 7 [] {-} c_in(c_Event_Oevent_OSays(c_Message_Oagent_OServer,v_Aa,c_Message_Omsg_OMPair(c_Message_Omsg_OCrypt(c_Public_OshrK(v_Aa),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_Ba),c_Message_Omsg_OMPair(c_Message_Omsg_OKey(v_K),c_Message_Omsg_OMPair(c_Message_Omsg_ONonce(v_NAa),c_Message_Omsg_ONonce(v_NB))))),v_X)),c_List_Oset(v_evso,tc_Event_Oevent),tc_Event_Oevent).
% 0.21/0.45 8 [] {-} c_in(c_Event_Oevent_OSays(v_B,c_Message_Oagent_OServer,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_B),c_Message_Omsg_OCrypt(c_Public_OshrK(v_B),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OMPair(c_Message_Omsg_ONonce(v_NA),c_Message_Omsg_ONonce(v_NB)))))),c_List_Oset(v_evso,tc_Event_Oevent),tc_Event_Oevent).
% 0.21/0.45 9 [] {+} A=A.
% 0.21/0.45 14 [hyper,7,4,6] {-} c_in(c_Event_Oevent_OGets(c_Message_Oagent_OServer,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_Ba),c_Message_Omsg_OCrypt(c_Public_OshrK(v_Ba),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_Aa),c_Message_Omsg_OMPair(c_Message_Omsg_ONonce(v_NAa),c_Message_Omsg_ONonce(v_NB)))))),c_List_Oset(v_evso,tc_Event_Oevent),tc_Event_Oevent).
% 0.21/0.45 16,15 [hyper,14,5,6,8,unit_del,1] {-} v_NAa=v_NA.
% 0.21/0.45 19 [back_demod,3,demod,16,unit_del,9] {-} A!=c_Message_Omsg_OKey(v_K).
% 0.21/0.45 20 [binary,19.1,9.1] {-} $F.
% 0.21/0.45
% 0.21/0.45 % SZS output end Refutation
% 0.21/0.45 ------------ end of proof -------------
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45 Search stopped by max_proofs option.
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45 Search stopped by max_proofs option.
% 0.21/0.45
% 0.21/0.45 ============ end of search ============
% 0.21/0.45
% 0.21/0.45 ----------- soft-scott stats ----------
% 0.21/0.45
% 0.21/0.45 true clauses given 1 (25.0%)
% 0.21/0.45 false clauses given 3
% 0.21/0.45
% 0.21/0.45 FALSE TRUE
% 0.21/0.45 3 0 1
% 0.21/0.45 56 0 4
% 0.21/0.45 tot: 0 5 (100.0% true)
% 0.21/0.45
% 0.21/0.45
% 0.21/0.45 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.45
% 0.21/0.45 That finishes the proof of the theorem.
% 0.21/0.45
% 0.21/0.45 Process 23436 finished Wed Jun 15 02:09:40 2022
%------------------------------------------------------------------------------