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

View Problem - Process Solution

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

% Computer : n008.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:37:49 EDT 2022

% Result   : Unsatisfiable 0.20s 0.37s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SWV302-2 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n008.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 : Tue Jun 14 18:06:07 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 n008.cluster.edu,
% 0.12/0.35  Tue Jun 14 18:06:07 2022
% 0.12/0.35  The command was "./sos".  The process ID is 24156.
% 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=3.
% 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 10 during input processing: 0 [copy,10,flip.1] {-} A=A.
% 0.12/0.35  
% 0.12/0.35  ======= end of input processing =======
% 0.20/0.37  
% 0.20/0.37  Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.37  
% 0.20/0.37  Stopped by limit on number of solutions
% 0.20/0.37  
% 0.20/0.37  
% 0.20/0.37  -------------- Softie stats --------------
% 0.20/0.37  
% 0.20/0.37  UPDATE_STOP: 300
% 0.20/0.37  SFINDER_TIME_LIMIT: 2
% 0.20/0.37  SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.37  number of clauses in intial UL: 6
% 0.20/0.37  number of clauses initially in problem: 9
% 0.20/0.37  percentage of clauses intially in UL: 66
% 0.20/0.37  percentage of distinct symbols occuring in initial UL: 92
% 0.20/0.37  percent of all initial clauses that are short: 88
% 0.20/0.37  absolute distinct symbol count: 25
% 0.20/0.37     distinct predicate count: 2
% 0.20/0.37     distinct function count: 11
% 0.20/0.37     distinct constant count: 12
% 0.20/0.37  
% 0.20/0.37  ---------- no more Softie stats ----------
% 0.20/0.37  
% 0.20/0.37  
% 0.20/0.37  
% 0.20/0.37  =========== start of search ===========
% 0.20/0.37  
% 0.20/0.37  -------- PROOF -------- 
% 0.20/0.37  % SZS status Unsatisfiable
% 0.20/0.37  % SZS output start Refutation
% 0.20/0.37  
% 0.20/0.37  ----> UNIT CONFLICT at   0.01 sec ----> 19 [binary,18.1,3.1] {+} $F.
% 0.20/0.37  
% 0.20/0.37  Length of proof is 7.  Level of proof is 5.
% 0.20/0.37  
% 0.20/0.37  ---------------- PROOF ----------------
% 0.20/0.37  % SZS status Unsatisfiable
% 0.20/0.37  % SZS output start Refutation
% 0.20/0.37  
% 0.20/0.37  1 [] {+} c_in(c_Event_Oevent_OSays(c_Message_Oagent_OServer,v_B,c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OCrypt(c_Public_OshrK(v_A),c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OKey(v_K))),c_Message_Omsg_OCrypt(c_Public_OshrK(v_B),c_Message_Omsg_OMPair(v_NB,c_Message_Omsg_OKey(v_K)))))),c_List_Oset(v_evs2,tc_Event_Oevent),tc_Event_Oevent)| -c_in(c_Event_Oevent_OSays(v_B,c_Message_Oagent_OServer,c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_B),c_Message_Omsg_OMPair(A,c_Message_Omsg_OCrypt(c_Public_OshrK(v_B),c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(v_NB,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OAgent(v_B)))))))))),c_List_Oset(v_evs2,tc_Event_Oevent),tc_Event_Oevent)| -c_in(c_Message_Omsg_OCrypt(c_Public_OshrK(v_B),c_Message_Omsg_OMPair(v_NB,c_Message_Omsg_OKey(v_K))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs2)),tc_Message_Omsg).
% 0.20/0.37  2 [] {+} -c_in(c_Message_Omsg_ONonce(v_NBa),c_Event_Oused(v_evs2),tc_Message_Omsg).
% 0.20/0.37  3 [] {+} -c_in(c_Event_Oevent_OSays(c_Message_Oagent_OServer,v_B,c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OCrypt(c_Public_OshrK(v_A),c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OKey(v_K))),c_Message_Omsg_OCrypt(c_Public_OshrK(v_B),c_Message_Omsg_OMPair(v_NB,c_Message_Omsg_OKey(v_K)))))),c_List_Oset(v_evs2,tc_Event_Oevent),tc_Event_Oevent).
% 0.20/0.37  4 [] {+} -c_in(A,c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,B)),tc_Message_Omsg)|c_in(A,c_Event_Oused(B),tc_Message_Omsg).
% 0.20/0.37  5 [] {+} -c_in(c_Message_Omsg_OMPair(A,B),c_Message_Oparts(C),tc_Message_Omsg)|c_in(A,c_Message_Oparts(C),tc_Message_Omsg).
% 0.20/0.37  6 [] {+} -c_in(c_Message_Omsg_OCrypt(A,B),c_Message_Oparts(C),tc_Message_Omsg)|c_in(B,c_Message_Oparts(C),tc_Message_Omsg).
% 0.20/0.37  7 [] {-} c_in(c_Event_Oevent_OSays(v_B,c_Message_Oagent_OServer,c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_B),c_Message_Omsg_OMPair(v_x,c_Message_Omsg_OCrypt(c_Public_OshrK(v_B),c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(v_NB,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OAgent(v_B)))))))))),c_List_Oset(v_evs2,tc_Event_Oevent),tc_Event_Oevent)|v_NB=c_Message_Omsg_ONonce(v_NBa).
% 0.20/0.37  8 [copy,7,flip.2] {-} c_in(c_Event_Oevent_OSays(v_B,c_Message_Oagent_OServer,c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_B),c_Message_Omsg_OMPair(v_x,c_Message_Omsg_OCrypt(c_Public_OshrK(v_B),c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(v_NB,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OAgent(v_B)))))))))),c_List_Oset(v_evs2,tc_Event_Oevent),tc_Event_Oevent)|c_Message_Omsg_ONonce(v_NBa)=v_NB.
% 0.20/0.37  9 [] {-} c_in(c_Message_Omsg_OCrypt(c_Public_OshrK(v_B),c_Message_Omsg_OMPair(v_NB,c_Message_Omsg_OKey(v_K))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs2)),tc_Message_Omsg).
% 0.20/0.37  11 [para_from,8.2.1,2.1.1] {-} -c_in(v_NB,c_Event_Oused(v_evs2),tc_Message_Omsg)|c_in(c_Event_Oevent_OSays(v_B,c_Message_Oagent_OServer,c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_B),c_Message_Omsg_OMPair(v_x,c_Message_Omsg_OCrypt(c_Public_OshrK(v_B),c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(v_NB,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OAgent(v_B)))))))))),c_List_Oset(v_evs2,tc_Event_Oevent),tc_Event_Oevent).
% 0.20/0.37  12 [hyper,9,6] {-} c_in(c_Message_Omsg_OMPair(v_NB,c_Message_Omsg_OKey(v_K)),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs2)),tc_Message_Omsg).
% 0.20/0.37  14 [hyper,12,5] {-} c_in(v_NB,c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs2)),tc_Message_Omsg).
% 0.20/0.37  16 [hyper,14,4] {+} c_in(v_NB,c_Event_Oused(v_evs2),tc_Message_Omsg).
% 0.20/0.37  17 [hyper,16,11] {-} c_in(c_Event_Oevent_OSays(v_B,c_Message_Oagent_OServer,c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_B),c_Message_Omsg_OMPair(v_x,c_Message_Omsg_OCrypt(c_Public_OshrK(v_B),c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(v_NB,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OAgent(v_B)))))))))),c_List_Oset(v_evs2,tc_Event_Oevent),tc_Event_Oevent).
% 0.20/0.37  18 [hyper,17,1,9] {-} c_in(c_Event_Oevent_OSays(c_Message_Oagent_OServer,v_B,c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OCrypt(c_Public_OshrK(v_A),c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OKey(v_K))),c_Message_Omsg_OCrypt(c_Public_OshrK(v_B),c_Message_Omsg_OMPair(v_NB,c_Message_Omsg_OKey(v_K)))))),c_List_Oset(v_evs2,tc_Event_Oevent),tc_Event_Oevent).
% 0.20/0.37  19 [binary,18.1,3.1] {+} $F.
% 0.20/0.37  
% 0.20/0.37  % SZS output end Refutation
% 0.20/0.37  ------------ end of proof -------------
% 0.20/0.37  
% 0.20/0.37  
% 0.20/0.37  Search stopped by max_proofs option.
% 0.20/0.37  
% 0.20/0.37  
% 0.20/0.37  Search stopped by max_proofs option.
% 0.20/0.37  
% 0.20/0.37  ============ end of search ============
% 0.20/0.37  
% 0.20/0.37  ----------- soft-scott stats ----------
% 0.20/0.37  
% 0.20/0.37  true clauses given           3      (30.0%)
% 0.20/0.37  false clauses given          7
% 0.20/0.37  
% 0.20/0.37        FALSE     TRUE
% 0.20/0.37  tot:  0         0      (-nan% true)
% 0.20/0.37  
% 0.20/0.37  
% 0.20/0.37  Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.37  
% 0.20/0.37  That finishes the proof of the theorem.
% 0.20/0.37  
% 0.20/0.37  Process 24156 finished Tue Jun 14 18:06:07 2022
%------------------------------------------------------------------------------