TSTP Solution File: SWV335-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV335-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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:02 EDT 2022
% Result : Unsatisfiable 0.20s 0.39s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWV335-2 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.13 % Command : sos-script %s
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Wed Jun 15 16:08:34 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.37 ----- Otter 3.2, August 2001 -----
% 0.14/0.37 The process was started by sandbox on n020.cluster.edu,
% 0.14/0.37 Wed Jun 15 16:08:34 2022
% 0.14/0.37 The command was "./sos". The process ID is 26709.
% 0.14/0.37
% 0.14/0.37 set(prolog_style_variables).
% 0.14/0.37 set(auto).
% 0.14/0.37 dependent: set(auto1).
% 0.14/0.37 dependent: set(process_input).
% 0.14/0.37 dependent: clear(print_kept).
% 0.14/0.37 dependent: clear(print_new_demod).
% 0.14/0.37 dependent: clear(print_back_demod).
% 0.14/0.37 dependent: clear(print_back_sub).
% 0.14/0.37 dependent: set(control_memory).
% 0.14/0.37 dependent: assign(max_mem, 12000).
% 0.14/0.37 dependent: assign(pick_given_ratio, 4).
% 0.14/0.37 dependent: assign(stats_level, 1).
% 0.14/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.37 dependent: assign(sos_limit, 5000).
% 0.14/0.37 dependent: assign(max_weight, 60).
% 0.14/0.37 clear(print_given).
% 0.14/0.37
% 0.14/0.37 list(usable).
% 0.14/0.37
% 0.14/0.37 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 0.14/0.37
% 0.14/0.37 This is a non-Horn set without equality. The strategy
% 0.14/0.37 will be ordered hyper_res, ur_res, unit deletion, and
% 0.14/0.37 factoring, with satellites in sos and nuclei in usable.
% 0.14/0.37
% 0.14/0.37 dependent: set(hyper_res).
% 0.14/0.37 dependent: set(factor).
% 0.14/0.37 dependent: set(unit_deletion).
% 0.14/0.37
% 0.14/0.37 ------------> process usable:
% 0.14/0.37
% 0.14/0.37 ------------> process sos:
% 0.14/0.37
% 0.14/0.37 ======= end of input processing =======
% 0.20/0.39
% 0.20/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 -------------- Softie stats --------------
% 0.20/0.39
% 0.20/0.39 UPDATE_STOP: 300
% 0.20/0.39 SFINDER_TIME_LIMIT: 2
% 0.20/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.39 number of clauses in intial UL: 8
% 0.20/0.39 number of clauses initially in problem: 10
% 0.20/0.39 percentage of clauses intially in UL: 80
% 0.20/0.39 percentage of distinct symbols occuring in initial UL: 93
% 0.20/0.39 percent of all initial clauses that are short: 100
% 0.20/0.39 absolute distinct symbol count: 15
% 0.20/0.39 distinct predicate count: 1
% 0.20/0.39 distinct function count: 8
% 0.20/0.39 distinct constant count: 6
% 0.20/0.39
% 0.20/0.39 ---------- no more Softie stats ----------
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 =========== start of search ===========
% 0.20/0.39
% 0.20/0.39 -------- PROOF --------
% 0.20/0.39 % SZS status Unsatisfiable
% 0.20/0.39 % SZS output start Refutation
% 0.20/0.39
% 0.20/0.39 ----> UNIT CONFLICT at 0.01 sec ----> 17 [binary,16.1,2.1] {-} $F.
% 0.20/0.39
% 0.20/0.39 Length of proof is 5. Level of proof is 5.
% 0.20/0.39
% 0.20/0.39 ---------------- PROOF ----------------
% 0.20/0.39 % SZS status Unsatisfiable
% 0.20/0.39 % SZS output start Refutation
% 0.20/0.39
% 0.20/0.39 1 [] {+} -c_in(c_Message_Omsg_ONonce(v_NB),c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf)),tc_Message_Omsg).
% 0.20/0.39 2 [] {+} -c_in(c_Message_Omsg_OCrypt(v_K,c_Message_Omsg_ONonce(v_NB)),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf)),tc_Message_Omsg).
% 0.20/0.39 3 [] {+} -c_in(c_Message_Omsg_OCrypt(A,B),c_Message_Osynth(C),tc_Message_Omsg)|c_in(B,c_Message_Osynth(C),tc_Message_Omsg)|c_in(c_Message_Omsg_OCrypt(A,B),C,tc_Message_Omsg).
% 0.20/0.39 4 [] {+} -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.20/0.39 5 [] {+} -c_in(c_Message_Omsg_ONonce(A),c_Message_Osynth(B),tc_Message_Omsg)|c_in(c_Message_Omsg_ONonce(A),B,tc_Message_Omsg).
% 0.20/0.39 6 [] {+} -c_in(A,c_Message_Oanalz(B),tc_Message_Omsg)|c_in(A,c_Message_Oparts(B),tc_Message_Omsg).
% 0.20/0.39 7 [] {+} -c_in(A,c_union(B,C,D),D)|c_in(A,C,D)|c_in(A,B,D).
% 0.20/0.39 9 [] {+} c_in(v_X,c_Message_Osynth(c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),tc_Message_Omsg).
% 0.20/0.39 10 [] {-} c_in(c_Message_Omsg_OCrypt(v_K,c_Message_Omsg_ONonce(v_NB)),c_Message_Oparts(c_insert(v_X,c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf),tc_Message_Omsg)),tc_Message_Omsg).
% 0.20/0.39 11 [hyper,10,4,9] {-} c_in(c_Message_Omsg_OCrypt(v_K,c_Message_Omsg_ONonce(v_NB)),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.20/0.39 12 [hyper,11,7,unit_del,2] {-} c_in(c_Message_Omsg_OCrypt(v_K,c_Message_Omsg_ONonce(v_NB)),c_Message_Osynth(c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),tc_Message_Omsg).
% 0.20/0.39 13 [hyper,12,3] {-} c_in(c_Message_Omsg_ONonce(v_NB),c_Message_Osynth(c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),tc_Message_Omsg)|c_in(c_Message_Omsg_OCrypt(v_K,c_Message_Omsg_ONonce(v_NB)),c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf)),tc_Message_Omsg).
% 0.20/0.39 14 [hyper,13,5,unit_del,1] {-} c_in(c_Message_Omsg_OCrypt(v_K,c_Message_Omsg_ONonce(v_NB)),c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf)),tc_Message_Omsg).
% 0.20/0.39 16 [hyper,14,6] {-} c_in(c_Message_Omsg_OCrypt(v_K,c_Message_Omsg_ONonce(v_NB)),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf)),tc_Message_Omsg).
% 0.20/0.39 17 [binary,16.1,2.1] {-} $F.
% 0.20/0.39
% 0.20/0.39 % SZS output end Refutation
% 0.20/0.39 ------------ end of proof -------------
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 Search stopped by max_proofs option.
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 Search stopped by max_proofs option.
% 0.20/0.39
% 0.20/0.39 ============ end of search ============
% 0.20/0.39
% 0.20/0.39 ----------- soft-scott stats ----------
% 0.20/0.39
% 0.20/0.39 true clauses given 1 (16.7%)
% 0.20/0.39 false clauses given 5
% 0.20/0.39
% 0.20/0.39 FALSE TRUE
% 0.20/0.39 9 1 0
% 0.20/0.39 tot: 1 0 (0.0% true)
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 That finishes the proof of the theorem.
% 0.20/0.39
% 0.20/0.39 Process 26709 finished Wed Jun 15 16:08:34 2022
%------------------------------------------------------------------------------