TSTP Solution File: MSC015-1.005 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MSC015-1.005 : TPTP v8.1.0. Released v3.5.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n029.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:06:19 EDT 2022
% Result : Unsatisfiable 1.67s 1.87s
% Output : Refutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 7
% Syntax : Number of clauses : 39 ( 34 unt; 0 nHn; 39 RR)
% Number of literals : 44 ( 0 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-5 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ p(A,B,C,D,s0)
| p(A,B,C,D,s1) ),
file('MSC015-1.005.p',unknown),
[] ).
cnf(2,axiom,
( ~ p(A,B,C,s0,s1)
| p(A,B,C,s1,s0) ),
file('MSC015-1.005.p',unknown),
[] ).
cnf(3,axiom,
( ~ p(A,B,s0,s1,s1)
| p(A,B,s1,s0,s0) ),
file('MSC015-1.005.p',unknown),
[] ).
cnf(4,axiom,
( ~ p(A,s0,s1,s1,s1)
| p(A,s1,s0,s0,s0) ),
file('MSC015-1.005.p',unknown),
[] ).
cnf(5,axiom,
( ~ p(s0,s1,s1,s1,s1)
| p(s1,s0,s0,s0,s0) ),
file('MSC015-1.005.p',unknown),
[] ).
cnf(6,axiom,
~ p(s1,s1,s1,s1,s1),
file('MSC015-1.005.p',unknown),
[] ).
cnf(7,axiom,
p(s0,s0,s0,s0,s0),
file('MSC015-1.005.p',unknown),
[] ).
cnf(8,plain,
p(s0,s0,s0,s0,s1),
inference(hyper,[status(thm)],[7,1]),
[iquote('hyper,7,1')] ).
cnf(9,plain,
p(s0,s0,s0,s1,s0),
inference(hyper,[status(thm)],[8,2]),
[iquote('hyper,8,2')] ).
cnf(10,plain,
p(s0,s0,s0,s1,s1),
inference(hyper,[status(thm)],[9,1]),
[iquote('hyper,9,1')] ).
cnf(11,plain,
p(s0,s0,s1,s0,s0),
inference(hyper,[status(thm)],[10,3]),
[iquote('hyper,10,3')] ).
cnf(12,plain,
p(s0,s0,s1,s0,s1),
inference(hyper,[status(thm)],[11,1]),
[iquote('hyper,11,1')] ).
cnf(13,plain,
p(s0,s0,s1,s1,s0),
inference(hyper,[status(thm)],[12,2]),
[iquote('hyper,12,2')] ).
cnf(14,plain,
p(s0,s0,s1,s1,s1),
inference(hyper,[status(thm)],[13,1]),
[iquote('hyper,13,1')] ).
cnf(15,plain,
p(s0,s1,s0,s0,s0),
inference(hyper,[status(thm)],[14,4]),
[iquote('hyper,14,4')] ).
cnf(16,plain,
p(s0,s1,s0,s0,s1),
inference(hyper,[status(thm)],[15,1]),
[iquote('hyper,15,1')] ).
cnf(17,plain,
p(s0,s1,s0,s1,s0),
inference(hyper,[status(thm)],[16,2]),
[iquote('hyper,16,2')] ).
cnf(18,plain,
p(s0,s1,s0,s1,s1),
inference(hyper,[status(thm)],[17,1]),
[iquote('hyper,17,1')] ).
cnf(19,plain,
p(s0,s1,s1,s0,s0),
inference(hyper,[status(thm)],[18,3]),
[iquote('hyper,18,3')] ).
cnf(20,plain,
p(s0,s1,s1,s0,s1),
inference(hyper,[status(thm)],[19,1]),
[iquote('hyper,19,1')] ).
cnf(21,plain,
p(s0,s1,s1,s1,s0),
inference(hyper,[status(thm)],[20,2]),
[iquote('hyper,20,2')] ).
cnf(22,plain,
p(s0,s1,s1,s1,s1),
inference(hyper,[status(thm)],[21,1]),
[iquote('hyper,21,1')] ).
cnf(23,plain,
p(s1,s0,s0,s0,s0),
inference(hyper,[status(thm)],[22,5]),
[iquote('hyper,22,5')] ).
cnf(24,plain,
p(s1,s0,s0,s0,s1),
inference(hyper,[status(thm)],[23,1]),
[iquote('hyper,23,1')] ).
cnf(25,plain,
p(s1,s0,s0,s1,s0),
inference(hyper,[status(thm)],[24,2]),
[iquote('hyper,24,2')] ).
cnf(26,plain,
p(s1,s0,s0,s1,s1),
inference(hyper,[status(thm)],[25,1]),
[iquote('hyper,25,1')] ).
cnf(27,plain,
p(s1,s0,s1,s0,s0),
inference(hyper,[status(thm)],[26,3]),
[iquote('hyper,26,3')] ).
cnf(28,plain,
p(s1,s0,s1,s0,s1),
inference(hyper,[status(thm)],[27,1]),
[iquote('hyper,27,1')] ).
cnf(29,plain,
p(s1,s0,s1,s1,s0),
inference(hyper,[status(thm)],[28,2]),
[iquote('hyper,28,2')] ).
cnf(30,plain,
p(s1,s0,s1,s1,s1),
inference(hyper,[status(thm)],[29,1]),
[iquote('hyper,29,1')] ).
cnf(31,plain,
p(s1,s1,s0,s0,s0),
inference(hyper,[status(thm)],[30,4]),
[iquote('hyper,30,4')] ).
cnf(32,plain,
p(s1,s1,s0,s0,s1),
inference(hyper,[status(thm)],[31,1]),
[iquote('hyper,31,1')] ).
cnf(33,plain,
p(s1,s1,s0,s1,s0),
inference(hyper,[status(thm)],[32,2]),
[iquote('hyper,32,2')] ).
cnf(34,plain,
p(s1,s1,s0,s1,s1),
inference(hyper,[status(thm)],[33,1]),
[iquote('hyper,33,1')] ).
cnf(35,plain,
p(s1,s1,s1,s0,s0),
inference(hyper,[status(thm)],[34,3]),
[iquote('hyper,34,3')] ).
cnf(36,plain,
p(s1,s1,s1,s0,s1),
inference(hyper,[status(thm)],[35,1]),
[iquote('hyper,35,1')] ).
cnf(37,plain,
p(s1,s1,s1,s1,s0),
inference(hyper,[status(thm)],[36,2]),
[iquote('hyper,36,2')] ).
cnf(38,plain,
p(s1,s1,s1,s1,s1),
inference(hyper,[status(thm)],[37,1]),
[iquote('hyper,37,1')] ).
cnf(39,plain,
$false,
inference(binary,[status(thm)],[38,6]),
[iquote('binary,38.1,6.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : MSC015-1.005 : TPTP v8.1.0. Released v3.5.0.
% 0.10/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n029.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 09:08:59 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.67/1.87 ----- Otter 3.3f, August 2004 -----
% 1.67/1.87 The process was started by sandbox2 on n029.cluster.edu,
% 1.67/1.87 Wed Jul 27 09:08:59 2022
% 1.67/1.87 The command was "./otter". The process ID is 24607.
% 1.67/1.87
% 1.67/1.87 set(prolog_style_variables).
% 1.67/1.87 set(auto).
% 1.67/1.87 dependent: set(auto1).
% 1.67/1.87 dependent: set(process_input).
% 1.67/1.87 dependent: clear(print_kept).
% 1.67/1.87 dependent: clear(print_new_demod).
% 1.67/1.87 dependent: clear(print_back_demod).
% 1.67/1.87 dependent: clear(print_back_sub).
% 1.67/1.87 dependent: set(control_memory).
% 1.67/1.87 dependent: assign(max_mem, 12000).
% 1.67/1.87 dependent: assign(pick_given_ratio, 4).
% 1.67/1.87 dependent: assign(stats_level, 1).
% 1.67/1.87 dependent: assign(max_seconds, 10800).
% 1.67/1.87 clear(print_given).
% 1.67/1.87
% 1.67/1.87 list(usable).
% 1.67/1.87 0 [] p(s0,s0,s0,s0,s0).
% 1.67/1.87 0 [] -p(X0,X1,X2,X3,s0)|p(X0,X1,X2,X3,s1).
% 1.67/1.87 0 [] -p(X0,X1,X2,s0,s1)|p(X0,X1,X2,s1,s0).
% 1.67/1.87 0 [] -p(X0,X1,s0,s1,s1)|p(X0,X1,s1,s0,s0).
% 1.67/1.87 0 [] -p(X0,s0,s1,s1,s1)|p(X0,s1,s0,s0,s0).
% 1.67/1.87 0 [] -p(s0,s1,s1,s1,s1)|p(s1,s0,s0,s0,s0).
% 1.67/1.87 0 [] -p(s1,s1,s1,s1,s1).
% 1.67/1.87 end_of_list.
% 1.67/1.87
% 1.67/1.87 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=2.
% 1.67/1.87
% 1.67/1.87 This is a Horn set without equality. The strategy will
% 1.67/1.87 be hyperresolution, with satellites in sos and nuclei
% 1.67/1.87 in usable.
% 1.67/1.87
% 1.67/1.87 dependent: set(hyper_res).
% 1.67/1.87 dependent: clear(order_hyper).
% 1.67/1.87
% 1.67/1.87 ------------> process usable:
% 1.67/1.87 ** KEPT (pick-wt=12): 1 [] -p(A,B,C,D,s0)|p(A,B,C,D,s1).
% 1.67/1.87 ** KEPT (pick-wt=12): 2 [] -p(A,B,C,s0,s1)|p(A,B,C,s1,s0).
% 1.67/1.87 ** KEPT (pick-wt=12): 3 [] -p(A,B,s0,s1,s1)|p(A,B,s1,s0,s0).
% 1.67/1.87 ** KEPT (pick-wt=12): 4 [] -p(A,s0,s1,s1,s1)|p(A,s1,s0,s0,s0).
% 1.67/1.87 ** KEPT (pick-wt=12): 5 [] -p(s0,s1,s1,s1,s1)|p(s1,s0,s0,s0,s0).
% 1.67/1.87 ** KEPT (pick-wt=6): 6 [] -p(s1,s1,s1,s1,s1).
% 1.67/1.87
% 1.67/1.87 ------------> process sos:
% 1.67/1.87 ** KEPT (pick-wt=6): 7 [] p(s0,s0,s0,s0,s0).
% 1.67/1.87
% 1.67/1.87 ======= end of input processing =======
% 1.67/1.87
% 1.67/1.87 =========== start of search ===========
% 1.67/1.87
% 1.67/1.87 -------- PROOF --------
% 1.67/1.87
% 1.67/1.87 ----> UNIT CONFLICT at 0.00 sec ----> 39 [binary,38.1,6.1] $F.
% 1.67/1.87
% 1.67/1.87 Length of proof is 31. Level of proof is 31.
% 1.67/1.87
% 1.67/1.87 ---------------- PROOF ----------------
% 1.67/1.87 % SZS status Unsatisfiable
% 1.67/1.87 % SZS output start Refutation
% See solution above
% 1.67/1.87 ------------ end of proof -------------
% 1.67/1.87
% 1.67/1.87
% 1.67/1.87 Search stopped by max_proofs option.
% 1.67/1.87
% 1.67/1.87
% 1.67/1.87 Search stopped by max_proofs option.
% 1.67/1.87
% 1.67/1.87 ============ end of search ============
% 1.67/1.87
% 1.67/1.87 -------------- statistics -------------
% 1.67/1.87 clauses given 31
% 1.67/1.87 clauses generated 31
% 1.67/1.87 clauses kept 38
% 1.67/1.87 clauses forward subsumed 0
% 1.67/1.87 clauses back subsumed 1
% 1.67/1.87 Kbytes malloced 976
% 1.67/1.87
% 1.67/1.87 ----------- times (seconds) -----------
% 1.67/1.87 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.87 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.87 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.67/1.87
% 1.67/1.87 That finishes the proof of the theorem.
% 1.67/1.87
% 1.67/1.87 Process 24607 finished Wed Jul 27 09:09:01 2022
% 1.67/1.87 Otter interrupted
% 1.67/1.87 PROOF FOUND
%------------------------------------------------------------------------------