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