TSTP Solution File: SWV331-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWV331-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n010.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:00 EDT 2022
% Result : Unsatisfiable 1.10s 1.31s
% Output : Refutation 1.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : SWV331-2 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.11 % Command : sos-script %s
% 0.11/0.31 % Computer : n010.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Wed Jun 15 14:47:54 EDT 2022
% 0.11/0.31 % CPUTime :
% 0.11/0.33 ----- Otter 3.2, August 2001 -----
% 0.11/0.33 The process was started by sandbox on n010.cluster.edu,
% 0.11/0.33 Wed Jun 15 14:47:54 2022
% 0.11/0.33 The command was "./sos". The process ID is 20790.
% 0.11/0.33
% 0.11/0.33 set(prolog_style_variables).
% 0.11/0.33 set(auto).
% 0.11/0.33 dependent: set(auto1).
% 0.11/0.33 dependent: set(process_input).
% 0.11/0.33 dependent: clear(print_kept).
% 0.11/0.33 dependent: clear(print_new_demod).
% 0.11/0.33 dependent: clear(print_back_demod).
% 0.11/0.33 dependent: clear(print_back_sub).
% 0.11/0.33 dependent: set(control_memory).
% 0.11/0.33 dependent: assign(max_mem, 12000).
% 0.11/0.33 dependent: assign(pick_given_ratio, 4).
% 0.11/0.33 dependent: assign(stats_level, 1).
% 0.11/0.33 dependent: assign(pick_semantic_ratio, 3).
% 0.11/0.33 dependent: assign(sos_limit, 5000).
% 0.11/0.33 dependent: assign(max_weight, 60).
% 0.11/0.33 clear(print_given).
% 0.11/0.33
% 0.11/0.33 list(usable).
% 0.11/0.33
% 0.11/0.33 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=4.
% 0.11/0.33
% 0.11/0.33 This is a Horn set without equality. The strategy will
% 0.11/0.33 be hyperresolution, with satellites in sos and nuclei
% 0.11/0.33 in usable.
% 0.11/0.33
% 0.11/0.33 dependent: set(hyper_res).
% 0.11/0.33 dependent: clear(order_hyper).
% 0.11/0.33
% 0.11/0.33 ------------> process usable:
% 0.11/0.33
% 0.11/0.33 ------------> process sos:
% 0.11/0.33
% 0.11/0.33 ======= end of input processing =======
% 0.11/0.35
% 0.11/0.35 Model 1 (0.00 seconds, 0 Inserts)
% 0.11/0.35
% 0.11/0.35 Stopped by limit on number of solutions
% 0.11/0.35
% 0.11/0.35
% 0.11/0.35 -------------- Softie stats --------------
% 0.11/0.35
% 0.11/0.35 UPDATE_STOP: 300
% 0.11/0.35 SFINDER_TIME_LIMIT: 2
% 0.11/0.35 SHORT_CLAUSE_CUTOFF: 4
% 0.11/0.35 number of clauses in intial UL: 3
% 0.11/0.35 number of clauses initially in problem: 6
% 0.11/0.35 percentage of clauses intially in UL: 50
% 0.11/0.35 percentage of distinct symbols occuring in initial UL: 88
% 0.11/0.35 percent of all initial clauses that are short: 100
% 0.11/0.35 absolute distinct symbol count: 18
% 0.11/0.35 distinct predicate count: 1
% 0.11/0.35 distinct function count: 8
% 0.11/0.35 distinct constant count: 9
% 0.11/0.35
% 0.11/0.35 ---------- no more Softie stats ----------
% 0.11/0.35
% 0.11/0.35
% 0.11/0.35
% 0.11/0.35 =========== start of search ===========
% 1.10/1.31
% 1.10/1.31 -------- PROOF --------
% 1.10/1.31 % SZS status Unsatisfiable
% 1.10/1.31 % SZS output start Refutation
% 1.10/1.31
% 1.10/1.31 Stopped by limit on insertions
% 1.10/1.31
% 1.10/1.31 ----> UNIT CONFLICT at 0.95 sec ----> 9 [binary,8.1,1.1] {+} $F.
% 1.10/1.31
% 1.10/1.31 Length of proof is 2. Level of proof is 2.
% 1.10/1.31
% 1.10/1.31 ---------------- PROOF ----------------
% 1.10/1.31 % SZS status Unsatisfiable
% 1.10/1.31 % SZS output start Refutation
% 1.10/1.31
% 1.10/1.31 1 [] {+} -c_in(c_Message_Omsg_OKey(v_K),c_Event_Oused(v_evs3),tc_Message_Omsg).
% 1.10/1.31 2 [] {+} -c_in(A,c_Message_OsymKeys,tc_nat)| -c_in(c_Message_Omsg_OCrypt(A,B),C,tc_Message_Omsg)|c_in(A,c_Message_OkeysFor(C),tc_nat).
% 1.10/1.31 3 [] {+} -c_in(A,c_Message_OkeysFor(c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,B))),tc_nat)| -c_in(A,c_Message_OsymKeys,tc_nat)| -c_in(B,c_Yahalom_Oyahalom,tc_List_Olist(tc_Event_Oevent))|c_in(c_Message_Omsg_OKey(A),c_Event_Oused(B),tc_Message_Omsg).
% 1.10/1.31 4 [] {+} c_in(v_evs3,c_Yahalom_Oyahalom,tc_List_Olist(tc_Event_Oevent)).
% 1.10/1.31 5 [] {-} c_in(v_K,c_Message_OsymKeys,tc_nat).
% 1.10/1.31 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_evs3)),tc_Message_Omsg).
% 1.10/1.31 7 [hyper,6,2,5] {-} c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs3))),tc_nat).
% 1.10/1.31 8 [hyper,7,3,5,4] {-} c_in(c_Message_Omsg_OKey(v_K),c_Event_Oused(v_evs3),tc_Message_Omsg).
% 1.10/1.31 9 [binary,8.1,1.1] {+} $F.
% 1.10/1.31
% 1.10/1.31 % SZS output end Refutation
% 1.10/1.31 ------------ end of proof -------------
% 1.10/1.31
% 1.10/1.31
% 1.10/1.31 Search stopped by max_proofs option.
% 1.10/1.31
% 1.10/1.31
% 1.10/1.31 Search stopped by max_proofs option.
% 1.10/1.31
% 1.10/1.31 ============ end of search ============
% 1.10/1.31
% 1.10/1.31 ----------- soft-scott stats ----------
% 1.10/1.31
% 1.10/1.31 true clauses given 1 (25.0%)
% 1.10/1.31 false clauses given 3
% 1.10/1.31
% 1.10/1.31 FALSE TRUE
% 1.10/1.31 tot: 0 0 (-nan% true)
% 1.10/1.31
% 1.10/1.31
% 1.10/1.31 Model 1 (0.00 seconds, 0 Inserts)
% 1.10/1.31
% 1.10/1.31 That finishes the proof of the theorem.
% 1.10/1.31
% 1.10/1.31 Process 20790 finished Wed Jun 15 14:47:55 2022
%------------------------------------------------------------------------------