%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWV255-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n022.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:18 EDT 2022
% Result : Unsatisfiable 1.72s 1.93s
% Output : Refutation 1.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 7 unt; 1 nHn; 5 RR)
% Number of literals : 17 ( 0 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 22 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ c_in(c_Message_Omsg_ONonce(A),c_Message_Oparts(c_insert(v_msg1,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
| ~ c_lesse_quals(v_x,A,tc_nat) ),
file('SWV255-2.p',unknown),
[] ).
cnf(2,axiom,
( ~ c_in(c_Message_Omsg_ONonce(A),c_Message_Oparts(c_insert(v_msg2,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
| ~ c_lesse_quals(v_xa,A,tc_nat) ),
file('SWV255-2.p',unknown),
[] ).
cnf(3,axiom,
( ~ c_lesse_quals(c_plus(A,B,tc_nat),C,tc_nat)
| c_lesse_quals(B,C,tc_nat) ),
file('SWV255-2.p',unknown),
[] ).
cnf(4,axiom,
( ~ c_lesse_quals(c_plus(A,B,tc_nat),C,tc_nat)
| c_lesse_quals(A,C,tc_nat) ),
file('SWV255-2.p',unknown),
[] ).
cnf(5,axiom,
c_lesse_quals(A,v_xb(A),tc_nat),
file('SWV255-2.p',unknown),
[] ).
cnf(6,axiom,
( c_in(c_Message_Omsg_ONonce(v_xb(A)),c_Message_Oparts(c_insert(v_msg2,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)
| c_in(c_Message_Omsg_ONonce(v_xb(A)),c_Message_Oparts(c_insert(v_msg1,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) ),
file('SWV255-2.p',unknown),
[] ).
cnf(7,plain,
c_lesse_quals(A,v_xb(c_plus(A,B,tc_nat)),tc_nat),
inference(hyper,[status(thm)],[5,4]),
[iquote('hyper,5,4')] ).
cnf(8,plain,
c_lesse_quals(A,v_xb(c_plus(B,A,tc_nat)),tc_nat),
inference(hyper,[status(thm)],[5,3]),
[iquote('hyper,5,3')] ).
cnf(9,plain,
c_lesse_quals(A,v_xb(c_plus(c_plus(A,B,tc_nat),C,tc_nat)),tc_nat),
inference(hyper,[status(thm)],[7,4]),
[iquote('hyper,7,4')] ).
cnf(13,plain,
c_lesse_quals(A,v_xb(c_plus(c_plus(c_plus(A,B,tc_nat),C,tc_nat),D,tc_nat)),tc_nat),
inference(hyper,[status(thm)],[9,4]),
[iquote('hyper,9,4')] ).
cnf(19,plain,
c_in(c_Message_Omsg_ONonce(v_xb(c_plus(A,v_xa,tc_nat))),c_Message_Oparts(c_insert(v_msg1,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg),
inference(hyper,[status(thm)],[6,2,8]),
[iquote('hyper,6,2,8')] ).
cnf(39,plain,
$false,
inference(hyper,[status(thm)],[19,1,13]),
[iquote('hyper,19,1,13')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV255-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n022.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.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 05:41:50 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.72/1.93 ----- Otter 3.3f, August 2004 -----
% 1.72/1.93 The process was started by sandbox2 on n022.cluster.edu,
% 1.72/1.93 Wed Jul 27 05:41:50 2022
% 1.72/1.93 The command was "./otter". The process ID is 11637.
% 1.72/1.93
% 1.72/1.93 set(prolog_style_variables).
% 1.72/1.93 set(auto).
% 1.72/1.93 dependent: set(auto1).
% 1.72/1.93 dependent: set(process_input).
% 1.72/1.93 dependent: clear(print_kept).
% 1.72/1.93 dependent: clear(print_new_demod).
% 1.72/1.93 dependent: clear(print_back_demod).
% 1.72/1.93 dependent: clear(print_back_sub).
% 1.72/1.93 dependent: set(control_memory).
% 1.72/1.93 dependent: assign(max_mem, 12000).
% 1.72/1.93 dependent: assign(pick_given_ratio, 4).
% 1.72/1.93 dependent: assign(stats_level, 1).
% 1.72/1.93 dependent: assign(max_seconds, 10800).
% 1.72/1.93 clear(print_given).
% 1.72/1.93
% 1.72/1.93 list(usable).
% 1.72/1.93 0 [] c_lesse_quals(V_U,v_xb(V_U),tc_nat).
% 1.72/1.93 0 [] -c_in(c_Message_Omsg_ONonce(V_U),c_Message_Oparts(c_insert(v_msg1,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)| -c_lesse_quals(v_x,V_U,tc_nat).
% 1.72/1.93 0 [] -c_in(c_Message_Omsg_ONonce(V_U),c_Message_Oparts(c_insert(v_msg2,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)| -c_lesse_quals(v_xa,V_U,tc_nat).
% 1.72/1.93 0 [] c_in(c_Message_Omsg_ONonce(v_xb(V_U)),c_Message_Oparts(c_insert(v_msg2,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)|c_in(c_Message_Omsg_ONonce(v_xb(V_U)),c_Message_Oparts(c_insert(v_msg1,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg).
% 1.72/1.93 0 [] -c_lesse_quals(c_plus(V_m,V_k,tc_nat),V_n,tc_nat)|c_lesse_quals(V_k,V_n,tc_nat).
% 1.72/1.93 0 [] -c_lesse_quals(c_plus(V_m,V_k,tc_nat),V_n,tc_nat)|c_lesse_quals(V_m,V_n,tc_nat).
% 1.72/1.93 end_of_list.
% 1.72/1.93
% 1.72/1.93 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=2.
% 1.72/1.93
% 1.72/1.93 This is a non-Horn set without equality. The strategy will
% 1.72/1.93 be ordered hyper_res, unit deletion, and factoring, with
% 1.72/1.93 satellites in sos and with nuclei in usable.
% 1.72/1.93
% 1.72/1.93 dependent: set(hyper_res).
% 1.72/1.93 dependent: set(factor).
% 1.72/1.93 dependent: set(unit_deletion).
% 1.72/1.93
% 1.72/1.93 ------------> process usable:
% 1.72/1.93 ** KEPT (pick-wt=13): 1 [] -c_in(c_Message_Omsg_ONonce(A),c_Message_Oparts(c_insert(v_msg1,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)| -c_lesse_quals(v_x,A,tc_nat).
% 1.72/1.93 ** KEPT (pick-wt=13): 2 [] -c_in(c_Message_Omsg_ONonce(A),c_Message_Oparts(c_insert(v_msg2,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)| -c_lesse_quals(v_xa,A,tc_nat).
% 1.72/1.93 ** KEPT (pick-wt=11): 3 [] -c_lesse_quals(c_plus(A,B,tc_nat),C,tc_nat)|c_lesse_quals(B,C,tc_nat).
% 1.72/1.93 ** KEPT (pick-wt=11): 4 [] -c_lesse_quals(c_plus(A,B,tc_nat),C,tc_nat)|c_lesse_quals(A,C,tc_nat).
% 1.72/1.93
% 1.72/1.93 ------------> process sos:
% 1.72/1.93 ** KEPT (pick-wt=5): 5 [] c_lesse_quals(A,v_xb(A),tc_nat).
% 1.72/1.93 ** KEPT (pick-wt=20): 6 [] c_in(c_Message_Omsg_ONonce(v_xb(A)),c_Message_Oparts(c_insert(v_msg2,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg)|c_in(c_Message_Omsg_ONonce(v_xb(A)),c_Message_Oparts(c_insert(v_msg1,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg).
% 1.72/1.93
% 1.72/1.93 ======= end of input processing =======
% 1.72/1.93
% 1.72/1.93 =========== start of search ===========
% 1.72/1.93
% 1.72/1.93 -------- PROOF --------
% 1.72/1.93
% 1.72/1.93 -----> EMPTY CLAUSE at 0.00 sec ----> 39 [hyper,19,1,13] $F.
% 1.72/1.93
% 1.72/1.93 Length of proof is 5. Level of proof is 3.
% 1.72/1.93
% 1.72/1.93 ---------------- PROOF ----------------
% 1.72/1.93 % SZS status Unsatisfiable
% 1.72/1.93 % SZS output start Refutation
% See solution above
% 1.72/1.93 ------------ end of proof -------------
% 1.72/1.93
% 1.72/1.93
% 1.72/1.93 Search stopped by max_proofs option.
% 1.72/1.93
% 1.72/1.93
% 1.72/1.93 Search stopped by max_proofs option.
% 1.72/1.93
% 1.72/1.93 ============ end of search ============
% 1.72/1.93
% 1.72/1.93 -------------- statistics -------------
% 1.72/1.93 clauses given 12
% 1.72/1.93 clauses generated 33
% 1.72/1.93 clauses kept 38
% 1.72/1.93 clauses forward subsumed 0
% 1.72/1.93 clauses back subsumed 0
% 1.72/1.93 Kbytes malloced 976
% 1.72/1.93
% 1.72/1.93 ----------- times (seconds) -----------
% 1.72/1.93 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.72/1.93 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.72/1.93 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.72/1.93
% 1.72/1.93 That finishes the proof of the theorem.
% 1.72/1.93
% 1.72/1.93 Process 11637 finished Wed Jul 27 05:41:52 2022
% 1.72/1.93 Otter interrupted
% 1.72/1.93 PROOF FOUND
%------------------------------------------------------------------------------