%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWV307-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n003.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 : 300s
% DateTime : Wed Jul 27 13:20:26 EDT 2022
% Result : Unsatisfiable 1.58s 1.78s
% Output : Refutation 1.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 9 unt; 0 nHn; 12 RR)
% Number of literals : 15 ( 2 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 7 con; 0-2 aty)
% Number of variables : 8 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ c_in(c_Message_Omsg_ONonce(v_NB),c_Event_Oused(v_evs2),tc_Message_Omsg),
file('SWV307-2.p',unknown),
[] ).
cnf(2,axiom,
( ~ 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) ),
file('SWV307-2.p',unknown),
[] ).
cnf(3,axiom,
( ~ c_in(c_Message_Omsg_OMPair(A,B),c_Message_Oparts(C),tc_Message_Omsg)
| c_in(A,c_Message_Oparts(C),tc_Message_Omsg) ),
file('SWV307-2.p',unknown),
[] ).
cnf(4,axiom,
( ~ c_in(c_Message_Omsg_OCrypt(A,B),c_Message_Oparts(C),tc_Message_Omsg)
| c_in(B,c_Message_Oparts(C),tc_Message_Omsg) ),
file('SWV307-2.p',unknown),
[] ).
cnf(6,axiom,
c_in(c_Message_Omsg_OCrypt(c_Public_OshrK(v_A),c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OAgent(v_B)))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs2)),tc_Message_Omsg),
file('SWV307-2.p',unknown),
[] ).
cnf(7,axiom,
v_NA = c_Message_Omsg_ONonce(v_NB),
file('SWV307-2.p',unknown),
[] ).
cnf(9,plain,
c_Message_Omsg_ONonce(v_NB) = v_NA,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[7])]),
[iquote('copy,7,flip.1')] ).
cnf(10,plain,
~ c_in(v_NA,c_Event_Oused(v_evs2),tc_Message_Omsg),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1]),9]),
[iquote('back_demod,1,demod,9')] ).
cnf(11,plain,
c_in(c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OAgent(v_B))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs2)),tc_Message_Omsg),
inference(hyper,[status(thm)],[6,4]),
[iquote('hyper,6,4')] ).
cnf(13,plain,
c_in(v_NA,c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs2)),tc_Message_Omsg),
inference(hyper,[status(thm)],[11,3]),
[iquote('hyper,11,3')] ).
cnf(15,plain,
c_in(v_NA,c_Event_Oused(v_evs2),tc_Message_Omsg),
inference(hyper,[status(thm)],[13,2]),
[iquote('hyper,13,2')] ).
cnf(16,plain,
$false,
inference(binary,[status(thm)],[15,10]),
[iquote('binary,15.1,10.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV307-2 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n003.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 06:08:11 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.58/1.78 ----- Otter 3.3f, August 2004 -----
% 1.58/1.78 The process was started by sandbox2 on n003.cluster.edu,
% 1.58/1.78 Wed Jul 27 06:08:11 2022
% 1.58/1.78 The command was "./otter". The process ID is 19094.
% 1.58/1.78
% 1.58/1.78 set(prolog_style_variables).
% 1.58/1.78 set(auto).
% 1.58/1.78 dependent: set(auto1).
% 1.58/1.78 dependent: set(process_input).
% 1.58/1.78 dependent: clear(print_kept).
% 1.58/1.78 dependent: clear(print_new_demod).
% 1.58/1.78 dependent: clear(print_back_demod).
% 1.58/1.78 dependent: clear(print_back_sub).
% 1.58/1.78 dependent: set(control_memory).
% 1.58/1.78 dependent: assign(max_mem, 12000).
% 1.58/1.78 dependent: assign(pick_given_ratio, 4).
% 1.58/1.78 dependent: assign(stats_level, 1).
% 1.58/1.78 dependent: assign(max_seconds, 10800).
% 1.58/1.78 clear(print_given).
% 1.58/1.78
% 1.58/1.78 list(usable).
% 1.58/1.78 0 [] A=A.
% 1.58/1.78 0 [] -c_in(c_Message_Omsg_ONonce(v_NB),c_Event_Oused(v_evs2),tc_Message_Omsg).
% 1.58/1.78 0 [] c_in(c_Message_Omsg_OCrypt(c_Public_OshrK(v_A),c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OAgent(v_B)))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs2)),tc_Message_Omsg).
% 1.58/1.78 0 [] v_NA=c_Message_Omsg_ONonce(v_NB).
% 1.58/1.78 0 [] -c_in(V_c,c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,V_evs)),tc_Message_Omsg)|c_in(V_c,c_Event_Oused(V_evs),tc_Message_Omsg).
% 1.58/1.78 0 [] -c_in(c_Message_Omsg_OMPair(V_X,V_Y),c_Message_Oparts(V_H),tc_Message_Omsg)|c_in(V_X,c_Message_Oparts(V_H),tc_Message_Omsg).
% 1.58/1.78 0 [] -c_in(c_Message_Omsg_OCrypt(V_K,V_X),c_Message_Oparts(V_H),tc_Message_Omsg)|c_in(V_X,c_Message_Oparts(V_H),tc_Message_Omsg).
% 1.58/1.78 end_of_list.
% 1.58/1.78
% 1.58/1.78 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 1.58/1.78
% 1.58/1.78 This is a Horn set with equality. The strategy will be
% 1.58/1.78 Knuth-Bendix and hyper_res, with positive clauses in
% 1.58/1.78 sos and nonpositive clauses in usable.
% 1.58/1.78
% 1.58/1.78 dependent: set(knuth_bendix).
% 1.58/1.78 dependent: set(anl_eq).
% 1.58/1.78 dependent: set(para_from).
% 1.58/1.78 dependent: set(para_into).
% 1.58/1.78 dependent: clear(para_from_right).
% 1.58/1.78 dependent: clear(para_into_right).
% 1.58/1.78 dependent: set(para_from_vars).
% 1.58/1.78 dependent: set(eq_units_both_ways).
% 1.58/1.78 dependent: set(dynamic_demod_all).
% 1.58/1.78 dependent: set(dynamic_demod).
% 1.58/1.78 dependent: set(order_eq).
% 1.58/1.78 dependent: set(back_demod).
% 1.58/1.78 dependent: set(lrpo).
% 1.58/1.78 dependent: set(hyper_res).
% 1.58/1.78 dependent: clear(order_hyper).
% 1.58/1.78
% 1.58/1.78 ------------> process usable:
% 1.58/1.78 ** KEPT (pick-wt=6): 1 [] -c_in(c_Message_Omsg_ONonce(v_NB),c_Event_Oused(v_evs2),tc_Message_Omsg).
% 1.58/1.78 ** KEPT (pick-wt=12): 2 [] -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).
% 1.58/1.78 ** KEPT (pick-wt=12): 3 [] -c_in(c_Message_Omsg_OMPair(A,B),c_Message_Oparts(C),tc_Message_Omsg)|c_in(A,c_Message_Oparts(C),tc_Message_Omsg).
% 1.58/1.78 ** KEPT (pick-wt=12): 4 [] -c_in(c_Message_Omsg_OCrypt(A,B),c_Message_Oparts(C),tc_Message_Omsg)|c_in(B,c_Message_Oparts(C),tc_Message_Omsg).
% 1.58/1.78
% 1.58/1.78 ------------> process sos:
% 1.58/1.78 ** KEPT (pick-wt=3): 5 [] A=A.
% 1.58/1.78 ** KEPT (pick-wt=16): 6 [] c_in(c_Message_Omsg_OCrypt(c_Public_OshrK(v_A),c_Message_Omsg_OMPair(v_NA,c_Message_Omsg_OMPair(c_Message_Omsg_OAgent(v_A),c_Message_Omsg_OAgent(v_B)))),c_Message_Oparts(c_Event_Oknows(c_Message_Oagent_OSpy,v_evs2)),tc_Message_Omsg).
% 1.58/1.78 ** KEPT (pick-wt=4): 8 [copy,7,flip.1] c_Message_Omsg_ONonce(v_NB)=v_NA.
% 1.58/1.78 ---> New Demodulator: 9 [new_demod,8] c_Message_Omsg_ONonce(v_NB)=v_NA.
% 1.58/1.78 Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] A=A.
% 1.58/1.78 >>>> Starting back demodulation with 9.
% 1.58/1.78 >> back demodulating 1 with 9.
% 1.58/1.78
% 1.58/1.78 ======= end of input processing =======
% 1.58/1.78
% 1.58/1.78 =========== start of search ===========
% 1.58/1.78
% 1.58/1.78 -------- PROOF --------
% 1.58/1.78
% 1.58/1.78 ----> UNIT CONFLICT at 0.00 sec ----> 16 [binary,15.1,10.1] $F.
% 1.58/1.78
% 1.58/1.78 Length of proof is 5. Level of proof is 3.
% 1.58/1.78
% 1.58/1.78 ---------------- PROOF ----------------
% 1.58/1.78 % SZS status Unsatisfiable
% 1.58/1.78 % SZS output start Refutation
% See solution above
% 1.58/1.78 ------------ end of proof -------------
% 1.58/1.78
% 1.58/1.78
% 1.58/1.78 Search stopped by max_proofs option.
% 1.58/1.78
% 1.58/1.78
% 1.58/1.78 Search stopped by max_proofs option.
% 1.58/1.78
% 1.58/1.78 ============ end of search ============
% 1.58/1.78
% 1.58/1.78 -------------- statistics -------------
% 1.58/1.78 clauses given 7
% 1.58/1.78 clauses generated 7
% 1.58/1.78 clauses kept 13
% 1.58/1.78 clauses forward subsumed 3
% 1.58/1.78 clauses back subsumed 0
% 1.58/1.78 Kbytes malloced 976
% 1.58/1.78
% 1.58/1.78 ----------- times (seconds) -----------
% 1.58/1.78 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.58/1.78 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.58/1.78 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.58/1.78
% 1.58/1.78 That finishes the proof of the theorem.
% 1.58/1.78
% 1.58/1.78 Process 19094 finished Wed Jul 27 06:08:13 2022
% 1.58/1.78 Otter interrupted
% 1.58/1.78 PROOF FOUND
%------------------------------------------------------------------------------