TSTP Solution File: COL100-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : COL100-1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n028.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 12:48:14 EDT 2022
% Result : Unsatisfiable 1.95s 2.13s
% Output : Refutation 1.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of clauses : 18 ( 11 unt; 0 nHn; 17 RR)
% Number of literals : 31 ( 0 equ; 14 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-4 aty)
% Number of variables : 19 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(10,axiom,
( ~ member(pair(A,B),C)
| member(pair(A,B),trancl(C)) ),
file('COL100-1.p',unknown),
[] ).
cnf(11,axiom,
( ~ trans(A)
| ~ member(pair(B,C),A)
| ~ member(pair(C,D),A)
| member(pair(B,D),A) ),
file('COL100-1.p',unknown),
[] ).
cnf(12,axiom,
( ~ diamond(A)
| ~ member(pair(B,C),trancl(A))
| ~ member(pair(B,D),A)
| member(pair(D,diamond_strip_lemmaD_sk1(B,C,D,A)),trancl(A)) ),
file('COL100-1.p',unknown),
[] ).
cnf(13,axiom,
( ~ diamond(A)
| ~ member(pair(B,C),trancl(A))
| ~ member(pair(B,D),A)
| member(pair(C,diamond_strip_lemmaD_sk1(B,C,D,A)),A) ),
file('COL100-1.p',unknown),
[] ).
cnf(14,axiom,
( ~ member(pair(y,A),trancl(r))
| member(pair(ya,sk1(A)),trancl(r)) ),
file('COL100-1.p',unknown),
[] ).
cnf(15,axiom,
( ~ member(pair(y,A),trancl(r))
| member(pair(A,sk1(A)),trancl(r)) ),
file('COL100-1.p',unknown),
[] ).
cnf(16,axiom,
( ~ member(pair(z,A),trancl(r))
| ~ member(pair(yp,A),trancl(r)) ),
file('COL100-1.p',unknown),
[] ).
cnf(18,axiom,
trans(trancl(A)),
file('COL100-1.p',unknown),
[] ).
cnf(19,axiom,
diamond(r),
file('COL100-1.p',unknown),
[] ).
cnf(21,axiom,
member(pair(ya,z),r),
file('COL100-1.p',unknown),
[] ).
cnf(22,axiom,
member(pair(y,yp),trancl(r)),
file('COL100-1.p',unknown),
[] ).
cnf(48,plain,
member(pair(yp,sk1(yp)),trancl(r)),
inference(hyper,[status(thm)],[22,15]),
[iquote('hyper,22,15')] ).
cnf(49,plain,
member(pair(ya,sk1(yp)),trancl(r)),
inference(hyper,[status(thm)],[22,14]),
[iquote('hyper,22,14')] ).
cnf(136,plain,
member(pair(sk1(yp),diamond_strip_lemmaD_sk1(ya,sk1(yp),z,r)),r),
inference(hyper,[status(thm)],[49,13,19,21]),
[iquote('hyper,49,13,19,21')] ).
cnf(137,plain,
member(pair(z,diamond_strip_lemmaD_sk1(ya,sk1(yp),z,r)),trancl(r)),
inference(hyper,[status(thm)],[49,12,19,21]),
[iquote('hyper,49,12,19,21')] ).
cnf(2121,plain,
member(pair(sk1(yp),diamond_strip_lemmaD_sk1(ya,sk1(yp),z,r)),trancl(r)),
inference(hyper,[status(thm)],[136,10]),
[iquote('hyper,136,10')] ).
cnf(3949,plain,
member(pair(yp,diamond_strip_lemmaD_sk1(ya,sk1(yp),z,r)),trancl(r)),
inference(hyper,[status(thm)],[2121,11,18,48]),
[iquote('hyper,2121,11,18,48')] ).
cnf(3973,plain,
$false,
inference(hyper,[status(thm)],[3949,16,137]),
[iquote('hyper,3949,16,137')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COL100-1 : TPTP v8.1.0. Released v2.7.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n028.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 02:30:33 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.95/2.13 ----- Otter 3.3f, August 2004 -----
% 1.95/2.13 The process was started by sandbox on n028.cluster.edu,
% 1.95/2.13 Wed Jul 27 02:30:33 2022
% 1.95/2.13 The command was "./otter". The process ID is 6377.
% 1.95/2.13
% 1.95/2.13 set(prolog_style_variables).
% 1.95/2.13 set(auto).
% 1.95/2.13 dependent: set(auto1).
% 1.95/2.13 dependent: set(process_input).
% 1.95/2.13 dependent: clear(print_kept).
% 1.95/2.13 dependent: clear(print_new_demod).
% 1.95/2.13 dependent: clear(print_back_demod).
% 1.95/2.13 dependent: clear(print_back_sub).
% 1.95/2.13 dependent: set(control_memory).
% 1.95/2.13 dependent: assign(max_mem, 12000).
% 1.95/2.13 dependent: assign(pick_given_ratio, 4).
% 1.95/2.13 dependent: assign(stats_level, 1).
% 1.95/2.13 dependent: assign(max_seconds, 10800).
% 1.95/2.13 clear(print_given).
% 1.95/2.13
% 1.95/2.13 list(usable).
% 1.95/2.13 0 [] A=A.
% 1.95/2.13 0 [] combK!=combS.
% 1.95/2.13 0 [] combK!=comb_app(P,Q).
% 1.95/2.13 0 [] combS!=comb_app(P,Q).
% 1.95/2.13 0 [] comb_app(P1,Q1)!=comb_app(P2,Q2)|P1=P2.
% 1.95/2.13 0 [] comb_app(P1,Q1)!=comb_app(P2,Q2)|Q1=Q2.
% 1.95/2.13 0 [] P1!=P2|Q1!=Q2|comb_app(P1,Q1)=comb_app(P2,Q2).
% 1.95/2.13 0 [] -member(pair(A,B),R)|member(pair(A,B),trancl(R)).
% 1.95/2.13 0 [] trans(trancl(R)).
% 1.95/2.13 0 [] -trans(R)| -member(pair(A,B),R)| -member(pair(B,C),R)|member(pair(A,C),R).
% 1.95/2.13 0 [] -diamond(R)| -member(pair(X,Y),trancl(R))| -member(pair(X,YP),R)|member(pair(YP,diamond_strip_lemmaD_sk1(X,Y,YP,R)),trancl(R)).
% 1.95/2.13 0 [] -diamond(R)| -member(pair(X,Y),trancl(R))| -member(pair(X,YP),R)|member(pair(Y,diamond_strip_lemmaD_sk1(X,Y,YP,R)),R).
% 1.95/2.13 0 [] diamond(r).
% 1.95/2.13 0 [] member(pair(y,ya),trancl(r)).
% 1.95/2.13 0 [] member(pair(ya,z),r).
% 1.95/2.13 0 [] -member(pair(y,YP),trancl(r))|member(pair(ya,sk1(YP)),trancl(r)).
% 1.95/2.13 0 [] -member(pair(y,YP),trancl(r))|member(pair(YP,sk1(YP)),trancl(r)).
% 1.95/2.13 0 [] member(pair(y,yp),trancl(r)).
% 1.95/2.13 0 [] -member(pair(z,ZA),trancl(r))| -member(pair(yp,ZA),trancl(r)).
% 1.95/2.13 end_of_list.
% 1.95/2.13
% 1.95/2.13 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 1.95/2.13
% 1.95/2.13 This is a Horn set with equality. The strategy will be
% 1.95/2.13 Knuth-Bendix and hyper_res, with positive clauses in
% 1.95/2.13 sos and nonpositive clauses in usable.
% 1.95/2.13
% 1.95/2.13 dependent: set(knuth_bendix).
% 1.95/2.13 dependent: set(anl_eq).
% 1.95/2.13 dependent: set(para_from).
% 1.95/2.13 dependent: set(para_into).
% 1.95/2.13 dependent: clear(para_from_right).
% 1.95/2.13 dependent: clear(para_into_right).
% 1.95/2.13 dependent: set(para_from_vars).
% 1.95/2.13 dependent: set(eq_units_both_ways).
% 1.95/2.13 dependent: set(dynamic_demod_all).
% 1.95/2.13 dependent: set(dynamic_demod).
% 1.95/2.13 dependent: set(order_eq).
% 1.95/2.13 dependent: set(back_demod).
% 1.95/2.13 dependent: set(lrpo).
% 1.95/2.13 dependent: set(hyper_res).
% 1.95/2.13 dependent: clear(order_hyper).
% 1.95/2.13
% 1.95/2.13 ------------> process usable:
% 1.95/2.13 ** KEPT (pick-wt=3): 2 [copy,1,flip.1] combS!=combK.
% 1.95/2.13 ** KEPT (pick-wt=5): 4 [copy,3,flip.1] comb_app(A,B)!=combK.
% 1.95/2.13 ** KEPT (pick-wt=5): 6 [copy,5,flip.1] comb_app(A,B)!=combS.
% 1.95/2.13 ** KEPT (pick-wt=10): 7 [] comb_app(A,B)!=comb_app(C,D)|A=C.
% 1.95/2.13 ** KEPT (pick-wt=10): 8 [] comb_app(A,B)!=comb_app(C,D)|B=D.
% 1.95/2.13 ** KEPT (pick-wt=13): 9 [] A!=B|C!=D|comb_app(A,C)=comb_app(B,D).
% 1.95/2.13 ** KEPT (pick-wt=11): 10 [] -member(pair(A,B),C)|member(pair(A,B),trancl(C)).
% 1.95/2.13 ** KEPT (pick-wt=17): 11 [] -trans(A)| -member(pair(B,C),A)| -member(pair(C,D),A)|member(pair(B,D),A).
% 1.95/2.13 ** KEPT (pick-wt=23): 12 [] -diamond(A)| -member(pair(B,C),trancl(A))| -member(pair(B,D),A)|member(pair(D,diamond_strip_lemmaD_sk1(B,C,D,A)),trancl(A)).
% 1.95/2.13 ** KEPT (pick-wt=22): 13 [] -diamond(A)| -member(pair(B,C),trancl(A))| -member(pair(B,D),A)|member(pair(C,diamond_strip_lemmaD_sk1(B,C,D,A)),A).
% 1.95/2.13 ** KEPT (pick-wt=13): 14 [] -member(pair(y,A),trancl(r))|member(pair(ya,sk1(A)),trancl(r)).
% 1.95/2.13 ** KEPT (pick-wt=13): 15 [] -member(pair(y,A),trancl(r))|member(pair(A,sk1(A)),trancl(r)).
% 1.95/2.13 ** KEPT (pick-wt=12): 16 [] -member(pair(z,A),trancl(r))| -member(pair(yp,A),trancl(r)).
% 1.95/2.13
% 1.95/2.13 ------------> process sos:
% 1.95/2.13 ** KEPT (pick-wt=3): 17 [] A=A.
% 1.95/2.13 ** KEPT (pick-wt=3): 18 [] trans(trancl(A)).
% 1.95/2.13 ** KEPT (pick-wt=2): 19 [] diamond(r).
% 1.95/2.13 ** KEPT (pick-wt=6): 20 [] member(pair(y,ya),trancl(r)).
% 1.95/2.13 ** KEPT (pick-wt=5): 21 [] member(pair(ya,z),r).
% 1.95/2.13 ** KEPT (pick-wt=6): 22 [] member(pair(y,yp),trancl(r)).
% 1.95/2.13 Following clause subsumed by 17 during input processing: 0 [copy,17,flip.1] A=A.
% 1.95/2.13
% 1.95/2.13 ======= end of input processing =======
% 1.95/2.13
% 1.95/2.13 =========== start of search ===========
% 1.95/2.13
% 1.95/2.13 -------- PROOF --------
% 1.95/2.13
% 1.95/2.13 -----> EMPTY CLAUSE at 0.18 sec ----> 3973 [hyper,3949,16,137] $F.
% 1.95/2.13
% 1.95/2.13 Length of proof is 6. Level of proof is 4.
% 1.95/2.13
% 1.95/2.13 ---------------- PROOF ----------------
% 1.95/2.13 % SZS status Unsatisfiable
% 1.95/2.13 % SZS output start Refutation
% See solution above
% 1.95/2.13 ------------ end of proof -------------
% 1.95/2.13
% 1.95/2.13
% 1.95/2.13 Search stopped by max_proofs option.
% 1.95/2.13
% 1.95/2.13
% 1.95/2.13 Search stopped by max_proofs option.
% 1.95/2.13
% 1.95/2.13 ============ end of search ============
% 1.95/2.13
% 1.95/2.13 -------------- statistics -------------
% 1.95/2.13 clauses given 233
% 1.95/2.13 clauses generated 4276
% 1.95/2.13 clauses kept 3969
% 1.95/2.13 clauses forward subsumed 326
% 1.95/2.13 clauses back subsumed 0
% 1.95/2.13 Kbytes malloced 3906
% 1.95/2.13
% 1.95/2.13 ----------- times (seconds) -----------
% 1.95/2.13 user CPU time 0.18 (0 hr, 0 min, 0 sec)
% 1.95/2.13 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.95/2.13 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.95/2.13
% 1.95/2.13 That finishes the proof of the theorem.
% 1.95/2.13
% 1.95/2.13 Process 6377 finished Wed Jul 27 02:30:35 2022
% 1.95/2.13 Otter interrupted
% 1.95/2.13 PROOF FOUND
%------------------------------------------------------------------------------