%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV338-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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:03 EDT 2022
% Result : Unsatisfiable 0.12s 0.41s
% Output : Refutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV338-2 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n024.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 06:51:03 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 n024.cluster.edu,
% 0.12/0.36 Wed Jun 15 06:51:03 2022
% 0.12/0.36 The command was "./sos". The process ID is 31842.
% 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=1, symmetry=0, max_lits=4.
% 0.12/0.36
% 0.12/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.36 clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.12/0.40
% 0.12/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.40
% 0.12/0.40 Stopped by limit on number of solutions
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 -------------- Softie stats --------------
% 0.12/0.40
% 0.12/0.40 UPDATE_STOP: 300
% 0.12/0.40 SFINDER_TIME_LIMIT: 2
% 0.12/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.40 number of clauses in intial UL: 5
% 0.12/0.40 number of clauses initially in problem: 11
% 0.12/0.40 percentage of clauses intially in UL: 45
% 0.12/0.40 percentage of distinct symbols occuring in initial UL: 94
% 0.12/0.40 percent of all initial clauses that are short: 90
% 0.12/0.40 absolute distinct symbol count: 19
% 0.12/0.40 distinct predicate count: 2
% 0.12/0.40 distinct function count: 10
% 0.12/0.40 distinct constant count: 7
% 0.12/0.40
% 0.12/0.40 ---------- no more Softie stats ----------
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.40
% 0.12/0.40 Stopped by limit on number of solutions
% 0.12/0.40
% 0.12/0.40 =========== start of search ===========
% 0.12/0.41
% 0.12/0.41 -------- PROOF --------
% 0.12/0.41 % SZS status Unsatisfiable
% 0.12/0.41 % SZS output start Refutation
% 0.12/0.41
% 0.12/0.41 Model 3 (0.00 seconds, 0 Inserts)
% 0.12/0.41
% 0.12/0.41 Stopped by limit on number of solutions
% 0.12/0.41
% 0.12/0.41 ----> UNIT CONFLICT at 0.02 sec ----> 19 [binary,18.1,4.1] {-} $F.
% 0.12/0.41
% 0.12/0.41 Length of proof is 4. Level of proof is 3.
% 0.12/0.41
% 0.12/0.41 ---------------- PROOF ----------------
% 0.12/0.41 % SZS status Unsatisfiable
% 0.12/0.41 % SZS output start Refutation
% 0.12/0.41
% 0.12/0.41 1 [] {+} -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.12/0.41 2 [] {+} -c_in(A,c_Message_OkeysFor(c_Message_Oparts(c_insert(B,C,tc_Message_Omsg))),tc_nat)| -c_in(B,c_Message_Osynth(c_Message_Oanalz(D)),tc_Message_Omsg)|c_in(A,c_Message_OkeysFor(c_Message_Oparts(c_union(C,D,tc_Message_Omsg))),tc_nat)|c_in(c_Message_Omsg_OKey(c_Message_OinvKey(A)),c_Message_Oparts(D),tc_Message_Omsg).
% 0.12/0.41 3 [] {+} -c_in(A,c_Message_OsymKeys,tc_nat)|c_Message_OinvKey(A)=A.
% 0.12/0.41 4 [] {+} -c_in(c_Message_Omsg_OKey(v_K),c_Event_Oused(v_evsf),tc_Message_Omsg).
% 0.12/0.41 5 [] {-} -c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),tc_nat)|c_in(c_Message_Omsg_OKey(v_K),c_Event_Oused(v_evsf),tc_Message_Omsg).
% 0.12/0.41 6 [copy,5,unit_del,4] {+} -c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),tc_nat).
% 0.12/0.41 8,7 [] {+} c_union(A,A,B)=A.
% 0.12/0.41 9 [] {+} c_in(v_K,c_Message_OsymKeys,tc_nat).
% 0.12/0.41 10 [] {-} c_in(v_X,c_Message_Osynth(c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf))),tc_Message_Omsg).
% 0.12/0.41 11 [] {-} c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_insert(v_X,c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf),tc_Message_Omsg))),tc_nat).
% 0.12/0.41 15,14 [hyper,9,3] {+} c_Message_OinvKey(v_K)=v_K.
% 0.12/0.41 16 [hyper,11,2,10,demod,8,15,unit_del,6] {-} c_in(c_Message_Omsg_OKey(v_K),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evsf)),tc_Message_Omsg).
% 0.12/0.41 18 [hyper,16,1] {-} c_in(c_Message_Omsg_OKey(v_K),c_Event_Oused(v_evsf),tc_Message_Omsg).
% 0.12/0.41 19 [binary,18.1,4.1] {-} $F.
% 0.12/0.41
% 0.12/0.41 % SZS output end Refutation
% 0.12/0.41 ------------ end of proof -------------
% 0.12/0.41
% 0.12/0.41
% 0.12/0.41 Search stopped by max_proofs option.
% 0.12/0.41
% 0.12/0.41
% 0.12/0.41 Search stopped by max_proofs option.
% 0.12/0.41
% 0.12/0.41 ============ end of search ============
% 0.12/0.41
% 0.12/0.41 ----------- soft-scott stats ----------
% 0.12/0.41
% 0.12/0.41 true clauses given 2 (28.6%)
% 0.12/0.41 false clauses given 5
% 0.12/0.41
% 0.12/0.41 FALSE TRUE
% 0.12/0.41 4 0 1
% 0.12/0.41 31 0 1
% 0.12/0.41 tot: 0 2 (100.0% true)
% 0.12/0.41
% 0.12/0.41
% 0.12/0.41 Model 3 (0.00 seconds, 0 Inserts)
% 0.12/0.41
% 0.12/0.41 That finishes the proof of the theorem.
% 0.12/0.41
% 0.12/0.41 Process 31842 finished Wed Jun 15 06:51:03 2022
%------------------------------------------------------------------------------