TSTP Solution File: LAT005-6 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LAT005-6 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n017.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:46 EDT 2022
% Result : Unsatisfiable 2.04s 2.25s
% Output : Refutation 2.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 23
% Syntax : Number of clauses : 43 ( 36 unt; 0 nHn; 33 RR)
% Number of literals : 62 ( 5 equ; 20 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 12 con; 0-2 aty)
% Number of variables : 47 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
( ~ join(A,B,C)
| meet(A,C,A) ),
file('LAT005-6.p',unknown),
[] ).
cnf(5,axiom,
( ~ meet(A,B,C)
| ~ meet(B,D,E)
| ~ meet(A,E,F)
| meet(C,D,F) ),
file('LAT005-6.p',unknown),
[] ).
cnf(6,axiom,
( ~ meet(A,B,C)
| ~ meet(B,D,E)
| ~ meet(C,D,F)
| meet(A,E,F) ),
file('LAT005-6.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-6.p',unknown),
[] ).
cnf(11,axiom,
( ~ meet(A,B,C)
| ~ meet(A,B,D)
| C = D ),
file('LAT005-6.p',unknown),
[] ).
cnf(12,axiom,
( ~ join(A,B,C)
| ~ join(A,B,D)
| C = D ),
file('LAT005-6.p',unknown),
[] ).
cnf(13,axiom,
( ~ meet(A,B,B)
| ~ join(C,B,D)
| ~ meet(A,C,E)
| ~ meet(A,D,F)
| join(B,E,F) ),
file('LAT005-6.p',unknown),
[] ).
cnf(15,axiom,
~ meet(a2,b2,r1),
file('LAT005-6.p',unknown),
[] ).
cnf(19,axiom,
join(n0,A,A),
file('LAT005-6.p',unknown),
[] ).
cnf(20,axiom,
meet(n0,A,n0),
file('LAT005-6.p',unknown),
[] ).
cnf(21,axiom,
meet(A,A,A),
file('LAT005-6.p',unknown),
[] ).
cnf(22,axiom,
meet(n1,A,A),
file('LAT005-6.p',unknown),
[] ).
cnf(23,axiom,
meet(A,B,meet_of(A,B)),
file('LAT005-6.p',unknown),
[] ).
cnf(24,axiom,
join(A,B,join_of(A,B)),
file('LAT005-6.p',unknown),
[] ).
cnf(26,axiom,
join(A,n0,A),
file('LAT005-6.p',unknown),
[] ).
cnf(29,axiom,
meet(a,b,c),
file('LAT005-6.p',unknown),
[] ).
cnf(31,axiom,
meet(c,r2,n0),
file('LAT005-6.p',unknown),
[] ).
cnf(32,axiom,
meet(r2,b,e),
file('LAT005-6.p',unknown),
[] ).
cnf(33,axiom,
join(a,b,c2),
file('LAT005-6.p',unknown),
[] ).
cnf(35,axiom,
meet(c2,r1,n0),
file('LAT005-6.p',unknown),
[] ).
cnf(36,axiom,
meet(r2,a,d),
file('LAT005-6.p',unknown),
[] ).
cnf(37,axiom,
join(r1,e,a2),
file('LAT005-6.p',unknown),
[] ).
cnf(38,axiom,
join(r1,d,b2),
file('LAT005-6.p',unknown),
[] ).
cnf(91,plain,
meet_of(n1,A) = A,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[23,11,22])]),
[iquote('hyper,23,11,22,flip.1')] ).
cnf(95,plain,
meet_of(n0,A) = n0,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[23,11,20])]),
[iquote('hyper,23,11,20,flip.1')] ).
cnf(155,plain,
meet(r2,c,n0),
inference(hyper,[status(thm)],[31,10,20,19,26]),
[iquote('hyper,31,10,20,19,26')] ).
cnf(252,plain,
join_of(n0,A) = A,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[24,12,19])]),
[iquote('hyper,24,12,19,flip.1')] ).
cnf(286,plain,
meet(b,r2,e),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[32,10,20,24,24]),252,252]),
[iquote('hyper,32,10,20,24,24,demod,252,252')] ).
cnf(296,plain,
meet(e,b,e),
inference(hyper,[status(thm)],[32,5,32,21]),
[iquote('hyper,32,5,32,21')] ).
cnf(312,plain,
join(b,a,c2),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[33,13,22,23,23]),91,91]),
[iquote('hyper,33,13,22,23,23,demod,91,91')] ).
cnf(328,plain,
meet(a,c2,a),
inference(hyper,[status(thm)],[33,4]),
[iquote('hyper,33,4')] ).
cnf(360,plain,
meet(r1,c2,n0),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[35,10,20,24,26]),252]),
[iquote('hyper,35,10,20,24,26,demod,252')] ).
cnf(409,plain,
join(e,r1,a2),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[37,13,22,23,23]),91,91]),
[iquote('hyper,37,13,22,23,23,demod,91,91')] ).
cnf(427,plain,
meet(r1,a2,r1),
inference(hyper,[status(thm)],[37,4]),
[iquote('hyper,37,4')] ).
cnf(607,plain,
meet(d,b,n0),
inference(hyper,[status(thm)],[155,5,36,29]),
[iquote('hyper,155,5,36,29')] ).
cnf(794,plain,
meet(b,c2,b),
inference(hyper,[status(thm)],[312,4]),
[iquote('hyper,312,4')] ).
cnf(875,plain,
meet(d,c2,d),
inference(hyper,[status(thm)],[328,5,36,36]),
[iquote('hyper,328,5,36,36')] ).
cnf(1554,plain,
meet(d,e,n0),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[607,6,286,23]),95]),
[iquote('hyper,607,6,286,23,demod,95')] ).
cnf(1847,plain,
meet(e,c2,e),
inference(hyper,[status(thm)],[794,5,296,296]),
[iquote('hyper,794,5,296,296')] ).
cnf(4108,plain,
meet(c2,a2,e),
inference(hyper,[status(thm)],[1847,10,409,360,26]),
[iquote('hyper,1847,10,409,360,26')] ).
cnf(5325,plain,
meet(d,a2,n0),
inference(hyper,[status(thm)],[4108,5,875,1554]),
[iquote('hyper,4108,5,875,1554')] ).
cnf(5552,plain,
meet(a2,b2,r1),
inference(hyper,[status(thm)],[5325,10,427,38,26]),
[iquote('hyper,5325,10,427,38,26')] ).
cnf(5553,plain,
$false,
inference(binary,[status(thm)],[5552,15]),
[iquote('binary,5552.1,15.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LAT005-6 : TPTP v8.1.0. Released v1.1.0.
% 0.10/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n017.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 07:51:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.58/1.79 ----- Otter 3.3f, August 2004 -----
% 1.58/1.79 The process was started by sandbox2 on n017.cluster.edu,
% 1.58/1.79 Wed Jul 27 07:51:03 2022
% 1.58/1.79 The command was "./otter". The process ID is 18916.
% 1.58/1.79
% 1.58/1.79 set(prolog_style_variables).
% 1.58/1.79 set(auto).
% 1.58/1.79 dependent: set(auto1).
% 1.58/1.79 dependent: set(process_input).
% 1.58/1.79 dependent: clear(print_kept).
% 1.58/1.79 dependent: clear(print_new_demod).
% 1.58/1.79 dependent: clear(print_back_demod).
% 1.58/1.79 dependent: clear(print_back_sub).
% 1.58/1.79 dependent: set(control_memory).
% 1.58/1.79 dependent: assign(max_mem, 12000).
% 1.58/1.79 dependent: assign(pick_given_ratio, 4).
% 1.58/1.79 dependent: assign(stats_level, 1).
% 1.58/1.79 dependent: assign(max_seconds, 10800).
% 1.58/1.79 clear(print_given).
% 1.58/1.79
% 1.58/1.79 list(usable).
% 1.58/1.79 0 [] A=A.
% 1.58/1.79 0 [] join(n1,X,n1).
% 1.58/1.79 0 [] join(X,X,X).
% 1.58/1.79 0 [] join(n0,X,X).
% 1.58/1.79 0 [] meet(n0,X,n0).
% 1.58/1.79 0 [] meet(X,X,X).
% 1.58/1.79 0 [] meet(n1,X,X).
% 1.58/1.79 0 [] -meet(X,Y,Z)|meet(Y,X,Z).
% 1.58/1.79 0 [] -join(X,Y,Z)|join(Y,X,Z).
% 1.58/1.79 0 [] -meet(X,Y,Z)|join(X,Z,X).
% 1.58/1.79 0 [] -join(X,Y,Z)|meet(X,Z,X).
% 1.58/1.79 0 [] -meet(X,Y,Xy)| -meet(Y,Z,Yz)| -meet(X,Yz,Xyz)|meet(Xy,Z,Xyz).
% 1.58/1.79 0 [] -meet(X,Y,Xy)| -meet(Y,Z,Yz)| -meet(Xy,Z,Xyz)|meet(X,Yz,Xyz).
% 1.58/1.79 0 [] -join(X,Y,Xy)| -join(Y,Z,Yz)| -join(X,Yz,Xyz)|join(Xy,Z,Xyz).
% 1.58/1.79 0 [] -join(X,Y,Xy)| -join(Y,Z,Yz)| -join(Xy,Z,Xyz)|join(X,Yz,Xyz).
% 1.58/1.79 0 [] -meet(X,Z,X)| -join(X,Y,X1)| -meet(Y,Z,Y1)| -meet(Z,X1,Z1)|join(X,Y1,Z1).
% 1.58/1.79 0 [] -meet(X,Z,X)| -join(X,Y,X1)| -meet(Y,Z,Y1)| -join(X,Y1,Z1)|meet(Z,X1,Z1).
% 1.58/1.79 0 [] meet(X,Y,meet_of(X,Y)).
% 1.58/1.79 0 [] -meet(X,Y,Z1)| -meet(X,Y,Z2)|Z1=Z2.
% 1.58/1.79 0 [] join(X,Y,join_of(X,Y)).
% 1.58/1.79 0 [] -join(X,Y,Z1)| -join(X,Y,Z2)|Z1=Z2.
% 1.58/1.79 0 [] join(X,n1,n1).
% 1.58/1.79 0 [] join(X,n0,X).
% 1.58/1.79 0 [] meet(X,n0,n0).
% 1.58/1.79 0 [] meet(X,n1,X).
% 1.58/1.79 0 [] -meet(X,Z,Z)| -join(Y,Z,Y1)| -meet(X,Y,X1)| -meet(X,Y1,Z1)|join(Z,X1,Z1).
% 1.58/1.79 0 [] -meet(X,Z,Z)| -join(Y,Z,Y1)| -meet(X,Y,X1)| -join(Z,X1,Z1)|meet(X,Y1,Z1).
% 1.58/1.79 0 [] meet(a,b,c).
% 1.58/1.79 0 [] join(c,r2,n1).
% 1.58/1.79 0 [] meet(c,r2,n0).
% 1.58/1.79 0 [] meet(r2,b,e).
% 1.58/1.79 0 [] join(a,b,c2).
% 1.58/1.79 0 [] join(c2,r1,n1).
% 1.58/1.79 0 [] meet(c2,r1,n0).
% 1.58/1.79 0 [] meet(r2,a,d).
% 1.58/1.79 0 [] join(r1,e,a2).
% 1.58/1.79 0 [] join(r1,d,b2).
% 1.58/1.79 0 [] -meet(a2,b2,r1).
% 1.58/1.79 end_of_list.
% 1.58/1.79
% 1.58/1.79 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=5.
% 1.58/1.79
% 1.58/1.79 This is a Horn set with equality. The strategy will be
% 1.58/1.79 Knuth-Bendix and hyper_res, with positive clauses in
% 1.58/1.79 sos and nonpositive clauses in usable.
% 1.58/1.79
% 1.58/1.79 dependent: set(knuth_bendix).
% 1.58/1.79 dependent: set(anl_eq).
% 1.58/1.79 dependent: set(para_from).
% 1.58/1.79 dependent: set(para_into).
% 1.58/1.79 dependent: clear(para_from_right).
% 1.58/1.79 dependent: clear(para_into_right).
% 1.58/1.79 dependent: set(para_from_vars).
% 1.58/1.79 dependent: set(eq_units_both_ways).
% 1.58/1.79 dependent: set(dynamic_demod_all).
% 1.58/1.79 dependent: set(dynamic_demod).
% 1.58/1.79 dependent: set(order_eq).
% 1.58/1.79 dependent: set(back_demod).
% 1.58/1.79 dependent: set(lrpo).
% 1.58/1.79 dependent: set(hyper_res).
% 1.58/1.79 dependent: clear(order_hyper).
% 1.58/1.79
% 1.58/1.79 ------------> process usable:
% 1.58/1.79 ** KEPT (pick-wt=8): 1 [] -meet(A,B,C)|meet(B,A,C).
% 1.58/1.79 ** KEPT (pick-wt=8): 2 [] -join(A,B,C)|join(B,A,C).
% 1.58/1.79 ** KEPT (pick-wt=8): 3 [] -meet(A,B,C)|join(A,C,A).
% 1.58/1.79 ** KEPT (pick-wt=8): 4 [] -join(A,B,C)|meet(A,C,A).
% 1.58/1.79 ** KEPT (pick-wt=16): 5 [] -meet(A,B,C)| -meet(B,D,E)| -meet(A,E,F)|meet(C,D,F).
% 1.58/1.79 ** KEPT (pick-wt=16): 6 [] -meet(A,B,C)| -meet(B,D,E)| -meet(C,D,F)|meet(A,E,F).
% 1.58/1.79 ** KEPT (pick-wt=16): 7 [] -join(A,B,C)| -join(B,D,E)| -join(A,E,F)|join(C,D,F).
% 1.58/1.79 ** KEPT (pick-wt=16): 8 [] -join(A,B,C)| -join(B,D,E)| -join(C,D,F)|join(A,E,F).
% 1.58/1.79 ** 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.58/1.79 ** 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.58/1.79 ** KEPT (pick-wt=11): 11 [] -meet(A,B,C)| -meet(A,B,D)|C=D.
% 1.58/1.79 ** KEPT (pick-wt=11): 12 [] -join(A,B,C)| -join(A,B,D)|C=D.
% 1.58/1.79 ** KEPT (pick-wt=20): 13 [] -meet(A,B,B)| -join(C,B,D)| -meet(A,C,E)| -meet(A,D,F)|join(B,E,F).
% 1.58/1.79 ** KEPT (pick-wt=20): 14 [] -meet(A,B,B)| -join(C,B,D)| -meet(A,C,E)| -join(B,E,F)|meet(A,D,F).
% 1.58/1.79 ** KEPT (pick-wt=4): 15 [] -meet(a2,b2,r1).
% 1.58/1.79
% 1.58/1.79 ------------> process sos:
% 1.58/1.79 ** KEPT (pick-wt=3): 16 [] A=A.
% 1.58/1.79 ** KEPT (pick-wt=4): 17 [] join(n1,A,n1).
% 1.58/1.79 ** KEPT (pick-wt=4): 18 [] join(A,A,A).
% 1.58/1.79 ** KEPT (pick-wt=4): 19 [] join(n0,A,A).
% 1.58/1.79 ** KEPT (pick-wt=4): 20 [] meet(n0,A,n0).
% 1.58/1.79 ** KEPT (pick-wt=4): 21 [] meet(A,A,A).
% 1.58/1.79 ** KEPT (pick-wt=4): 22 [] meet(n1,A,A).
% 1.58/1.79 ** KEPT (pick-wt=6): 23 [] meet(A,B,meet_of(A,B)).
% 2.04/2.25 ** KEPT (pick-wt=6): 24 [] join(A,B,join_of(A,B)).
% 2.04/2.25 ** KEPT (pick-wt=4): 25 [] join(A,n1,n1).
% 2.04/2.25 ** KEPT (pick-wt=4): 26 [] join(A,n0,A).
% 2.04/2.25 ** KEPT (pick-wt=4): 27 [] meet(A,n0,n0).
% 2.04/2.25 ** KEPT (pick-wt=4): 28 [] meet(A,n1,A).
% 2.04/2.25 ** KEPT (pick-wt=4): 29 [] meet(a,b,c).
% 2.04/2.25 ** KEPT (pick-wt=4): 30 [] join(c,r2,n1).
% 2.04/2.25 ** KEPT (pick-wt=4): 31 [] meet(c,r2,n0).
% 2.04/2.25 ** KEPT (pick-wt=4): 32 [] meet(r2,b,e).
% 2.04/2.25 ** KEPT (pick-wt=4): 33 [] join(a,b,c2).
% 2.04/2.25 ** KEPT (pick-wt=4): 34 [] join(c2,r1,n1).
% 2.04/2.25 ** KEPT (pick-wt=4): 35 [] meet(c2,r1,n0).
% 2.04/2.25 ** KEPT (pick-wt=4): 36 [] meet(r2,a,d).
% 2.04/2.25 ** KEPT (pick-wt=4): 37 [] join(r1,e,a2).
% 2.04/2.25 ** KEPT (pick-wt=4): 38 [] join(r1,d,b2).
% 2.04/2.25 Following clause subsumed by 16 during input processing: 0 [copy,16,flip.1] A=A.
% 2.04/2.25
% 2.04/2.25 ======= end of input processing =======
% 2.04/2.25
% 2.04/2.25 =========== start of search ===========
% 2.04/2.25
% 2.04/2.25
% 2.04/2.25 Resetting weight limit to 6.
% 2.04/2.25
% 2.04/2.25
% 2.04/2.25 Resetting weight limit to 6.
% 2.04/2.25
% 2.04/2.25 sos_size=3495
% 2.04/2.25
% 2.04/2.25 -------- PROOF --------
% 2.04/2.25
% 2.04/2.25 ----> UNIT CONFLICT at 0.46 sec ----> 5553 [binary,5552.1,15.1] $F.
% 2.04/2.25
% 2.04/2.25 Length of proof is 19. Level of proof is 7.
% 2.04/2.25
% 2.04/2.25 ---------------- PROOF ----------------
% 2.04/2.25 % SZS status Unsatisfiable
% 2.04/2.25 % SZS output start Refutation
% See solution above
% 2.04/2.25 ------------ end of proof -------------
% 2.04/2.25
% 2.04/2.25
% 2.04/2.25 Search stopped by max_proofs option.
% 2.04/2.25
% 2.04/2.25
% 2.04/2.25 Search stopped by max_proofs option.
% 2.04/2.25
% 2.04/2.25 ============ end of search ============
% 2.04/2.25
% 2.04/2.25 -------------- statistics -------------
% 2.04/2.25 clauses given 175
% 2.04/2.25 clauses generated 42268
% 2.04/2.25 clauses kept 5400
% 2.04/2.25 clauses forward subsumed 37047
% 2.04/2.25 clauses back subsumed 131
% 2.04/2.25 Kbytes malloced 4882
% 2.04/2.25
% 2.04/2.25 ----------- times (seconds) -----------
% 2.04/2.25 user CPU time 0.46 (0 hr, 0 min, 0 sec)
% 2.04/2.25 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.04/2.25 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.04/2.25
% 2.04/2.25 That finishes the proof of the theorem.
% 2.04/2.25
% 2.04/2.25 Process 18916 finished Wed Jul 27 07:51:05 2022
% 2.04/2.25 Otter interrupted
% 2.04/2.25 PROOF FOUND
%------------------------------------------------------------------------------