TSTP Solution File: LAT005-5 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LAT005-5 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n023.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 2.35s 2.53s
% Output : Refutation 2.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 19
% Syntax : Number of clauses : 38 ( 32 unt; 0 nHn; 32 RR)
% Number of literals : 52 ( 2 equ; 15 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 : 12 ( 12 usr; 11 con; 0-2 aty)
% Number of variables : 35 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ join(A,B,C)
| join(B,A,C) ),
file('LAT005-5.p',unknown),
[] ).
cnf(4,axiom,
( ~ join(A,B,C)
| meet(A,C,A) ),
file('LAT005-5.p',unknown),
[] ).
cnf(5,axiom,
( ~ meet(A,B,C)
| ~ meet(B,D,E)
| ~ meet(A,E,F)
| meet(C,D,F) ),
file('LAT005-5.p',unknown),
[] ).
cnf(6,axiom,
( ~ meet(A,B,C)
| ~ meet(B,D,E)
| ~ meet(C,D,F)
| meet(A,E,F) ),
file('LAT005-5.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-5.p',unknown),
[] ).
cnf(11,axiom,
( ~ meet(A,B,C)
| ~ meet(A,B,D)
| C = D ),
file('LAT005-5.p',unknown),
[] ).
cnf(13,axiom,
~ meet(a2,b2,r1),
file('LAT005-5.p',unknown),
[] ).
cnf(17,axiom,
join(n0,A,A),
file('LAT005-5.p',unknown),
[] ).
cnf(18,axiom,
meet(n0,A,n0),
file('LAT005-5.p',unknown),
[] ).
cnf(19,axiom,
meet(A,A,A),
file('LAT005-5.p',unknown),
[] ).
cnf(21,axiom,
meet(A,B,meet_of(A,B)),
file('LAT005-5.p',unknown),
[] ).
cnf(23,axiom,
meet(a,b,c),
file('LAT005-5.p',unknown),
[] ).
cnf(25,axiom,
meet(c,r2,n0),
file('LAT005-5.p',unknown),
[] ).
cnf(26,axiom,
meet(r2,b,e),
file('LAT005-5.p',unknown),
[] ).
cnf(27,axiom,
join(a,b,c2),
file('LAT005-5.p',unknown),
[] ).
cnf(29,axiom,
meet(c2,r1,n0),
file('LAT005-5.p',unknown),
[] ).
cnf(30,axiom,
meet(r2,a,d),
file('LAT005-5.p',unknown),
[] ).
cnf(31,axiom,
join(r1,e,a2),
file('LAT005-5.p',unknown),
[] ).
cnf(32,axiom,
join(r1,d,b2),
file('LAT005-5.p',unknown),
[] ).
cnf(38,plain,
join(A,n0,A),
inference(hyper,[status(thm)],[17,2]),
[iquote('hyper,17,2')] ).
cnf(66,plain,
meet(r2,c,n0),
inference(hyper,[status(thm)],[25,10,18,17,17]),
[iquote('hyper,25,10,18,17,17')] ).
cnf(82,plain,
meet_of(n0,A) = n0,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[21,11,18])]),
[iquote('hyper,21,11,18,flip.1')] ).
cnf(129,plain,
meet(b,r2,e),
inference(hyper,[status(thm)],[26,10,18,17,17]),
[iquote('hyper,26,10,18,17,17')] ).
cnf(138,plain,
meet(e,b,e),
inference(hyper,[status(thm)],[26,5,26,19]),
[iquote('hyper,26,5,26,19')] ).
cnf(155,plain,
meet(a,c2,a),
inference(hyper,[status(thm)],[27,4]),
[iquote('hyper,27,4')] ).
cnf(156,plain,
join(b,a,c2),
inference(hyper,[status(thm)],[27,2]),
[iquote('hyper,27,2')] ).
cnf(173,plain,
meet(r1,c2,n0),
inference(hyper,[status(thm)],[29,10,18,17,17]),
[iquote('hyper,29,10,18,17,17')] ).
cnf(302,plain,
meet(r1,a2,r1),
inference(hyper,[status(thm)],[31,4]),
[iquote('hyper,31,4')] ).
cnf(303,plain,
join(e,r1,a2),
inference(hyper,[status(thm)],[31,2]),
[iquote('hyper,31,2')] ).
cnf(482,plain,
meet(d,b,n0),
inference(hyper,[status(thm)],[66,5,30,23]),
[iquote('hyper,66,5,30,23')] ).
cnf(674,plain,
meet(d,c2,d),
inference(hyper,[status(thm)],[155,5,30,30]),
[iquote('hyper,155,5,30,30')] ).
cnf(699,plain,
meet(b,c2,b),
inference(hyper,[status(thm)],[156,4]),
[iquote('hyper,156,4')] ).
cnf(1270,plain,
meet(d,e,n0),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[482,6,129,21]),82]),
[iquote('hyper,482,6,129,21,demod,82')] ).
cnf(1651,plain,
meet(e,c2,e),
inference(hyper,[status(thm)],[699,5,138,138]),
[iquote('hyper,699,5,138,138')] ).
cnf(2451,plain,
meet(c2,a2,e),
inference(hyper,[status(thm)],[1651,10,303,173,38]),
[iquote('hyper,1651,10,303,173,38')] ).
cnf(2885,plain,
meet(d,a2,n0),
inference(hyper,[status(thm)],[2451,5,674,1270]),
[iquote('hyper,2451,5,674,1270')] ).
cnf(4131,plain,
meet(a2,b2,r1),
inference(hyper,[status(thm)],[2885,10,302,32,38]),
[iquote('hyper,2885,10,302,32,38')] ).
cnf(4132,plain,
$false,
inference(binary,[status(thm)],[4131,13]),
[iquote('binary,4131.1,13.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LAT005-5 : TPTP v8.1.0. Released v1.1.0.
% 0.00/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n023.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:40:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.94/2.13 ----- Otter 3.3f, August 2004 -----
% 1.94/2.13 The process was started by sandbox2 on n023.cluster.edu,
% 1.94/2.13 Wed Jul 27 08:40:18 2022
% 1.94/2.13 The command was "./otter". The process ID is 14745.
% 1.94/2.13
% 1.94/2.13 set(prolog_style_variables).
% 1.94/2.13 set(auto).
% 1.94/2.13 dependent: set(auto1).
% 1.94/2.13 dependent: set(process_input).
% 1.94/2.13 dependent: clear(print_kept).
% 1.94/2.13 dependent: clear(print_new_demod).
% 1.94/2.13 dependent: clear(print_back_demod).
% 1.94/2.13 dependent: clear(print_back_sub).
% 1.94/2.13 dependent: set(control_memory).
% 1.94/2.13 dependent: assign(max_mem, 12000).
% 1.94/2.13 dependent: assign(pick_given_ratio, 4).
% 1.94/2.13 dependent: assign(stats_level, 1).
% 1.94/2.13 dependent: assign(max_seconds, 10800).
% 1.94/2.13 clear(print_given).
% 1.94/2.13
% 1.94/2.13 list(usable).
% 1.94/2.13 0 [] A=A.
% 1.94/2.13 0 [] join(n1,X,n1).
% 1.94/2.13 0 [] join(X,X,X).
% 1.94/2.13 0 [] join(n0,X,X).
% 1.94/2.13 0 [] meet(n0,X,n0).
% 1.94/2.13 0 [] meet(X,X,X).
% 1.94/2.13 0 [] meet(n1,X,X).
% 1.94/2.13 0 [] -meet(X,Y,Z)|meet(Y,X,Z).
% 1.94/2.13 0 [] -join(X,Y,Z)|join(Y,X,Z).
% 1.94/2.13 0 [] -meet(X,Y,Z)|join(X,Z,X).
% 1.94/2.13 0 [] -join(X,Y,Z)|meet(X,Z,X).
% 1.94/2.13 0 [] -meet(X,Y,Xy)| -meet(Y,Z,Yz)| -meet(X,Yz,Xyz)|meet(Xy,Z,Xyz).
% 1.94/2.13 0 [] -meet(X,Y,Xy)| -meet(Y,Z,Yz)| -meet(Xy,Z,Xyz)|meet(X,Yz,Xyz).
% 1.94/2.13 0 [] -join(X,Y,Xy)| -join(Y,Z,Yz)| -join(X,Yz,Xyz)|join(Xy,Z,Xyz).
% 1.94/2.13 0 [] -join(X,Y,Xy)| -join(Y,Z,Yz)| -join(Xy,Z,Xyz)|join(X,Yz,Xyz).
% 1.94/2.13 0 [] -meet(X,Z,X)| -join(X,Y,X1)| -meet(Y,Z,Y1)| -meet(Z,X1,Z1)|join(X,Y1,Z1).
% 1.94/2.13 0 [] -meet(X,Z,X)| -join(X,Y,X1)| -meet(Y,Z,Y1)| -join(X,Y1,Z1)|meet(Z,X1,Z1).
% 1.94/2.13 0 [] meet(X,Y,meet_of(X,Y)).
% 1.94/2.13 0 [] -meet(X,Y,Z1)| -meet(X,Y,Z2)|Z1=Z2.
% 1.94/2.13 0 [] join(X,Y,join_of(X,Y)).
% 1.94/2.13 0 [] -join(X,Y,Z1)| -join(X,Y,Z2)|Z1=Z2.
% 1.94/2.13 0 [] meet(a,b,c).
% 1.94/2.13 0 [] join(c,r2,n1).
% 1.94/2.13 0 [] meet(c,r2,n0).
% 1.94/2.13 0 [] meet(r2,b,e).
% 1.94/2.13 0 [] join(a,b,c2).
% 1.94/2.13 0 [] join(c2,r1,n1).
% 1.94/2.13 0 [] meet(c2,r1,n0).
% 1.94/2.13 0 [] meet(r2,a,d).
% 1.94/2.13 0 [] join(r1,e,a2).
% 1.94/2.13 0 [] join(r1,d,b2).
% 1.94/2.13 0 [] -meet(a2,b2,r1).
% 1.94/2.13 end_of_list.
% 1.94/2.13
% 1.94/2.13 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=5.
% 1.94/2.13
% 1.94/2.13 This is a Horn set with equality. The strategy will be
% 1.94/2.13 Knuth-Bendix and hyper_res, with positive clauses in
% 1.94/2.13 sos and nonpositive clauses in usable.
% 1.94/2.13
% 1.94/2.13 dependent: set(knuth_bendix).
% 1.94/2.13 dependent: set(anl_eq).
% 1.94/2.13 dependent: set(para_from).
% 1.94/2.13 dependent: set(para_into).
% 1.94/2.13 dependent: clear(para_from_right).
% 1.94/2.13 dependent: clear(para_into_right).
% 1.94/2.13 dependent: set(para_from_vars).
% 1.94/2.13 dependent: set(eq_units_both_ways).
% 1.94/2.13 dependent: set(dynamic_demod_all).
% 1.94/2.13 dependent: set(dynamic_demod).
% 1.94/2.13 dependent: set(order_eq).
% 1.94/2.13 dependent: set(back_demod).
% 1.94/2.13 dependent: set(lrpo).
% 1.94/2.13 dependent: set(hyper_res).
% 1.94/2.13 dependent: clear(order_hyper).
% 1.94/2.13
% 1.94/2.13 ------------> process usable:
% 1.94/2.13 ** KEPT (pick-wt=8): 1 [] -meet(A,B,C)|meet(B,A,C).
% 1.94/2.13 ** KEPT (pick-wt=8): 2 [] -join(A,B,C)|join(B,A,C).
% 1.94/2.13 ** KEPT (pick-wt=8): 3 [] -meet(A,B,C)|join(A,C,A).
% 1.94/2.13 ** KEPT (pick-wt=8): 4 [] -join(A,B,C)|meet(A,C,A).
% 1.94/2.13 ** KEPT (pick-wt=16): 5 [] -meet(A,B,C)| -meet(B,D,E)| -meet(A,E,F)|meet(C,D,F).
% 1.94/2.13 ** KEPT (pick-wt=16): 6 [] -meet(A,B,C)| -meet(B,D,E)| -meet(C,D,F)|meet(A,E,F).
% 1.94/2.13 ** KEPT (pick-wt=16): 7 [] -join(A,B,C)| -join(B,D,E)| -join(A,E,F)|join(C,D,F).
% 1.94/2.13 ** KEPT (pick-wt=16): 8 [] -join(A,B,C)| -join(B,D,E)| -join(C,D,F)|join(A,E,F).
% 1.94/2.13 ** 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.94/2.13 ** 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.94/2.13 ** KEPT (pick-wt=11): 11 [] -meet(A,B,C)| -meet(A,B,D)|C=D.
% 1.94/2.13 ** KEPT (pick-wt=11): 12 [] -join(A,B,C)| -join(A,B,D)|C=D.
% 1.94/2.13 ** KEPT (pick-wt=4): 13 [] -meet(a2,b2,r1).
% 1.94/2.13
% 1.94/2.13 ------------> process sos:
% 1.94/2.13 ** KEPT (pick-wt=3): 14 [] A=A.
% 1.94/2.13 ** KEPT (pick-wt=4): 15 [] join(n1,A,n1).
% 1.94/2.13 ** KEPT (pick-wt=4): 16 [] join(A,A,A).
% 1.94/2.13 ** KEPT (pick-wt=4): 17 [] join(n0,A,A).
% 1.94/2.13 ** KEPT (pick-wt=4): 18 [] meet(n0,A,n0).
% 1.94/2.13 ** KEPT (pick-wt=4): 19 [] meet(A,A,A).
% 1.94/2.13 ** KEPT (pick-wt=4): 20 [] meet(n1,A,A).
% 1.94/2.13 ** KEPT (pick-wt=6): 21 [] meet(A,B,meet_of(A,B)).
% 1.94/2.13 ** KEPT (pick-wt=6): 22 [] join(A,B,join_of(A,B)).
% 1.94/2.13 ** KEPT (pick-wt=4): 23 [] meet(a,b,c).
% 1.94/2.13 ** KEPT (pick-wt=4): 24 [] join(c,r2,n1).
% 1.94/2.13 ** KEPT (pick-wt=4): 25 [] meet(c,r2,n0).
% 1.94/2.13 ** KEPT (pick-wt=4): 26 [] meet(r2,b,e).
% 1.94/2.13 ** KEPT (pick-wt=4): 27 [] join(a,b,c2).
% 1.94/2.13 ** KEPT (pick-wt=4): 28 [] join(c2,r1,n1).
% 1.94/2.13 ** KEPT (pick-wt=4): 29 [] meet(c2,r1,n0).
% 1.94/2.13 ** KEPT (pick-wt=4): 30 [] meet(r2,a,d).
% 1.94/2.13 ** KEPT (pick-wt=4): 31 [] join(r1,e,a2).
% 2.35/2.53 ** KEPT (pick-wt=4): 32 [] join(r1,d,b2).
% 2.35/2.53 Following clause subsumed by 14 during input processing: 0 [copy,14,flip.1] A=A.
% 2.35/2.53
% 2.35/2.53 ======= end of input processing =======
% 2.35/2.53
% 2.35/2.53 =========== start of search ===========
% 2.35/2.53
% 2.35/2.53 -------- PROOF --------
% 2.35/2.53
% 2.35/2.53 ----> UNIT CONFLICT at 0.40 sec ----> 4132 [binary,4131.1,13.1] $F.
% 2.35/2.53
% 2.35/2.53 Length of proof is 18. Level of proof is 6.
% 2.35/2.53
% 2.35/2.53 ---------------- PROOF ----------------
% 2.35/2.53 % SZS status Unsatisfiable
% 2.35/2.53 % SZS output start Refutation
% See solution above
% 2.35/2.53 ------------ end of proof -------------
% 2.35/2.53
% 2.35/2.53
% 2.35/2.53 Search stopped by max_proofs option.
% 2.35/2.53
% 2.35/2.53
% 2.35/2.53 Search stopped by max_proofs option.
% 2.35/2.53
% 2.35/2.53 ============ end of search ============
% 2.35/2.53
% 2.35/2.53 -------------- statistics -------------
% 2.35/2.53 clauses given 180
% 2.35/2.53 clauses generated 27765
% 2.35/2.53 clauses kept 3984
% 2.35/2.53 clauses forward subsumed 24641
% 2.35/2.53 clauses back subsumed 67
% 2.35/2.53 Kbytes malloced 2929
% 2.35/2.53
% 2.35/2.53 ----------- times (seconds) -----------
% 2.35/2.53 user CPU time 0.40 (0 hr, 0 min, 0 sec)
% 2.35/2.53 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.35/2.53 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.35/2.53
% 2.35/2.53 That finishes the proof of the theorem.
% 2.35/2.53
% 2.35/2.53 Process 14745 finished Wed Jul 27 08:40:20 2022
% 2.35/2.53 Otter interrupted
% 2.35/2.53 PROOF FOUND
%------------------------------------------------------------------------------