TSTP Solution File: PUZ056-2.005 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PUZ056-2.005 : TPTP v8.1.0. Released v3.5.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n013.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:11:29 EDT 2022
% Result : Unsatisfiable 1.94s 2.11s
% Output : Refutation 1.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 32
% Number of leaves : 13
% Syntax : Number of clauses : 45 ( 40 unt; 0 nHn; 28 RR)
% Number of literals : 70 ( 0 equ; 26 neg)
% Maximal clause size : 10 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-5 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 46 ( 18 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ p(A,B,C,D,E)
| p(F,B,C,D,E) ),
file('PUZ056-2.005.p',unknown),
[] ).
cnf(2,axiom,
( ~ p(A,B,C,D,E)
| ~ ne_q(A,B)
| ~ ne_q(A,F)
| p(A,F,C,D,E) ),
file('PUZ056-2.005.p',unknown),
[] ).
cnf(3,axiom,
( ~ p(A,B,C,D,E)
| ~ ne_q(A,C)
| ~ ne_q(A,F)
| ~ ne_q(B,C)
| ~ ne_q(B,F)
| p(A,B,F,D,E) ),
file('PUZ056-2.005.p',unknown),
[] ).
cnf(4,axiom,
( ~ p(A,B,C,D,E)
| ~ ne_q(A,D)
| ~ ne_q(A,F)
| ~ ne_q(B,D)
| ~ ne_q(B,F)
| ~ ne_q(C,D)
| ~ ne_q(C,F)
| p(A,B,C,F,E) ),
file('PUZ056-2.005.p',unknown),
[] ).
cnf(5,axiom,
( ~ p(A,B,C,D,E)
| ~ ne_q(A,E)
| ~ ne_q(A,F)
| ~ ne_q(B,E)
| ~ ne_q(B,F)
| ~ ne_q(C,E)
| ~ ne_q(C,F)
| ~ ne_q(D,E)
| ~ ne_q(D,F)
| p(A,B,C,D,F) ),
file('PUZ056-2.005.p',unknown),
[] ).
cnf(9,axiom,
~ p(s2,s2,s2,s2,s2),
file('PUZ056-2.005.p',unknown),
[] ).
cnf(10,axiom,
ne_q(s0,s1),
file('PUZ056-2.005.p',unknown),
[] ).
cnf(11,axiom,
ne_q(s0,s2),
file('PUZ056-2.005.p',unknown),
[] ).
cnf(12,axiom,
ne_q(s1,s0),
file('PUZ056-2.005.p',unknown),
[] ).
cnf(13,axiom,
ne_q(s1,s2),
file('PUZ056-2.005.p',unknown),
[] ).
cnf(14,axiom,
ne_q(s2,s0),
file('PUZ056-2.005.p',unknown),
[] ).
cnf(15,axiom,
ne_q(s2,s1),
file('PUZ056-2.005.p',unknown),
[] ).
cnf(16,axiom,
p(s0,s0,s0,s0,s0),
file('PUZ056-2.005.p',unknown),
[] ).
cnf(17,plain,
p(A,s0,s0,s0,s0),
inference(hyper,[status(thm)],[16,1]),
[iquote('hyper,16,1')] ).
cnf(18,plain,
p(s2,s1,s0,s0,s0),
inference(hyper,[status(thm)],[17,2,14,15]),
[iquote('hyper,17,2,14,15')] ).
cnf(20,plain,
p(A,s1,s0,s0,s0),
inference(hyper,[status(thm)],[18,1]),
[iquote('hyper,18,1')] ).
cnf(22,plain,
p(s1,s1,s2,s0,s0),
inference(hyper,[status(thm)],[20,3,12,13,12,13]),
[iquote('hyper,20,3,12,13,12,13')] ).
cnf(24,plain,
p(A,s1,s2,s0,s0),
inference(hyper,[status(thm)],[22,1]),
[iquote('hyper,22,1')] ).
cnf(27,plain,
p(s0,s2,s2,s0,s0),
inference(hyper,[status(thm)],[24,2,10,11]),
[iquote('hyper,24,2,10,11')] ).
cnf(31,plain,
p(A,s2,s2,s0,s0),
inference(hyper,[status(thm)],[27,1]),
[iquote('hyper,27,1')] ).
cnf(34,plain,
p(s2,s2,s2,s1,s0),
inference(hyper,[status(thm)],[31,4,14,15,14,15,14,15]),
[iquote('hyper,31,4,14,15,14,15,14,15')] ).
cnf(36,plain,
p(A,s2,s2,s1,s0),
inference(hyper,[status(thm)],[34,1]),
[iquote('hyper,34,1')] ).
cnf(38,plain,
p(s1,s0,s2,s1,s0),
inference(hyper,[status(thm)],[36,2,13,12]),
[iquote('hyper,36,2,13,12')] ).
cnf(42,plain,
p(A,s0,s2,s1,s0),
inference(hyper,[status(thm)],[38,1]),
[iquote('hyper,38,1')] ).
cnf(46,plain,
p(s0,s0,s1,s1,s0),
inference(hyper,[status(thm)],[42,3,11,10,11,10]),
[iquote('hyper,42,3,11,10,11,10')] ).
cnf(50,plain,
p(A,s0,s1,s1,s0),
inference(hyper,[status(thm)],[46,1]),
[iquote('hyper,46,1')] ).
cnf(54,plain,
p(s2,s1,s1,s1,s0),
inference(hyper,[status(thm)],[50,2,14,15]),
[iquote('hyper,50,2,14,15')] ).
cnf(62,plain,
p(A,s1,s1,s1,s0),
inference(hyper,[status(thm)],[54,1]),
[iquote('hyper,54,1')] ).
cnf(70,plain,
p(s1,s1,s1,s1,s2),
inference(hyper,[status(thm)],[62,5,12,13,12,13,12,13,12,13]),
[iquote('hyper,62,5,12,13,12,13,12,13,12,13')] ).
cnf(72,plain,
p(A,s1,s1,s1,s2),
inference(hyper,[status(thm)],[70,1]),
[iquote('hyper,70,1')] ).
cnf(75,plain,
p(s0,s2,s1,s1,s2),
inference(hyper,[status(thm)],[72,2,10,11]),
[iquote('hyper,72,2,10,11')] ).
cnf(79,plain,
p(A,s2,s1,s1,s2),
inference(hyper,[status(thm)],[75,1]),
[iquote('hyper,75,1')] ).
cnf(83,plain,
p(s2,s2,s0,s1,s2),
inference(hyper,[status(thm)],[79,3,15,14,15,14]),
[iquote('hyper,79,3,15,14,15,14')] ).
cnf(87,plain,
p(A,s2,s0,s1,s2),
inference(hyper,[status(thm)],[83,1]),
[iquote('hyper,83,1')] ).
cnf(92,plain,
p(s1,s0,s0,s1,s2),
inference(hyper,[status(thm)],[87,2,13,12]),
[iquote('hyper,87,2,13,12')] ).
cnf(100,plain,
p(A,s0,s0,s1,s2),
inference(hyper,[status(thm)],[92,1]),
[iquote('hyper,92,1')] ).
cnf(107,plain,
p(s0,s0,s0,s2,s2),
inference(hyper,[status(thm)],[100,4,10,11,10,11,10,11]),
[iquote('hyper,100,4,10,11,10,11,10,11')] ).
cnf(111,plain,
p(A,s0,s0,s2,s2),
inference(hyper,[status(thm)],[107,1]),
[iquote('hyper,107,1')] ).
cnf(116,plain,
p(s2,s1,s0,s2,s2),
inference(hyper,[status(thm)],[111,2,14,15]),
[iquote('hyper,111,2,14,15')] ).
cnf(124,plain,
p(A,s1,s0,s2,s2),
inference(hyper,[status(thm)],[116,1]),
[iquote('hyper,116,1')] ).
cnf(132,plain,
p(s1,s1,s2,s2,s2),
inference(hyper,[status(thm)],[124,3,12,13,12,13]),
[iquote('hyper,124,3,12,13,12,13')] ).
cnf(140,plain,
p(A,s1,s2,s2,s2),
inference(hyper,[status(thm)],[132,1]),
[iquote('hyper,132,1')] ).
cnf(151,plain,
p(s0,s2,s2,s2,s2),
inference(hyper,[status(thm)],[140,2,10,11]),
[iquote('hyper,140,2,10,11')] ).
cnf(167,plain,
p(A,s2,s2,s2,s2),
inference(hyper,[status(thm)],[151,1]),
[iquote('hyper,151,1')] ).
cnf(168,plain,
$false,
inference(binary,[status(thm)],[167,9]),
[iquote('binary,167.1,9.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PUZ056-2.005 : TPTP v8.1.0. Released v3.5.0.
% 0.00/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n013.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 01:44:15 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.94/2.11 ----- Otter 3.3f, August 2004 -----
% 1.94/2.11 The process was started by sandbox on n013.cluster.edu,
% 1.94/2.11 Wed Jul 27 01:44:15 2022
% 1.94/2.11 The command was "./otter". The process ID is 23202.
% 1.94/2.11
% 1.94/2.11 set(prolog_style_variables).
% 1.94/2.11 set(auto).
% 1.94/2.11 dependent: set(auto1).
% 1.94/2.11 dependent: set(process_input).
% 1.94/2.11 dependent: clear(print_kept).
% 1.94/2.11 dependent: clear(print_new_demod).
% 1.94/2.11 dependent: clear(print_back_demod).
% 1.94/2.11 dependent: clear(print_back_sub).
% 1.94/2.11 dependent: set(control_memory).
% 1.94/2.11 dependent: assign(max_mem, 12000).
% 1.94/2.11 dependent: assign(pick_given_ratio, 4).
% 1.94/2.11 dependent: assign(stats_level, 1).
% 1.94/2.11 dependent: assign(max_seconds, 10800).
% 1.94/2.11 clear(print_given).
% 1.94/2.11
% 1.94/2.11 list(usable).
% 1.94/2.11 0 [] -p(I,T1,T2,T3,T4)|p(J,T1,T2,T3,T4).
% 1.94/2.11 0 [] -p(T0,I,T2,T3,T4)| -ne_q(T0,I)| -ne_q(T0,J)|p(T0,J,T2,T3,T4).
% 1.94/2.11 0 [] -p(T0,T1,I,T3,T4)| -ne_q(T0,I)| -ne_q(T0,J)| -ne_q(T1,I)| -ne_q(T1,J)|p(T0,T1,J,T3,T4).
% 1.94/2.11 0 [] -p(T0,T1,T2,I,T4)| -ne_q(T0,I)| -ne_q(T0,J)| -ne_q(T1,I)| -ne_q(T1,J)| -ne_q(T2,I)| -ne_q(T2,J)|p(T0,T1,T2,J,T4).
% 1.94/2.11 0 [] -p(T0,T1,T2,T3,I)| -ne_q(T0,I)| -ne_q(T0,J)| -ne_q(T1,I)| -ne_q(T1,J)| -ne_q(T2,I)| -ne_q(T2,J)| -ne_q(T3,I)| -ne_q(T3,J)|p(T0,T1,T2,T3,J).
% 1.94/2.11 0 [] -ne_q(s0,s0).
% 1.94/2.11 0 [] ne_q(s0,s1).
% 1.94/2.11 0 [] ne_q(s0,s2).
% 1.94/2.11 0 [] ne_q(s1,s0).
% 1.94/2.11 0 [] -ne_q(s1,s1).
% 1.94/2.11 0 [] ne_q(s1,s2).
% 1.94/2.11 0 [] ne_q(s2,s0).
% 1.94/2.11 0 [] ne_q(s2,s1).
% 1.94/2.11 0 [] -ne_q(s2,s2).
% 1.94/2.11 0 [] p(s0,s0,s0,s0,s0).
% 1.94/2.11 0 [] -p(s2,s2,s2,s2,s2).
% 1.94/2.11 end_of_list.
% 1.94/2.11
% 1.94/2.11 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=10.
% 1.94/2.11
% 1.94/2.11 This is a Horn set without equality. The strategy will
% 1.94/2.11 be hyperresolution, with satellites in sos and nuclei
% 1.94/2.11 in usable.
% 1.94/2.11
% 1.94/2.11 dependent: set(hyper_res).
% 1.94/2.11 dependent: clear(order_hyper).
% 1.94/2.11
% 1.94/2.11 ------------> process usable:
% 1.94/2.11 ** KEPT (pick-wt=12): 1 [] -p(A,B,C,D,E)|p(F,B,C,D,E).
% 1.94/2.11 ** KEPT (pick-wt=18): 2 [] -p(A,B,C,D,E)| -ne_q(A,B)| -ne_q(A,F)|p(A,F,C,D,E).
% 1.94/2.11 ** KEPT (pick-wt=24): 3 [] -p(A,B,C,D,E)| -ne_q(A,C)| -ne_q(A,F)| -ne_q(B,C)| -ne_q(B,F)|p(A,B,F,D,E).
% 1.94/2.11 ** KEPT (pick-wt=30): 4 [] -p(A,B,C,D,E)| -ne_q(A,D)| -ne_q(A,F)| -ne_q(B,D)| -ne_q(B,F)| -ne_q(C,D)| -ne_q(C,F)|p(A,B,C,F,E).
% 1.94/2.11 ** KEPT (pick-wt=36): 5 [] -p(A,B,C,D,E)| -ne_q(A,E)| -ne_q(A,F)| -ne_q(B,E)| -ne_q(B,F)| -ne_q(C,E)| -ne_q(C,F)| -ne_q(D,E)| -ne_q(D,F)|p(A,B,C,D,F).
% 1.94/2.11 ** KEPT (pick-wt=3): 6 [] -ne_q(s0,s0).
% 1.94/2.11 ** KEPT (pick-wt=3): 7 [] -ne_q(s1,s1).
% 1.94/2.11 ** KEPT (pick-wt=3): 8 [] -ne_q(s2,s2).
% 1.94/2.11 ** KEPT (pick-wt=6): 9 [] -p(s2,s2,s2,s2,s2).
% 1.94/2.11
% 1.94/2.11 ------------> process sos:
% 1.94/2.11 ** KEPT (pick-wt=3): 10 [] ne_q(s0,s1).
% 1.94/2.11 ** KEPT (pick-wt=3): 11 [] ne_q(s0,s2).
% 1.94/2.11 ** KEPT (pick-wt=3): 12 [] ne_q(s1,s0).
% 1.94/2.11 ** KEPT (pick-wt=3): 13 [] ne_q(s1,s2).
% 1.94/2.11 ** KEPT (pick-wt=3): 14 [] ne_q(s2,s0).
% 1.94/2.11 ** KEPT (pick-wt=3): 15 [] ne_q(s2,s1).
% 1.94/2.11 ** KEPT (pick-wt=6): 16 [] p(s0,s0,s0,s0,s0).
% 1.94/2.11
% 1.94/2.11 ======= end of input processing =======
% 1.94/2.11
% 1.94/2.11 =========== start of search ===========
% 1.94/2.11
% 1.94/2.11 -------- PROOF --------
% 1.94/2.11
% 1.94/2.11 ----> UNIT CONFLICT at 0.01 sec ----> 168 [binary,167.1,9.1] $F.
% 1.94/2.11
% 1.94/2.11 Length of proof is 31. Level of proof is 31.
% 1.94/2.11
% 1.94/2.11 ---------------- PROOF ----------------
% 1.94/2.11 % SZS status Unsatisfiable
% 1.94/2.11 % SZS output start Refutation
% See solution above
% 1.94/2.11 ------------ end of proof -------------
% 1.94/2.11
% 1.94/2.11
% 1.94/2.11 Search stopped by max_proofs option.
% 1.94/2.11
% 1.94/2.11
% 1.94/2.11 Search stopped by max_proofs option.
% 1.94/2.11
% 1.94/2.11 ============ end of search ============
% 1.94/2.11
% 1.94/2.11 -------------- statistics -------------
% 1.94/2.11 clauses given 142
% 1.94/2.11 clauses generated 832
% 1.94/2.11 clauses kept 167
% 1.94/2.11 clauses forward subsumed 681
% 1.94/2.11 clauses back subsumed 70
% 1.94/2.11 Kbytes malloced 976
% 1.94/2.11
% 1.94/2.11 ----------- times (seconds) -----------
% 1.94/2.11 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.94/2.11 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.94/2.11 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.94/2.11
% 1.94/2.11 That finishes the proof of the theorem.
% 1.94/2.11
% 1.94/2.11 Process 23202 finished Wed Jul 27 01:44:16 2022
% 1.94/2.11 Otter interrupted
% 1.94/2.11 PROOF FOUND
%------------------------------------------------------------------------------