TSTP Solution File: SWV347-2 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : SWV347-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n013.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:06 EDT 2022

% Result   : Unsatisfiable 0.19s 0.44s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWV347-2 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n013.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Wed Jun 15 12:29:29 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.35  ----- Otter 3.2, August 2001 -----
% 0.12/0.35  The process was started by sandbox2 on n013.cluster.edu,
% 0.12/0.35  Wed Jun 15 12:29:29 2022
% 0.12/0.35  The command was "./sos".  The process ID is 6047.
% 0.12/0.35  
% 0.12/0.35  set(prolog_style_variables).
% 0.12/0.35  set(auto).
% 0.12/0.35     dependent: set(auto1).
% 0.12/0.35     dependent: set(process_input).
% 0.12/0.35     dependent: clear(print_kept).
% 0.12/0.35     dependent: clear(print_new_demod).
% 0.12/0.35     dependent: clear(print_back_demod).
% 0.12/0.35     dependent: clear(print_back_sub).
% 0.12/0.35     dependent: set(control_memory).
% 0.12/0.35     dependent: assign(max_mem, 12000).
% 0.12/0.35     dependent: assign(pick_given_ratio, 4).
% 0.12/0.35     dependent: assign(stats_level, 1).
% 0.12/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35     dependent: assign(sos_limit, 5000).
% 0.12/0.35     dependent: assign(max_weight, 60).
% 0.12/0.35  clear(print_given).
% 0.12/0.35  
% 0.12/0.35  list(usable).
% 0.12/0.35  
% 0.12/0.35  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.12/0.35  
% 0.12/0.35  This ia a non-Horn set with equality.  The strategy will be
% 0.12/0.35  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35  unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35  clauses in usable.
% 0.12/0.35  
% 0.12/0.35     dependent: set(knuth_bendix).
% 0.12/0.35     dependent: set(para_from).
% 0.12/0.35     dependent: set(para_into).
% 0.12/0.35     dependent: clear(para_from_right).
% 0.12/0.35     dependent: clear(para_into_right).
% 0.12/0.35     dependent: set(para_from_vars).
% 0.12/0.35     dependent: set(eq_units_both_ways).
% 0.12/0.35     dependent: set(dynamic_demod_all).
% 0.12/0.35     dependent: set(dynamic_demod).
% 0.12/0.35     dependent: set(order_eq).
% 0.12/0.35     dependent: set(back_demod).
% 0.12/0.35     dependent: set(lrpo).
% 0.12/0.35     dependent: set(hyper_res).
% 0.12/0.35     dependent: set(unit_deletion).
% 0.12/0.35     dependent: set(factor).
% 0.12/0.35  
% 0.12/0.35  ------------> process usable:
% 0.12/0.35  
% 0.12/0.35  ------------> process sos:
% 0.12/0.35    Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] {-} A=A.
% 0.12/0.35  
% 0.12/0.35  ======= end of input processing =======
% 0.19/0.41  
% 0.19/0.41  Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.41  
% 0.19/0.41  Stopped by limit on number of solutions
% 0.19/0.41  
% 0.19/0.41  
% 0.19/0.41  -------------- Softie stats --------------
% 0.19/0.41  
% 0.19/0.41  UPDATE_STOP: 300
% 0.19/0.41  SFINDER_TIME_LIMIT: 2
% 0.19/0.41  SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.41  number of clauses in intial UL: 3
% 0.19/0.41  number of clauses initially in problem: 8
% 0.19/0.41  percentage of clauses intially in UL: 37
% 0.19/0.41  percentage of distinct symbols occuring in initial UL: 78
% 0.19/0.41  percent of all initial clauses that are short: 87
% 0.19/0.41  absolute distinct symbol count: 28
% 0.19/0.41     distinct predicate count: 2
% 0.19/0.41     distinct function count: 11
% 0.19/0.41     distinct constant count: 15
% 0.19/0.41  
% 0.19/0.41  ---------- no more Softie stats ----------
% 0.19/0.41  
% 0.19/0.41  
% 0.19/0.41  
% 0.19/0.41  =========== start of search ===========
% 0.19/0.44  
% 0.19/0.44  -------- PROOF -------- 
% 0.19/0.44  % SZS status Unsatisfiable
% 0.19/0.44  % SZS output start Refutation
% 0.19/0.44  
% 0.19/0.44  ----> UNIT CONFLICT at   0.06 sec ----> 23 [binary,22.1,2.1] {+} $F.
% 0.19/0.44  
% 0.19/0.44  Length of proof is 2.  Level of proof is 2.
% 0.19/0.44  
% 0.19/0.44  ---------------- PROOF ----------------
% 0.19/0.44  % SZS status Unsatisfiable
% 0.19/0.44  % SZS output start Refutation
% 0.19/0.44  
% 0.19/0.44  1 [] {+} -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)|E=L.
% 0.19/0.44  2 [] {+} -c_in(v_A,c_Event_Obad,tc_Message_Oagent).
% 0.19/0.44  3 [] {+} -c_in(c_Message_Omsg_ONonce(v_NB),c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs3)),tc_Message_Omsg).
% 0.19/0.44  4 [] {+} c_in(v_Aa,c_Event_Obad,tc_Message_Oagent).
% 0.19/0.44  5 [] {-} c_in(v_evs3,c_Yahalom_Oyahalom,tc_List_Olist(tc_Event_Oevent)).
% 0.19/0.44  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_evs3,tc_Event_Oevent),tc_Event_Oevent).
% 0.19/0.44  7 [] {+} 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_evs3,tc_Event_Oevent),tc_Event_Oevent).
% 0.19/0.44  17,16 [hyper,7,1,5,6,unit_del,3] {-} v_Aa=v_A.
% 0.19/0.44  22 [back_demod,4,demod,17] {-} c_in(v_A,c_Event_Obad,tc_Message_Oagent).
% 0.19/0.44  23 [binary,22.1,2.1] {+} $F.
% 0.19/0.44  
% 0.19/0.44  % SZS output end Refutation
% 0.19/0.44  ------------ end of proof -------------
% 0.19/0.44  
% 0.19/0.44  
% 0.19/0.44  Search stopped by max_proofs option.
% 0.19/0.44  
% 0.19/0.44  
% 0.19/0.44  Search stopped by max_proofs option.
% 0.19/0.44  
% 0.19/0.44  ============ end of search ============
% 0.19/0.44  
% 0.19/0.44  ----------- soft-scott stats ----------
% 0.19/0.44  
% 0.19/0.44  true clauses given           3      (60.0%)
% 0.19/0.44  false clauses given          2
% 0.19/0.44  
% 0.19/0.44        FALSE     TRUE
% 0.19/0.44    55  0         3
% 0.19/0.44    56  0         4
% 0.19/0.44  tot:  0         7      (100.0% true)
% 0.19/0.44  
% 0.19/0.44  
% 0.19/0.44  Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.44  
% 0.19/0.44  That finishes the proof of the theorem.
% 0.19/0.44  
% 0.19/0.44  Process 6047 finished Wed Jun 15 12:29:29 2022
%------------------------------------------------------------------------------