TSTP Solution File: SWV321-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV321-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n004.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:56 EDT 2022
% Result : Unsatisfiable 0.89s 1.14s
% Output : Refutation 0.89s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV321-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n004.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jun 15 00:04:24 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox2 on n004.cluster.edu,
% 0.12/0.36 Wed Jun 15 00:04:24 2022
% 0.12/0.36 The command was "./sos". The process ID is 15489.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 0.12/0.36
% 0.12/0.36 This is a non-Horn set without equality. The strategy
% 0.12/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.12/0.38
% 0.12/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 -------------- Softie stats --------------
% 0.12/0.38
% 0.12/0.38 UPDATE_STOP: 300
% 0.12/0.38 SFINDER_TIME_LIMIT: 2
% 0.12/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38 number of clauses in intial UL: 10
% 0.12/0.38 number of clauses initially in problem: 12
% 0.12/0.38 percentage of clauses intially in UL: 83
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.38 percent of all initial clauses that are short: 91
% 0.12/0.38 absolute distinct symbol count: 16
% 0.12/0.38 distinct predicate count: 1
% 0.12/0.38 distinct function count: 8
% 0.12/0.38 distinct constant count: 7
% 0.12/0.38
% 0.12/0.38 ---------- no more Softie stats ----------
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 =========== start of search ===========
% 0.89/1.14
% 0.89/1.14 -------- PROOF --------
% 0.89/1.14 % SZS status Unsatisfiable
% 0.89/1.14 % SZS output start Refutation
% 0.89/1.14
% 0.89/1.14 Stopped by limit on insertions
% 0.89/1.14
% 0.89/1.14 -----> EMPTY CLAUSE at 0.75 sec ----> 278 [hyper,268,2,253] {-} $F.
% 0.89/1.14
% 0.89/1.14 Length of proof is 9. Level of proof is 9.
% 0.89/1.14
% 0.89/1.14 ---------------- PROOF ----------------
% 0.89/1.14 % SZS status Unsatisfiable
% 0.89/1.14 % SZS output start Refutation
% 0.89/1.14
% 0.89/1.14 1 [] {+} c_in(v_A,c_Event_Obad,tc_Message_Oagent)| -c_in(c_Message_Omsg_OKey(c_Public_OshrK(v_A)),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf)),tc_Message_Omsg).
% 0.89/1.14 2 [] {+} -c_in(v_A,c_Event_Obad,tc_Message_Oagent)| -c_in(c_Message_Omsg_OKey(c_Public_OshrK(v_A)),c_Message_Oparts(c_insert(v_X,c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf),tc_Message_Omsg)),tc_Message_Omsg).
% 0.89/1.14 3 [] {+} -c_in(A,c_Message_Oparts(c_insert(B,C,tc_Message_Omsg)),tc_Message_Omsg)| -c_in(B,c_Message_Osynth(c_Message_Oanalz(C)),tc_Message_Omsg)|c_in(A,c_union(c_Message_Osynth(c_Message_Oanalz(C)),c_Message_Oparts(C),tc_Message_Omsg),tc_Message_Omsg).
% 0.89/1.14 4 [] {+} -c_in(c_Message_Omsg_OKey(A),c_Message_Osynth(B),tc_Message_Omsg)|c_in(c_Message_Omsg_OKey(A),B,tc_Message_Omsg).
% 0.89/1.14 5 [] {+} -c_in(A,c_Message_Oanalz(B),tc_Message_Omsg)|c_in(A,c_Message_Oparts(B),tc_Message_Omsg).
% 0.89/1.14 6 [] {+} -c_in(A,B,tc_Message_Omsg)|c_in(A,c_Message_Oparts(B),tc_Message_Omsg).
% 0.89/1.14 7 [] {+} -c_in(A,c_Event_Obad,tc_Message_Oagent)|c_in(c_Message_Omsg_OKey(c_Public_OshrK(A)),c_Event_Oknows(c_Message_Oagent_OSpy,B),tc_Message_Omsg).
% 0.89/1.14 8 [] {+} -c_in(A,c_union(B,C,D),D)|c_in(A,C,D)|c_in(A,B,D).
% 0.89/1.14 9 [] {+} -c_in(A,B,C)|c_in(A,c_insert(D,B,C),C).
% 0.89/1.14 11 [] {-} c_in(v_X,c_Message_Osynth(c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),tc_Message_Omsg).
% 0.89/1.14 12 [] {-} c_in(c_Message_Omsg_OKey(c_Public_OshrK(v_A)),c_Message_Oparts(c_insert(v_X,c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf),tc_Message_Omsg)),tc_Message_Omsg)|c_in(v_A,c_Event_Obad,tc_Message_Oagent).
% 0.89/1.14 25 [hyper,12,3,11] {-} c_in(v_A,c_Event_Obad,tc_Message_Oagent)|c_in(c_Message_Omsg_OKey(c_Public_OshrK(v_A)),c_union(c_Message_Osynth(c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf)),tc_Message_Omsg),tc_Message_Omsg).
% 0.89/1.14 73 [hyper,25,8] {-} c_in(v_A,c_Event_Obad,tc_Message_Oagent)|c_in(c_Message_Omsg_OKey(c_Public_OshrK(v_A)),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf)),tc_Message_Omsg)|c_in(c_Message_Omsg_OKey(c_Public_OshrK(v_A)),c_Message_Osynth(c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),tc_Message_Omsg).
% 0.89/1.14 235 [hyper,73,1,factor_simp] {-} c_in(v_A,c_Event_Obad,tc_Message_Oagent)|c_in(c_Message_Omsg_OKey(c_Public_OshrK(v_A)),c_Message_Osynth(c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),tc_Message_Omsg).
% 0.89/1.14 243 [hyper,235,4] {-} c_in(v_A,c_Event_Obad,tc_Message_Oagent)|c_in(c_Message_Omsg_OKey(c_Public_OshrK(v_A)),c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf)),tc_Message_Omsg).
% 0.89/1.14 248 [hyper,243,5] {-} c_in(v_A,c_Event_Obad,tc_Message_Oagent)|c_in(c_Message_Omsg_OKey(c_Public_OshrK(v_A)),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf)),tc_Message_Omsg).
% 0.89/1.14 253 [hyper,248,1,factor_simp] {-} c_in(v_A,c_Event_Obad,tc_Message_Oagent).
% 0.89/1.14 255 [hyper,253,7] {-} c_in(c_Message_Omsg_OKey(c_Public_OshrK(v_A)),c_Event_Oknows(c_Message_Oagent_OSpy,A),tc_Message_Omsg).
% 0.89/1.14 258 [hyper,255,9] {-} c_in(c_Message_Omsg_OKey(c_Public_OshrK(v_A)),c_insert(A,c_Event_Oknows(c_Message_Oagent_OSpy,B),tc_Message_Omsg),tc_Message_Omsg).
% 0.89/1.14 268 [hyper,258,6] {-} c_in(c_Message_Omsg_OKey(c_Public_OshrK(v_A)),c_Message_Oparts(c_insert(A,c_Event_Oknows(c_Message_Oagent_OSpy,B),tc_Message_Omsg)),tc_Message_Omsg).
% 0.89/1.14 278 [hyper,268,2,253] {-} $F.
% 0.89/1.14
% 0.89/1.14 % SZS output end Refutation
% 0.89/1.14 ------------ end of proof -------------
% 0.89/1.14
% 0.89/1.14
% 0.89/1.14 Search stopped by max_proofs option.
% 0.89/1.14
% 0.89/1.14
% 0.89/1.14 Search stopped by max_proofs option.
% 0.89/1.14
% 0.89/1.14 ============ end of search ============
% 0.89/1.14
% 0.89/1.14 ----------- soft-scott stats ----------
% 0.89/1.14
% 0.89/1.14 true clauses given 0 (0.0%)
% 0.89/1.14 false clauses given 117
% 0.89/1.14
% 0.89/1.14 FALSE TRUE
% 0.89/1.14 12 1 0
% 0.89/1.14 13 3 0
% 0.89/1.14 14 2 0
% 0.89/1.14 15 1 0
% 0.89/1.14 18 4 0
% 0.89/1.14 19 35 0
% 0.89/1.14 20 21 0
% 0.89/1.14 21 24 0
% 0.89/1.14 22 2 0
% 0.89/1.14 tot: 93 0 (0.0% true)
% 0.89/1.14
% 0.89/1.14
% 0.89/1.14 Model 1 (0.00 seconds, 0 Inserts)
% 0.89/1.14
% 0.89/1.14 That finishes the proof of the theorem.
% 0.89/1.14
% 0.89/1.14 Process 15489 finished Wed Jun 15 00:04:24 2022
%------------------------------------------------------------------------------