↑ Up

SOS---2.0.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : SWV306-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:37:51 EDT 2022

% Result   : Unsatisfiable 0.40s 0.58s
% Output   : Refutation 0.40s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWV306-2 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13  % Command  : sos-script %s
% 0.14/0.34  % Computer : n013.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Wed Jun 15 00:46:44 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.14/0.36  ----- Otter 3.2, August 2001 -----
% 0.14/0.36  The process was started by sandbox2 on n013.cluster.edu,
% 0.14/0.36  Wed Jun 15 00:46:44 2022
% 0.14/0.36  The command was "./sos".  The process ID is 6664.
% 0.14/0.36  
% 0.14/0.36  set(prolog_style_variables).
% 0.14/0.36  set(auto).
% 0.14/0.36     dependent: set(auto1).
% 0.14/0.36     dependent: set(process_input).
% 0.14/0.36     dependent: clear(print_kept).
% 0.14/0.36     dependent: clear(print_new_demod).
% 0.14/0.36     dependent: clear(print_back_demod).
% 0.14/0.36     dependent: clear(print_back_sub).
% 0.14/0.36     dependent: set(control_memory).
% 0.14/0.36     dependent: assign(max_mem, 12000).
% 0.14/0.36     dependent: assign(pick_given_ratio, 4).
% 0.14/0.36     dependent: assign(stats_level, 1).
% 0.14/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36     dependent: assign(sos_limit, 5000).
% 0.14/0.36     dependent: assign(max_weight, 60).
% 0.14/0.36  clear(print_given).
% 0.14/0.36  
% 0.14/0.36  list(usable).
% 0.14/0.36  
% 0.14/0.36  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 0.14/0.36  
% 0.14/0.36  This is a Horn set with equality.  The strategy will be
% 0.14/0.36  Knuth-Bendix and hyper_res, with positive clauses in
% 0.14/0.36  sos and nonpositive clauses in usable.
% 0.14/0.36  
% 0.14/0.36     dependent: set(knuth_bendix).
% 0.14/0.36     dependent: set(para_from).
% 0.14/0.36     dependent: set(para_into).
% 0.14/0.36     dependent: clear(para_from_right).
% 0.14/0.36     dependent: clear(para_into_right).
% 0.14/0.36     dependent: set(para_from_vars).
% 0.14/0.36     dependent: set(eq_units_both_ways).
% 0.14/0.36     dependent: set(dynamic_demod_all).
% 0.14/0.36     dependent: set(dynamic_demod).
% 0.14/0.36     dependent: set(order_eq).
% 0.14/0.36     dependent: set(back_demod).
% 0.14/0.36     dependent: set(lrpo).
% 0.14/0.36     dependent: set(hyper_res).
% 0.14/0.36     dependent: clear(order_hyper).
% 0.14/0.36  
% 0.14/0.36  ------------> process usable:
% 0.14/0.36  
% 0.14/0.36  ------------> process sos:
% 0.14/0.36    Following clause subsumed by 11 during input processing: 0 [copy,11,flip.1] {-} A=A.
% 0.14/0.36  
% 0.14/0.36  ======= end of input processing =======
% 0.40/0.58  
% 0.40/0.58  Stopped by limit on insertions
% 0.40/0.58  
% 0.40/0.58  
% 0.40/0.58  Failed to model usable list: disabling FINDER
% 0.40/0.58  
% 0.40/0.58  
% 0.40/0.58  
% 0.40/0.58  -------------- Softie stats --------------
% 0.40/0.58  
% 0.40/0.58  UPDATE_STOP: 300
% 0.40/0.58  SFINDER_TIME_LIMIT: 2
% 0.40/0.58  SHORT_CLAUSE_CUTOFF: 4
% 0.40/0.58  number of clauses in intial UL: 4
% 0.40/0.58  number of clauses initially in problem: 9
% 0.40/0.58  percentage of clauses intially in UL: 44
% 0.40/0.58  percentage of distinct symbols occuring in initial UL: 44
% 0.40/0.58  percent of all initial clauses that are short: 88
% 0.40/0.58  absolute distinct symbol count: 18
% 0.40/0.58     distinct predicate count: 2
% 0.40/0.58     distinct function count: 8
% 0.40/0.58     distinct constant count: 8
% 0.40/0.58  
% 0.40/0.58  ---------- no more Softie stats ----------
% 0.40/0.58  
% 0.40/0.58  
% 0.40/0.58  
% 0.40/0.58  =========== start of search ===========
% 0.40/0.58  
% 0.40/0.58  -------- PROOF -------- 
% 0.40/0.58  % SZS status Unsatisfiable
% 0.40/0.58  % SZS output start Refutation
% 0.40/0.58  
% 0.40/0.58  ----> UNIT CONFLICT at   0.20 sec ----> 23 [binary,22.1,12.1] {-} $F.
% 0.40/0.58  
% 0.40/0.58  Length of proof is 7.  Level of proof is 6.
% 0.40/0.58  
% 0.40/0.58  ---------------- PROOF ----------------
% 0.40/0.58  % SZS status Unsatisfiable
% 0.40/0.58  % SZS output start Refutation
% 0.40/0.58  
% 0.40/0.58  1 [] {-} -c_in(c_Message_Omsg_ONonce(v_NAa),c_Event_Oused(v_evs1),tc_Message_Omsg).
% 0.40/0.58  2 [] {+} -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.40/0.58  3 [] {+} -c_in(c_Message_Omsg_OMPair(A,B),c_Message_Oparts(C),tc_Message_Omsg)|c_in(B,c_Message_Oparts(C),tc_Message_Omsg).
% 0.40/0.58  4 [] {+} -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.40/0.58  5 [] {+} -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.40/0.58  6 [] {-} v_NA=c_Message_Omsg_ONonce(v_NAa).
% 0.40/0.58  8,7 [copy,6,flip.1] {-} c_Message_Omsg_ONonce(v_NAa)=v_NA.
% 0.40/0.58  9 [] {-} c_in(c_Message_Omsg_OCrypt(c_Public_OshrK(v_Aa),c_Message_Omsg_OMPair(v_NA_H,c_Message_Omsg_OMPair(c_Message_Omsg_ONonce(v_NAa),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A_H),c_Message_Omsg_OAgent(v_Aa))))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs1)),tc_Message_Omsg).
% 0.40/0.58  10 [copy,9,demod,8] {-} c_in(c_Message_Omsg_OCrypt(c_Public_OshrK(v_Aa),c_Message_Omsg_OMPair(v_NA_H,c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A_H),c_Message_Omsg_OAgent(v_Aa))))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs1)),tc_Message_Omsg).
% 0.40/0.58  12 [back_demod,1,demod,8] {-} -c_in(v_NA,c_Event_Oused(v_evs1),tc_Message_Omsg).
% 0.40/0.58  13 [hyper,10,5] {-} c_in(c_Message_Omsg_OMPair(v_NA_H,c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A_H),c_Message_Omsg_OAgent(v_Aa)))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs1)),tc_Message_Omsg).
% 0.40/0.58  16 [hyper,13,3] {-} c_in(c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A_H),c_Message_Omsg_OAgent(v_Aa))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs1)),tc_Message_Omsg).
% 0.40/0.58  19 [hyper,16,4] {-} c_in(v_NA,c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs1)),tc_Message_Omsg).
% 0.40/0.58  22 [hyper,19,2] {-} c_in(v_NA,c_Event_Oused(v_evs1),tc_Message_Omsg).
% 0.40/0.58  23 [binary,22.1,12.1] {-} $F.
% 0.40/0.58  
% 0.40/0.58  % SZS output end Refutation
% 0.40/0.58  ------------ end of proof -------------
% 0.40/0.58  
% 0.40/0.58  
% 0.40/0.58  Search stopped by max_proofs option.
% 0.40/0.58  
% 0.40/0.58  
% 0.40/0.58  Search stopped by max_proofs option.
% 0.40/0.58  
% 0.40/0.58  ============ end of search ============
% 0.40/0.58  
% 0.40/0.58  That finishes the proof of the theorem.
% 0.40/0.58  
% 0.40/0.58  Process 6664 finished Wed Jun 15 00:46:44 2022
%------------------------------------------------------------------------------