%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV357-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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:10 EDT 2022
% Result : Unsatisfiable 0.11s 0.38s
% Output : Refutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV357-2 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : sos-script %s
% 0.11/0.33 % Computer : n027.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Thu Jun 16 00:22:35 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.11/0.35 ----- Otter 3.2, August 2001 -----
% 0.11/0.35 The process was started by sandbox2 on n027.cluster.edu,
% 0.11/0.35 Thu Jun 16 00:22:35 2022
% 0.11/0.35 The command was "./sos". The process ID is 19613.
% 0.11/0.35
% 0.11/0.35 set(prolog_style_variables).
% 0.11/0.35 set(auto).
% 0.11/0.35 dependent: set(auto1).
% 0.11/0.35 dependent: set(process_input).
% 0.11/0.35 dependent: clear(print_kept).
% 0.11/0.35 dependent: clear(print_new_demod).
% 0.11/0.35 dependent: clear(print_back_demod).
% 0.11/0.35 dependent: clear(print_back_sub).
% 0.11/0.35 dependent: set(control_memory).
% 0.11/0.35 dependent: assign(max_mem, 12000).
% 0.11/0.35 dependent: assign(pick_given_ratio, 4).
% 0.11/0.35 dependent: assign(stats_level, 1).
% 0.11/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.11/0.35 dependent: assign(sos_limit, 5000).
% 0.11/0.35 dependent: assign(max_weight, 60).
% 0.11/0.35 clear(print_given).
% 0.11/0.35
% 0.11/0.35 list(usable).
% 0.11/0.35
% 0.11/0.35 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.11/0.35
% 0.11/0.35 This is a Horn set without equality. The strategy will
% 0.11/0.35 be hyperresolution, with satellites in sos and nuclei
% 0.11/0.35 in usable.
% 0.11/0.35
% 0.11/0.35 dependent: set(hyper_res).
% 0.11/0.35 dependent: clear(order_hyper).
% 0.11/0.35
% 0.11/0.35 ------------> process usable:
% 0.11/0.35
% 0.11/0.35 ------------> process sos:
% 0.11/0.35
% 0.11/0.35 ======= end of input processing =======
% 0.11/0.37
% 0.11/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.11/0.37
% 0.11/0.37 Stopped by limit on number of solutions
% 0.11/0.37
% 0.11/0.37
% 0.11/0.37 -------------- Softie stats --------------
% 0.11/0.37
% 0.11/0.37 UPDATE_STOP: 300
% 0.11/0.37 SFINDER_TIME_LIMIT: 2
% 0.11/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.11/0.37 number of clauses in intial UL: 3
% 0.11/0.37 number of clauses initially in problem: 5
% 0.11/0.37 percentage of clauses intially in UL: 60
% 0.11/0.37 percentage of distinct symbols occuring in initial UL: 82
% 0.11/0.37 percent of all initial clauses that are short: 100
% 0.11/0.37 absolute distinct symbol count: 17
% 0.11/0.37 distinct predicate count: 1
% 0.11/0.37 distinct function count: 8
% 0.11/0.37 distinct constant count: 8
% 0.11/0.37
% 0.11/0.37 ---------- no more Softie stats ----------
% 0.11/0.37
% 0.11/0.37
% 0.11/0.37
% 0.11/0.37 =========== start of search ===========
% 0.11/0.38
% 0.11/0.38 -------- PROOF --------
% 0.11/0.38 % SZS status Unsatisfiable
% 0.11/0.38 % SZS output start Refutation
% 0.11/0.38
% 0.11/0.38 ----> UNIT CONFLICT at 0.01 sec ----> 8 [binary,7.1,1.1] {+} $F.
% 0.11/0.38
% 0.11/0.38 Length of proof is 2. Level of proof is 2.
% 0.11/0.38
% 0.11/0.38 ---------------- PROOF ----------------
% 0.11/0.38 % SZS status Unsatisfiable
% 0.11/0.38 % SZS output start Refutation
% 0.11/0.38
% 0.11/0.38 1 [] {+} -c_in(c_Message_Omsg_ONonce(v_NB),c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs2)),tc_Message_Omsg).
% 0.11/0.38 2 [] {+} -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.38 3 [] {+} -c_in(A,c_Yahalom_Oyahalom,tc_List_Olist(tc_Event_Oevent))| -c_in(c_Event_Oevent_OGets(B,C),c_List_Oset(A,tc_Event_Oevent),tc_Event_Oevent)|c_in(C,c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,A)),tc_Message_Omsg).
% 0.11/0.38 4 [] {-} c_in(v_evs2,c_Yahalom_Oyahalom,tc_List_Olist(tc_Event_Oevent)).
% 0.11/0.38 5 [] {-} c_in(c_Event_Oevent_OGets(v_Ba,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_Aa),c_Message_Omsg_ONonce(v_NB))),c_List_Oset(v_evs2,tc_Event_Oevent),tc_Event_Oevent).
% 0.11/0.38 6 [hyper,5,3,4] {-} c_in(c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_Aa),c_Message_Omsg_ONonce(v_NB)),c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs2)),tc_Message_Omsg).
% 0.11/0.38 7 [hyper,6,2] {-} c_in(c_Message_Omsg_ONonce(v_NB),c_Message_Oanalz(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs2)),tc_Message_Omsg).
% 0.11/0.38 8 [binary,7.1,1.1] {+} $F.
% 0.11/0.38
% 0.11/0.38 % SZS output end Refutation
% 0.11/0.38 ------------ end of proof -------------
% 0.11/0.38
% 0.11/0.38
% 0.11/0.38 Search stopped by max_proofs option.
% 0.11/0.38
% 0.11/0.38
% 0.11/0.38 Search stopped by max_proofs option.
% 0.11/0.38
% 0.11/0.38 ============ end of search ============
% 0.11/0.38
% 0.11/0.38 ----------- soft-scott stats ----------
% 0.11/0.38
% 0.11/0.38 true clauses given 0 (0.0%)
% 0.11/0.38 false clauses given 3
% 0.11/0.38
% 0.11/0.38 FALSE TRUE
% 0.11/0.38 tot: 0 0 (-nan% true)
% 0.11/0.38
% 0.11/0.38
% 0.11/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.11/0.38
% 0.11/0.38 That finishes the proof of the theorem.
% 0.11/0.38
% 0.11/0.38 Process 19613 finished Thu Jun 16 00:22:35 2022
%------------------------------------------------------------------------------