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