%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN004-1.007 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n018.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:23:17 EDT 2022
% Result : Unsatisfiable 1.66s 1.87s
% Output : Refutation 1.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of clauses : 28 ( 15 unt; 0 nHn; 28 RR)
% Number of literals : 53 ( 0 equ; 26 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of predicates : 15 ( 14 usr; 15 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ p_1
| ~ q_1
| p_2 ),
file('SYN004-1.007.p',unknown),
[] ).
cnf(2,axiom,
( ~ p_2
| ~ q_2
| p_3 ),
file('SYN004-1.007.p',unknown),
[] ).
cnf(3,axiom,
( ~ p_3
| ~ q_3
| p_4 ),
file('SYN004-1.007.p',unknown),
[] ).
cnf(4,axiom,
( ~ p_4
| ~ q_4
| p_5 ),
file('SYN004-1.007.p',unknown),
[] ).
cnf(5,axiom,
( ~ p_5
| ~ q_5
| p_6 ),
file('SYN004-1.007.p',unknown),
[] ).
cnf(6,axiom,
( ~ p_6
| ~ q_6
| p_7 ),
file('SYN004-1.007.p',unknown),
[] ).
cnf(7,axiom,
( ~ p_1
| ~ q_1
| q_2 ),
file('SYN004-1.007.p',unknown),
[] ).
cnf(8,axiom,
( ~ p_2
| ~ q_2
| q_3 ),
file('SYN004-1.007.p',unknown),
[] ).
cnf(9,axiom,
( ~ p_3
| ~ q_3
| q_4 ),
file('SYN004-1.007.p',unknown),
[] ).
cnf(10,axiom,
( ~ p_4
| ~ q_4
| q_5 ),
file('SYN004-1.007.p',unknown),
[] ).
cnf(11,axiom,
( ~ p_5
| ~ q_5
| q_6 ),
file('SYN004-1.007.p',unknown),
[] ).
cnf(12,axiom,
( ~ p_6
| ~ q_6
| q_7 ),
file('SYN004-1.007.p',unknown),
[] ).
cnf(13,axiom,
( ~ p_7
| ~ q_7 ),
file('SYN004-1.007.p',unknown),
[] ).
cnf(14,axiom,
p_1,
file('SYN004-1.007.p',unknown),
[] ).
cnf(15,axiom,
q_1,
file('SYN004-1.007.p',unknown),
[] ).
cnf(16,plain,
q_2,
inference(hyper,[status(thm)],[15,7,14]),
[iquote('hyper,15,7,14')] ).
cnf(17,plain,
p_2,
inference(hyper,[status(thm)],[15,1,14]),
[iquote('hyper,15,1,14')] ).
cnf(18,plain,
q_3,
inference(hyper,[status(thm)],[17,8,16]),
[iquote('hyper,17,8,16')] ).
cnf(19,plain,
p_3,
inference(hyper,[status(thm)],[17,2,16]),
[iquote('hyper,17,2,16')] ).
cnf(20,plain,
q_4,
inference(hyper,[status(thm)],[19,9,18]),
[iquote('hyper,19,9,18')] ).
cnf(21,plain,
p_4,
inference(hyper,[status(thm)],[19,3,18]),
[iquote('hyper,19,3,18')] ).
cnf(22,plain,
q_5,
inference(hyper,[status(thm)],[21,10,20]),
[iquote('hyper,21,10,20')] ).
cnf(23,plain,
p_5,
inference(hyper,[status(thm)],[21,4,20]),
[iquote('hyper,21,4,20')] ).
cnf(24,plain,
q_6,
inference(hyper,[status(thm)],[23,11,22]),
[iquote('hyper,23,11,22')] ).
cnf(25,plain,
p_6,
inference(hyper,[status(thm)],[23,5,22]),
[iquote('hyper,23,5,22')] ).
cnf(26,plain,
q_7,
inference(hyper,[status(thm)],[25,12,24]),
[iquote('hyper,25,12,24')] ).
cnf(27,plain,
p_7,
inference(hyper,[status(thm)],[25,6,24]),
[iquote('hyper,25,6,24')] ).
cnf(28,plain,
$false,
inference(hyper,[status(thm)],[27,13,26]),
[iquote('hyper,27,13,26')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYN004-1.007 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n018.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.33 % DateTime : Wed Jul 27 11:22:31 EDT 2022
% 0.18/0.33 % CPUTime :
% 1.66/1.87 ----- Otter 3.3f, August 2004 -----
% 1.66/1.87 The process was started by sandbox on n018.cluster.edu,
% 1.66/1.87 Wed Jul 27 11:22:31 2022
% 1.66/1.87 The command was "./otter". The process ID is 1199.
% 1.66/1.87
% 1.66/1.87 set(prolog_style_variables).
% 1.66/1.87 set(auto).
% 1.66/1.87 dependent: set(auto1).
% 1.66/1.87 dependent: set(process_input).
% 1.66/1.87 dependent: clear(print_kept).
% 1.66/1.87 dependent: clear(print_new_demod).
% 1.66/1.87 dependent: clear(print_back_demod).
% 1.66/1.87 dependent: clear(print_back_sub).
% 1.66/1.87 dependent: set(control_memory).
% 1.66/1.87 dependent: assign(max_mem, 12000).
% 1.66/1.87 dependent: assign(pick_given_ratio, 4).
% 1.66/1.87 dependent: assign(stats_level, 1).
% 1.66/1.87 dependent: assign(max_seconds, 10800).
% 1.66/1.87 clear(print_given).
% 1.66/1.87
% 1.66/1.87 list(usable).
% 1.66/1.87 0 [] -p_1| -q_1|p_2.
% 1.66/1.87 0 [] -p_2| -q_2|p_3.
% 1.66/1.87 0 [] -p_3| -q_3|p_4.
% 1.66/1.87 0 [] -p_4| -q_4|p_5.
% 1.66/1.87 0 [] -p_5| -q_5|p_6.
% 1.66/1.87 0 [] -p_6| -q_6|p_7.
% 1.66/1.87 0 [] -p_1| -q_1|q_2.
% 1.66/1.87 0 [] -p_2| -q_2|q_3.
% 1.66/1.87 0 [] -p_3| -q_3|q_4.
% 1.66/1.87 0 [] -p_4| -q_4|q_5.
% 1.66/1.87 0 [] -p_5| -q_5|q_6.
% 1.66/1.87 0 [] -p_6| -q_6|q_7.
% 1.66/1.87 0 [] p_1.
% 1.66/1.87 0 [] q_1.
% 1.66/1.87 0 [] -p_7| -q_7.
% 1.66/1.87 end_of_list.
% 1.66/1.87
% 1.66/1.87 SCAN INPUT: prop=1, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.66/1.87
% 1.66/1.87 The clause set is propositional; the strategy will be
% 1.66/1.87 ordered hyperresolution with the propositional
% 1.66/1.87 optimizations, with satellites in sos and nuclei in usable.
% 1.66/1.87
% 1.66/1.87 dependent: set(hyper_res).
% 1.66/1.87 dependent: set(propositional).
% 1.66/1.87 dependent: set(sort_literals).
% 1.66/1.87
% 1.66/1.87 ------------> process usable:
% 1.66/1.87 ** KEPT (pick-wt=3): 1 [] -p_1| -q_1|p_2.
% 1.66/1.87 ** KEPT (pick-wt=3): 2 [] -p_2| -q_2|p_3.
% 1.66/1.87 ** KEPT (pick-wt=3): 3 [] -p_3| -q_3|p_4.
% 1.66/1.87 ** KEPT (pick-wt=3): 4 [] -p_4| -q_4|p_5.
% 1.66/1.87 ** KEPT (pick-wt=3): 5 [] -p_5| -q_5|p_6.
% 1.66/1.87 ** KEPT (pick-wt=3): 6 [] -p_6| -q_6|p_7.
% 1.66/1.87 ** KEPT (pick-wt=3): 7 [] -p_1| -q_1|q_2.
% 1.66/1.87 ** KEPT (pick-wt=3): 8 [] -p_2| -q_2|q_3.
% 1.66/1.87 ** KEPT (pick-wt=3): 9 [] -p_3| -q_3|q_4.
% 1.66/1.87 ** KEPT (pick-wt=3): 10 [] -p_4| -q_4|q_5.
% 1.66/1.87 ** KEPT (pick-wt=3): 11 [] -p_5| -q_5|q_6.
% 1.66/1.87 ** KEPT (pick-wt=3): 12 [] -p_6| -q_6|q_7.
% 1.66/1.87 ** KEPT (pick-wt=2): 13 [] -p_7| -q_7.
% 1.66/1.87
% 1.66/1.87 ------------> process sos:
% 1.66/1.87 ** KEPT (pick-wt=1): 14 [] p_1.
% 1.66/1.87 ** KEPT (pick-wt=1): 15 [] q_1.
% 1.66/1.87
% 1.66/1.87 ======= end of input processing =======
% 1.66/1.87
% 1.66/1.87 =========== start of search ===========
% 1.66/1.87
% 1.66/1.87 -------- PROOF --------
% 1.66/1.87
% 1.66/1.87 -----> EMPTY CLAUSE at 0.00 sec ----> 28 [hyper,27,13,26] $F.
% 1.66/1.87
% 1.66/1.87 Length of proof is 12. Level of proof is 6.
% 1.66/1.87
% 1.66/1.87 ---------------- PROOF ----------------
% 1.66/1.87 % SZS status Unsatisfiable
% 1.66/1.87 % SZS output start Refutation
% See solution above
% 1.66/1.87 ------------ end of proof -------------
% 1.66/1.87
% 1.66/1.87
% 1.66/1.87 Search stopped by max_proofs option.
% 1.66/1.87
% 1.66/1.87
% 1.66/1.87 Search stopped by max_proofs option.
% 1.66/1.87
% 1.66/1.87 ============ end of search ============
% 1.66/1.87
% 1.66/1.87 -------------- statistics -------------
% 1.66/1.87 clauses given 14
% 1.66/1.87 clauses generated 13
% 1.66/1.87 clauses kept 27
% 1.66/1.87 clauses forward subsumed 0
% 1.66/1.87 clauses back subsumed 12
% 1.66/1.87 Kbytes malloced 976
% 1.66/1.87
% 1.66/1.87 ----------- times (seconds) -----------
% 1.66/1.87 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.66/1.87 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.66/1.87 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.66/1.87
% 1.66/1.87 That finishes the proof of the theorem.
% 1.66/1.87
% 1.66/1.87 Process 1199 finished Wed Jul 27 11:22:33 2022
% 1.66/1.87 Otter interrupted
% 1.66/1.87 PROOF FOUND
%------------------------------------------------------------------------------