TSTP Solution File: LAT005-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LAT005-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n024.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:01:45 EDT 2022
% Result : Unsatisfiable 1.73s 1.97s
% Output : Refutation 1.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 19
% Syntax : Number of clauses : 37 ( 31 unt; 0 nHn; 32 RR)
% Number of literals : 53 ( 0 equ; 17 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 12 con; 0-0 aty)
% Number of variables : 35 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ join(A,B,C)
| join(B,A,C) ),
file('LAT005-1.p',unknown),
[] ).
cnf(4,axiom,
( ~ join(A,B,C)
| meet(A,C,A) ),
file('LAT005-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ meet(A,B,C)
| ~ meet(B,D,E)
| ~ meet(A,E,F)
| meet(C,D,F) ),
file('LAT005-1.p',unknown),
[] ).
cnf(6,axiom,
( ~ meet(A,B,C)
| ~ meet(B,D,E)
| ~ meet(C,D,F)
| meet(A,E,F) ),
file('LAT005-1.p',unknown),
[] ).
cnf(10,axiom,
( ~ meet(A,B,A)
| ~ join(A,C,D)
| ~ meet(C,B,E)
| ~ join(A,E,F)
| meet(B,D,F) ),
file('LAT005-1.p',unknown),
[] ).
cnf(11,axiom,
( ~ meet(A,B,B)
| ~ join(C,B,D)
| ~ meet(A,C,E)
| ~ meet(A,D,F)
| join(B,E,F) ),
file('LAT005-1.p',unknown),
[] ).
cnf(13,axiom,
~ meet(a2,b2,r1),
file('LAT005-1.p',unknown),
[] ).
cnf(16,axiom,
join(n0,A,A),
file('LAT005-1.p',unknown),
[] ).
cnf(17,axiom,
meet(n0,A,n0),
file('LAT005-1.p',unknown),
[] ).
cnf(18,axiom,
meet(A,A,A),
file('LAT005-1.p',unknown),
[] ).
cnf(19,axiom,
meet(n1,A,A),
file('LAT005-1.p',unknown),
[] ).
cnf(20,axiom,
meet(a,b,c),
file('LAT005-1.p',unknown),
[] ).
cnf(22,axiom,
meet(c,r2,n0),
file('LAT005-1.p',unknown),
[] ).
cnf(23,axiom,
meet(r2,b,e),
file('LAT005-1.p',unknown),
[] ).
cnf(24,axiom,
join(a,b,c2),
file('LAT005-1.p',unknown),
[] ).
cnf(26,axiom,
meet(c2,r1,n0),
file('LAT005-1.p',unknown),
[] ).
cnf(27,axiom,
meet(r2,a,d),
file('LAT005-1.p',unknown),
[] ).
cnf(28,axiom,
join(r1,e,a2),
file('LAT005-1.p',unknown),
[] ).
cnf(29,axiom,
join(r1,d,b2),
file('LAT005-1.p',unknown),
[] ).
cnf(31,plain,
join(A,n0,A),
inference(hyper,[status(thm)],[16,2]),
[iquote('hyper,16,2')] ).
cnf(39,plain,
meet(r2,c,n0),
inference(hyper,[status(thm)],[22,10,17,16,16]),
[iquote('hyper,22,10,17,16,16')] ).
cnf(40,plain,
meet(b,r2,e),
inference(hyper,[status(thm)],[23,10,17,16,16]),
[iquote('hyper,23,10,17,16,16')] ).
cnf(43,plain,
meet(e,b,e),
inference(hyper,[status(thm)],[23,5,23,18]),
[iquote('hyper,23,5,23,18')] ).
cnf(45,plain,
join(b,a,c2),
inference(hyper,[status(thm)],[24,11,19,19,19]),
[iquote('hyper,24,11,19,19,19')] ).
cnf(48,plain,
meet(a,c2,a),
inference(hyper,[status(thm)],[24,4]),
[iquote('hyper,24,4')] ).
cnf(50,plain,
meet(r1,c2,n0),
inference(hyper,[status(thm)],[26,10,17,16,16]),
[iquote('hyper,26,10,17,16,16')] ).
cnf(56,plain,
join(e,r1,a2),
inference(hyper,[status(thm)],[28,11,19,19,19]),
[iquote('hyper,28,11,19,19,19')] ).
cnf(60,plain,
meet(r1,a2,r1),
inference(hyper,[status(thm)],[28,4]),
[iquote('hyper,28,4')] ).
cnf(74,plain,
meet(d,b,n0),
inference(hyper,[status(thm)],[39,5,27,20]),
[iquote('hyper,39,5,27,20')] ).
cnf(86,plain,
meet(b,c2,b),
inference(hyper,[status(thm)],[45,4]),
[iquote('hyper,45,4')] ).
cnf(89,plain,
meet(d,c2,d),
inference(hyper,[status(thm)],[48,5,27,27]),
[iquote('hyper,48,5,27,27')] ).
cnf(115,plain,
meet(d,e,n0),
inference(hyper,[status(thm)],[74,6,40,17]),
[iquote('hyper,74,6,40,17')] ).
cnf(120,plain,
meet(e,c2,e),
inference(hyper,[status(thm)],[86,5,43,43]),
[iquote('hyper,86,5,43,43')] ).
cnf(140,plain,
meet(c2,a2,e),
inference(hyper,[status(thm)],[120,10,56,50,31]),
[iquote('hyper,120,10,56,50,31')] ).
cnf(155,plain,
meet(d,a2,n0),
inference(hyper,[status(thm)],[140,5,89,115]),
[iquote('hyper,140,5,89,115')] ).
cnf(167,plain,
meet(a2,b2,r1),
inference(hyper,[status(thm)],[155,10,60,29,31]),
[iquote('hyper,155,10,60,29,31')] ).
cnf(168,plain,
$false,
inference(binary,[status(thm)],[167,13]),
[iquote('binary,167.1,13.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LAT005-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n024.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 08:32:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.73/1.96 ----- Otter 3.3f, August 2004 -----
% 1.73/1.96 The process was started by sandbox on n024.cluster.edu,
% 1.73/1.96 Wed Jul 27 08:32:25 2022
% 1.73/1.96 The command was "./otter". The process ID is 6214.
% 1.73/1.96
% 1.73/1.96 set(prolog_style_variables).
% 1.73/1.96 set(auto).
% 1.73/1.96 dependent: set(auto1).
% 1.73/1.96 dependent: set(process_input).
% 1.73/1.96 dependent: clear(print_kept).
% 1.73/1.96 dependent: clear(print_new_demod).
% 1.73/1.96 dependent: clear(print_back_demod).
% 1.73/1.96 dependent: clear(print_back_sub).
% 1.73/1.96 dependent: set(control_memory).
% 1.73/1.96 dependent: assign(max_mem, 12000).
% 1.73/1.96 dependent: assign(pick_given_ratio, 4).
% 1.73/1.96 dependent: assign(stats_level, 1).
% 1.73/1.96 dependent: assign(max_seconds, 10800).
% 1.73/1.96 clear(print_given).
% 1.73/1.96
% 1.73/1.96 list(usable).
% 1.73/1.96 0 [] join(n1,X,n1).
% 1.73/1.96 0 [] join(X,X,X).
% 1.73/1.96 0 [] join(n0,X,X).
% 1.73/1.96 0 [] meet(n0,X,n0).
% 1.73/1.96 0 [] meet(X,X,X).
% 1.73/1.96 0 [] meet(n1,X,X).
% 1.73/1.96 0 [] -meet(X,Y,Z)|meet(Y,X,Z).
% 1.73/1.96 0 [] -join(X,Y,Z)|join(Y,X,Z).
% 1.73/1.96 0 [] -meet(X,Y,Z)|join(X,Z,X).
% 1.73/1.96 0 [] -join(X,Y,Z)|meet(X,Z,X).
% 1.73/1.96 0 [] -meet(X,Y,Xy)| -meet(Y,Z,Yz)| -meet(X,Yz,Xyz)|meet(Xy,Z,Xyz).
% 1.73/1.96 0 [] -meet(X,Y,Xy)| -meet(Y,Z,Yz)| -meet(Xy,Z,Xyz)|meet(X,Yz,Xyz).
% 1.73/1.96 0 [] -join(X,Y,Xy)| -join(Y,Z,Yz)| -join(X,Yz,Xyz)|join(Xy,Z,Xyz).
% 1.73/1.96 0 [] -join(X,Y,Xy)| -join(Y,Z,Yz)| -join(Xy,Z,Xyz)|join(X,Yz,Xyz).
% 1.73/1.96 0 [] -meet(X,Z,X)| -join(X,Y,X1)| -meet(Y,Z,Y1)| -meet(Z,X1,Z1)|join(X,Y1,Z1).
% 1.73/1.96 0 [] -meet(X,Z,X)| -join(X,Y,X1)| -meet(Y,Z,Y1)| -join(X,Y1,Z1)|meet(Z,X1,Z1).
% 1.73/1.96 0 [] -meet(X,Z,Z)| -join(Y,Z,Y1)| -meet(X,Y,X1)| -meet(X,Y1,Z1)|join(Z,X1,Z1).
% 1.73/1.96 0 [] -meet(X,Z,Z)| -join(Y,Z,Y1)| -meet(X,Y,X1)| -join(Z,X1,Z1)|meet(X,Y1,Z1).
% 1.73/1.96 0 [] meet(a,b,c).
% 1.73/1.96 0 [] join(c,r2,n1).
% 1.73/1.96 0 [] meet(c,r2,n0).
% 1.73/1.96 0 [] meet(r2,b,e).
% 1.73/1.96 0 [] join(a,b,c2).
% 1.73/1.96 0 [] join(c2,r1,n1).
% 1.73/1.96 0 [] meet(c2,r1,n0).
% 1.73/1.96 0 [] meet(r2,a,d).
% 1.73/1.96 0 [] join(r1,e,a2).
% 1.73/1.96 0 [] join(r1,d,b2).
% 1.73/1.96 0 [] -meet(a2,b2,r1).
% 1.73/1.96 end_of_list.
% 1.73/1.96
% 1.73/1.96 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=5.
% 1.73/1.96
% 1.73/1.96 This is a Horn set without equality. The strategy will
% 1.73/1.96 be hyperresolution, with satellites in sos and nuclei
% 1.73/1.96 in usable.
% 1.73/1.96
% 1.73/1.96 dependent: set(hyper_res).
% 1.73/1.96 dependent: clear(order_hyper).
% 1.73/1.96
% 1.73/1.96 ------------> process usable:
% 1.73/1.96 ** KEPT (pick-wt=8): 1 [] -meet(A,B,C)|meet(B,A,C).
% 1.73/1.96 ** KEPT (pick-wt=8): 2 [] -join(A,B,C)|join(B,A,C).
% 1.73/1.97 ** KEPT (pick-wt=8): 3 [] -meet(A,B,C)|join(A,C,A).
% 1.73/1.97 ** KEPT (pick-wt=8): 4 [] -join(A,B,C)|meet(A,C,A).
% 1.73/1.97 ** KEPT (pick-wt=16): 5 [] -meet(A,B,C)| -meet(B,D,E)| -meet(A,E,F)|meet(C,D,F).
% 1.73/1.97 ** KEPT (pick-wt=16): 6 [] -meet(A,B,C)| -meet(B,D,E)| -meet(C,D,F)|meet(A,E,F).
% 1.73/1.97 ** KEPT (pick-wt=16): 7 [] -join(A,B,C)| -join(B,D,E)| -join(A,E,F)|join(C,D,F).
% 1.73/1.97 ** KEPT (pick-wt=16): 8 [] -join(A,B,C)| -join(B,D,E)| -join(C,D,F)|join(A,E,F).
% 1.73/1.97 ** KEPT (pick-wt=20): 9 [] -meet(A,B,A)| -join(A,C,D)| -meet(C,B,E)| -meet(B,D,F)|join(A,E,F).
% 1.73/1.97 ** KEPT (pick-wt=20): 10 [] -meet(A,B,A)| -join(A,C,D)| -meet(C,B,E)| -join(A,E,F)|meet(B,D,F).
% 1.73/1.97 ** KEPT (pick-wt=20): 11 [] -meet(A,B,B)| -join(C,B,D)| -meet(A,C,E)| -meet(A,D,F)|join(B,E,F).
% 1.73/1.97 ** KEPT (pick-wt=20): 12 [] -meet(A,B,B)| -join(C,B,D)| -meet(A,C,E)| -join(B,E,F)|meet(A,D,F).
% 1.73/1.97 ** KEPT (pick-wt=4): 13 [] -meet(a2,b2,r1).
% 1.73/1.97
% 1.73/1.97 ------------> process sos:
% 1.73/1.97 ** KEPT (pick-wt=4): 14 [] join(n1,A,n1).
% 1.73/1.97 ** KEPT (pick-wt=4): 15 [] join(A,A,A).
% 1.73/1.97 ** KEPT (pick-wt=4): 16 [] join(n0,A,A).
% 1.73/1.97 ** KEPT (pick-wt=4): 17 [] meet(n0,A,n0).
% 1.73/1.97 ** KEPT (pick-wt=4): 18 [] meet(A,A,A).
% 1.73/1.97 ** KEPT (pick-wt=4): 19 [] meet(n1,A,A).
% 1.73/1.97 ** KEPT (pick-wt=4): 20 [] meet(a,b,c).
% 1.73/1.97 ** KEPT (pick-wt=4): 21 [] join(c,r2,n1).
% 1.73/1.97 ** KEPT (pick-wt=4): 22 [] meet(c,r2,n0).
% 1.73/1.97 ** KEPT (pick-wt=4): 23 [] meet(r2,b,e).
% 1.73/1.97 ** KEPT (pick-wt=4): 24 [] join(a,b,c2).
% 1.73/1.97 ** KEPT (pick-wt=4): 25 [] join(c2,r1,n1).
% 1.73/1.97 ** KEPT (pick-wt=4): 26 [] meet(c2,r1,n0).
% 1.73/1.97 ** KEPT (pick-wt=4): 27 [] meet(r2,a,d).
% 1.73/1.97 ** KEPT (pick-wt=4): 28 [] join(r1,e,a2).
% 1.73/1.97 ** KEPT (pick-wt=4): 29 [] join(r1,d,b2).
% 1.73/1.97
% 1.73/1.97 ======= end of input processing =======
% 1.73/1.97
% 1.73/1.97 =========== start of search ===========
% 1.73/1.97
% 1.73/1.97 -------- PROOF --------
% 1.73/1.97
% 1.73/1.97 ----> UNIT CONFLICT at 0.06 sec ----> 168 [binary,167.1,13.1] $F.
% 1.73/1.97
% 1.73/1.97 Length of proof is 17. Level of proof is 6.
% 1.73/1.97
% 1.73/1.97 ---------------- PROOF ----------------
% 1.73/1.97 % SZS status Unsatisfiable
% 1.73/1.97 % SZS output start Refutation
% See solution above
% 1.73/1.97 ------------ end of proof -------------
% 1.73/1.97
% 1.73/1.97
% 1.73/1.97 Search stopped by max_proofs option.
% 1.73/1.97
% 1.73/1.97
% 1.73/1.97 Search stopped by max_proofs option.
% 1.73/1.97
% 1.73/1.97 ============ end of search ============
% 1.73/1.97
% 1.73/1.97 -------------- statistics -------------
% 1.73/1.97 clauses given 142
% 1.73/1.97 clauses generated 8390
% 1.73/1.97 clauses kept 167
% 1.73/1.97 clauses forward subsumed 8252
% 1.73/1.97 clauses back subsumed 0
% 1.73/1.97 Kbytes malloced 976
% 1.73/1.97
% 1.73/1.97 ----------- times (seconds) -----------
% 1.73/1.97 user CPU time 0.06 (0 hr, 0 min, 0 sec)
% 1.73/1.97 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.73/1.97 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.73/1.97
% 1.73/1.97 That finishes the proof of the theorem.
% 1.73/1.97
% 1.73/1.97 Process 6214 finished Wed Jul 27 08:32:26 2022
% 1.73/1.97 Otter interrupted
% 1.73/1.97 PROOF FOUND
%------------------------------------------------------------------------------