TSTP Solution File: SWV342-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV342-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n017.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:04 EDT 2022
% Result : Unsatisfiable 0.11s 0.46s
% Output : Refutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SWV342-2 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.07 % Command : sos-script %s
% 0.06/0.26 % Computer : n017.cluster.edu
% 0.06/0.26 % Model : x86_64 x86_64
% 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26 % Memory : 8042.1875MB
% 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26 % CPULimit : 300
% 0.06/0.26 % WCLimit : 600
% 0.06/0.26 % DateTime : Thu Jun 16 01:06:55 EDT 2022
% 0.06/0.26 % CPUTime :
% 0.06/0.28 ----- Otter 3.2, August 2001 -----
% 0.06/0.28 The process was started by sandbox2 on n017.cluster.edu,
% 0.06/0.28 Thu Jun 16 01:06:55 2022
% 0.06/0.28 The command was "./sos". The process ID is 16234.
% 0.06/0.28
% 0.06/0.28 set(prolog_style_variables).
% 0.06/0.28 set(auto).
% 0.06/0.28 dependent: set(auto1).
% 0.06/0.28 dependent: set(process_input).
% 0.06/0.28 dependent: clear(print_kept).
% 0.06/0.28 dependent: clear(print_new_demod).
% 0.06/0.28 dependent: clear(print_back_demod).
% 0.06/0.28 dependent: clear(print_back_sub).
% 0.06/0.28 dependent: set(control_memory).
% 0.06/0.28 dependent: assign(max_mem, 12000).
% 0.06/0.28 dependent: assign(pick_given_ratio, 4).
% 0.06/0.28 dependent: assign(stats_level, 1).
% 0.06/0.28 dependent: assign(pick_semantic_ratio, 3).
% 0.06/0.28 dependent: assign(sos_limit, 5000).
% 0.06/0.28 dependent: assign(max_weight, 60).
% 0.06/0.28 clear(print_given).
% 0.06/0.28
% 0.06/0.28 list(usable).
% 0.06/0.28
% 0.06/0.28 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 0.06/0.28
% 0.06/0.28 This is a Horn set with equality. The strategy will be
% 0.06/0.28 Knuth-Bendix and hyper_res, with positive clauses in
% 0.06/0.28 sos and nonpositive clauses in usable.
% 0.06/0.28
% 0.06/0.28 dependent: set(knuth_bendix).
% 0.06/0.28 dependent: set(para_from).
% 0.06/0.28 dependent: set(para_into).
% 0.06/0.28 dependent: clear(para_from_right).
% 0.06/0.28 dependent: clear(para_into_right).
% 0.06/0.28 dependent: set(para_from_vars).
% 0.06/0.28 dependent: set(eq_units_both_ways).
% 0.06/0.28 dependent: set(dynamic_demod_all).
% 0.06/0.28 dependent: set(dynamic_demod).
% 0.06/0.28 dependent: set(order_eq).
% 0.06/0.28 dependent: set(back_demod).
% 0.06/0.28 dependent: set(lrpo).
% 0.06/0.28 dependent: set(hyper_res).
% 0.06/0.28 dependent: clear(order_hyper).
% 0.06/0.28
% 0.06/0.28 ------------> process usable:
% 0.06/0.28
% 0.06/0.28 ------------> process sos:
% 0.06/0.28 Following clause subsumed by 11 during input processing: 0 [copy,11,flip.1] {-} A=A.
% 0.06/0.28
% 0.06/0.28 ======= end of input processing =======
% 0.06/0.30
% 0.06/0.30 Model 1 (0.00 seconds, 0 Inserts)
% 0.06/0.30
% 0.06/0.30 Stopped by limit on number of solutions
% 0.06/0.30
% 0.06/0.30
% 0.06/0.30 -------------- Softie stats --------------
% 0.06/0.30
% 0.06/0.30 UPDATE_STOP: 300
% 0.06/0.30 SFINDER_TIME_LIMIT: 2
% 0.06/0.30 SHORT_CLAUSE_CUTOFF: 4
% 0.06/0.30 number of clauses in intial UL: 7
% 0.06/0.30 number of clauses initially in problem: 11
% 0.06/0.30 percentage of clauses intially in UL: 63
% 0.06/0.30 percentage of distinct symbols occuring in initial UL: 65
% 0.06/0.30 percent of all initial clauses that are short: 100
% 0.06/0.30 absolute distinct symbol count: 23
% 0.06/0.30 distinct predicate count: 2
% 0.06/0.30 distinct function count: 11
% 0.06/0.30 distinct constant count: 10
% 0.06/0.30
% 0.06/0.30 ---------- no more Softie stats ----------
% 0.06/0.30
% 0.06/0.30
% 0.06/0.30
% 0.06/0.30 =========== start of search ===========
% 0.11/0.46
% 0.11/0.46 -------- PROOF --------
% 0.11/0.46 % SZS status Unsatisfiable
% 0.11/0.46 % SZS output start Refutation
% 0.11/0.46
% 0.11/0.46 Stopped by limit on insertions
% 0.11/0.46
% 0.11/0.46 ----> UNIT CONFLICT at 0.16 sec ----> 31 [binary,30.1,1.1] {-} $F.
% 0.11/0.46
% 0.11/0.46 Length of proof is 7. Level of proof is 6.
% 0.11/0.46
% 0.11/0.46 ---------------- PROOF ----------------
% 0.11/0.46 % SZS status Unsatisfiable
% 0.11/0.46 % SZS output start Refutation
% 0.11/0.46
% 0.11/0.46 1 [] {+} -c_in(c_Message_Omsg_OKey(v_K),c_Event_Oused(v_evs3),tc_Message_Omsg).
% 0.11/0.46 2 [] {+} -c_in(c_Event_Oevent_OSays(A,B,C),c_List_Oset(D,tc_Event_Oevent),tc_Event_Oevent)|c_in(C,c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,D)),tc_Message_Omsg).
% 0.11/0.46 3 [] {+} -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.11/0.46 4 [] {+} -c_in(c_Message_Omsg_OMPair(A,B),c_Message_Oanalz(C),tc_Message_Omsg)|c_in(B,c_Message_Oanalz(C),tc_Message_Omsg).
% 0.11/0.46 5 [] {+} -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.11/0.46 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.11/0.46 7 [] {+} -c_in(A,B,tc_Message_Omsg)|c_in(A,c_Message_Oparts(B),tc_Message_Omsg).
% 0.11/0.46 8 [] {-} c_in(c_Event_Oevent_OSays(c_Message_Oagent_OServer,v_A,c_Message_Omsg_OMPair(c_Message_Omsg_OCrypt(c_Public_OshrK(v_A),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_B),c_Message_Omsg_OMPair(c_Message_Omsg_OKey(v_K),c_Message_Omsg_OMPair(v_na,v_nb)))),c_Message_Omsg_OCrypt(c_Public_OshrK(v_B),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OKey(v_K))))),c_List_Oset(v_evs3,tc_Event_Oevent),tc_Event_Oevent).
% 0.11/0.46 9 [] {-} c_Message_Oparts(c_Message_Oanalz(A))=c_Message_Oparts(A).
% 0.11/0.46 12 [hyper,8,2] {-} c_in(c_Message_Omsg_OMPair(c_Message_Omsg_OCrypt(c_Public_OshrK(v_A),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_B),c_Message_Omsg_OMPair(c_Message_Omsg_OKey(v_K),c_Message_Omsg_OMPair(v_na,v_nb)))),c_Message_Omsg_OCrypt(c_Public_OshrK(v_B),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OKey(v_K)))),c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs3)),tc_Message_Omsg).
% 0.11/0.46 13 [para_from,9.1.1,7.2.2] {-} -c_in(A,c_Message_Oanalz(B),tc_Message_Omsg)|c_in(A,c_Message_Oparts(B),tc_Message_Omsg).
% 0.11/0.46 16 [hyper,12,4] {-} c_in(c_Message_Omsg_OCrypt(c_Public_OshrK(v_B),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OKey(v_K))),c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs3)),tc_Message_Omsg).
% 0.11/0.46 19 [hyper,16,13] {-} c_in(c_Message_Omsg_OCrypt(c_Public_OshrK(v_B),c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OKey(v_K))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs3)),tc_Message_Omsg).
% 0.11/0.46 22 [hyper,19,6] {-} c_in(c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OKey(v_K)),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs3)),tc_Message_Omsg).
% 0.11/0.46 27 [hyper,22,5] {-} c_in(c_Message_Omsg_OKey(v_K),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs3)),tc_Message_Omsg).
% 0.11/0.46 30 [hyper,27,3] {-} c_in(c_Message_Omsg_OKey(v_K),c_Event_Oused(v_evs3),tc_Message_Omsg).
% 0.11/0.46 31 [binary,30.1,1.1] {-} $F.
% 0.11/0.46
% 0.11/0.46 % SZS output end Refutation
% 0.11/0.46 ------------ end of proof -------------
% 0.11/0.46
% 0.11/0.46
% 0.11/0.46 Search stopped by max_proofs option.
% 0.11/0.46
% 0.11/0.46
% 0.11/0.46 Search stopped by max_proofs option.
% 0.11/0.46
% 0.11/0.46 ============ end of search ============
% 0.11/0.46
% 0.11/0.46 ----------- soft-scott stats ----------
% 0.11/0.46
% 0.11/0.46 true clauses given 3 (23.1%)
% 0.11/0.46 false clauses given 10
% 0.11/0.46
% 0.11/0.46 FALSE TRUE
% 0.11/0.46 9 1 0
% 0.11/0.46 12 2 0
% 0.11/0.46 14 1 0
% 0.11/0.46 15 1 0
% 0.11/0.46 25 1 0
% 0.11/0.46 28 1 0
% 0.11/0.46 tot: 7 0 (0.0% true)
% 0.11/0.46
% 0.11/0.46
% 0.11/0.46 Model 1 (0.00 seconds, 0 Inserts)
% 0.11/0.46
% 0.11/0.46 That finishes the proof of the theorem.
% 0.11/0.46
% 0.11/0.46 Process 16234 finished Thu Jun 16 01:06:55 2022
%------------------------------------------------------------------------------