TSTP Solution File: LCL093-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL093-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n021.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:03:31 EDT 2022
% Result : Unsatisfiable 2.34s 2.55s
% Output : Refutation 2.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 3
% Syntax : Number of clauses : 52 ( 51 unt; 0 nHn; 3 RR)
% Number of literals : 54 ( 0 equ; 3 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 181 ( 88 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(implies(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL093-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))),
file('LCL093-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(implies(implies(implies(A,B),implies(C,D)),implies(implies(D,A),implies(E,implies(C,A))))),
file('LCL093-1.p',unknown),
[] ).
cnf(4,plain,
is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(C,D)),implies(E,implies(implies(F,C),implies(C,D))))),
inference(hyper,[status(thm)],[3,1,3]),
[iquote('hyper,3,1,3')] ).
cnf(5,plain,
is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(implies(D,E),implies(E,C)))))),
inference(hyper,[status(thm)],[4,1,4]),
[iquote('hyper,4,1,4')] ).
cnf(7,plain,
is_a_theorem(implies(implies(A,B),implies(B,implies(implies(C,D),implies(D,B))))),
inference(hyper,[status(thm)],[5,1,5]),
[iquote('hyper,5,1,5')] ).
cnf(11,plain,
is_a_theorem(implies(implies(implies(implies(A,B),implies(B,C)),D),implies(E,implies(C,D)))),
inference(hyper,[status(thm)],[7,1,3]),
[iquote('hyper,7,1,3')] ).
cnf(18,plain,
is_a_theorem(implies(implies(implies(A,B),implies(implies(C,D),implies(D,A))),implies(E,implies(F,implies(implies(C,D),implies(D,A)))))),
inference(hyper,[status(thm)],[11,1,3]),
[iquote('hyper,11,1,3')] ).
cnf(21,plain,
is_a_theorem(implies(A,implies(B,implies(implies(B,C),implies(D,implies(E,C)))))),
inference(hyper,[status(thm)],[11,1,3]),
[iquote('hyper,11,1,3')] ).
cnf(54,plain,
is_a_theorem(implies(A,implies(B,implies(implies(C,D),implies(D,implies(D,D)))))),
inference(hyper,[status(thm)],[18,1,3]),
[iquote('hyper,18,1,3')] ).
cnf(56,plain,
is_a_theorem(implies(A,implies(implies(A,B),implies(C,implies(D,B))))),
inference(hyper,[status(thm)],[21,1,21]),
[iquote('hyper,21,1,21')] ).
cnf(58,plain,
is_a_theorem(implies(implies(implies(implies(A,B),implies(C,implies(D,B))),E),implies(F,implies(A,E)))),
inference(hyper,[status(thm)],[21,1,3]),
[iquote('hyper,21,1,3')] ).
cnf(63,plain,
is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(E,implies(implies(implies(D,F),C),D)))),
inference(hyper,[status(thm)],[56,1,3]),
[iquote('hyper,56,1,3')] ).
cnf(106,plain,
is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(C,C))))),
inference(hyper,[status(thm)],[54,1,54]),
[iquote('hyper,54,1,54')] ).
cnf(109,plain,
is_a_theorem(implies(implies(A,B),implies(B,implies(B,B)))),
inference(hyper,[status(thm)],[106,1,106]),
[iquote('hyper,106,1,106')] ).
cnf(114,plain,
is_a_theorem(implies(implies(implies(A,A),B),implies(C,implies(A,B)))),
inference(hyper,[status(thm)],[109,1,3]),
[iquote('hyper,109,1,3')] ).
cnf(122,plain,
is_a_theorem(implies(implies(implies(A,B),implies(A,A)),implies(C,implies(D,implies(A,A))))),
inference(hyper,[status(thm)],[114,1,3]),
[iquote('hyper,114,1,3')] ).
cnf(373,plain,
is_a_theorem(implies(A,implies(B,implies(implies(C,C),implies(C,C))))),
inference(hyper,[status(thm)],[122,1,114]),
[iquote('hyper,122,1,114')] ).
cnf(380,plain,
is_a_theorem(implies(A,implies(implies(B,B),implies(B,B)))),
inference(hyper,[status(thm)],[373,1,373]),
[iquote('hyper,373,1,373')] ).
cnf(389,plain,
is_a_theorem(implies(implies(A,A),implies(A,A))),
inference(hyper,[status(thm)],[380,1,380]),
[iquote('hyper,380,1,380')] ).
cnf(402,plain,
is_a_theorem(implies(A,implies(B,implies(C,C)))),
inference(hyper,[status(thm)],[389,1,122]),
[iquote('hyper,389,1,122')] ).
cnf(404,plain,
is_a_theorem(implies(A,implies(B,B))),
inference(hyper,[status(thm)],[402,1,402]),
[iquote('hyper,402,1,402')] ).
cnf(413,plain,
is_a_theorem(implies(A,A)),
inference(hyper,[status(thm)],[404,1,404]),
[iquote('hyper,404,1,404')] ).
cnf(415,plain,
is_a_theorem(implies(implies(A,B),implies(C,implies(A,B)))),
inference(hyper,[status(thm)],[404,1,3]),
[iquote('hyper,404,1,3')] ).
cnf(420,plain,
is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(D,C))))),
inference(hyper,[status(thm)],[413,1,4]),
[iquote('hyper,413,1,4')] ).
cnf(442,plain,
is_a_theorem(implies(implies(implies(A,B),A),implies(C,implies(D,A)))),
inference(hyper,[status(thm)],[415,1,3]),
[iquote('hyper,415,1,3')] ).
cnf(477,plain,
is_a_theorem(implies(implies(A,B),implies(B,implies(C,B)))),
inference(hyper,[status(thm)],[420,1,420]),
[iquote('hyper,420,1,420')] ).
cnf(484,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(D,implies(B,C)))),
inference(hyper,[status(thm)],[477,1,3]),
[iquote('hyper,477,1,3')] ).
cnf(522,plain,
is_a_theorem(implies(A,implies(B,implies(implies(C,D),implies(C,implies(E,D)))))),
inference(hyper,[status(thm)],[442,1,58]),
[iquote('hyper,442,1,58')] ).
cnf(537,plain,
is_a_theorem(implies(A,implies(B,implies(C,implies(implies(implies(D,E),D),D))))),
inference(hyper,[status(thm)],[63,1,442]),
[iquote('hyper,63,1,442')] ).
cnf(592,plain,
is_a_theorem(implies(A,implies(implies(B,C),implies(B,implies(D,C))))),
inference(hyper,[status(thm)],[522,1,522]),
[iquote('hyper,522,1,522')] ).
cnf(614,plain,
is_a_theorem(implies(implies(A,B),implies(A,implies(C,B)))),
inference(hyper,[status(thm)],[592,1,592]),
[iquote('hyper,592,1,592')] ).
cnf(616,plain,
is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(E,implies(implies(A,C),D)))),
inference(hyper,[status(thm)],[592,1,3]),
[iquote('hyper,592,1,3')] ).
cnf(689,plain,
is_a_theorem(implies(A,implies(B,implies(implies(implies(C,D),C),C)))),
inference(hyper,[status(thm)],[537,1,537]),
[iquote('hyper,537,1,537')] ).
cnf(695,plain,
is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))),
inference(hyper,[status(thm)],[689,1,689]),
[iquote('hyper,689,1,689')] ).
cnf(698,plain,
is_a_theorem(implies(implies(implies(A,B),A),A)),
inference(hyper,[status(thm)],[695,1,695]),
[iquote('hyper,695,1,695')] ).
cnf(701,plain,
is_a_theorem(implies(implies(implies(A,B),A),implies(C,A))),
inference(hyper,[status(thm)],[698,1,614]),
[iquote('hyper,698,1,614')] ).
cnf(702,plain,
is_a_theorem(implies(A,implies(implies(implies(implies(B,C),D),C),implies(B,C)))),
inference(hyper,[status(thm)],[698,1,63]),
[iquote('hyper,698,1,63')] ).
cnf(722,plain,
is_a_theorem(implies(implies(A,implies(A,B)),implies(C,implies(D,implies(A,B))))),
inference(hyper,[status(thm)],[701,1,3]),
[iquote('hyper,701,1,3')] ).
cnf(949,plain,
is_a_theorem(implies(implies(implies(implies(A,B),C),B),implies(A,B))),
inference(hyper,[status(thm)],[702,1,702]),
[iquote('hyper,702,1,702')] ).
cnf(997,plain,
is_a_theorem(implies(A,implies(B,implies(implies(implies(C,D),E),implies(D,E))))),
inference(hyper,[status(thm)],[722,1,484]),
[iquote('hyper,722,1,484')] ).
cnf(1023,plain,
is_a_theorem(implies(A,implies(implies(implies(B,C),D),implies(C,D)))),
inference(hyper,[status(thm)],[997,1,997]),
[iquote('hyper,997,1,997')] ).
cnf(1032,plain,
is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))),
inference(hyper,[status(thm)],[1023,1,1023]),
[iquote('hyper,1023,1,1023')] ).
cnf(1047,plain,
is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(D,implies(A,C))))),
inference(hyper,[status(thm)],[1032,1,3]),
[iquote('hyper,1032,1,3')] ).
cnf(1528,plain,
is_a_theorem(implies(A,implies(implies(A,B),B))),
inference(hyper,[status(thm)],[616,1,698]),
[iquote('hyper,616,1,698')] ).
cnf(1577,plain,
is_a_theorem(implies(implies(implies(implies(A,B),B),C),implies(D,implies(A,C)))),
inference(hyper,[status(thm)],[1528,1,1047]),
[iquote('hyper,1528,1,1047')] ).
cnf(2766,plain,
is_a_theorem(implies(implies(A,implies(B,implies(A,C))),implies(B,implies(A,C)))),
inference(hyper,[status(thm)],[1577,1,949]),
[iquote('hyper,1577,1,949')] ).
cnf(2770,plain,
is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))),
inference(hyper,[status(thm)],[1577,1,698]),
[iquote('hyper,1577,1,698')] ).
cnf(6095,plain,
is_a_theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B)))),
inference(hyper,[status(thm)],[2766,1,1047]),
[iquote('hyper,2766,1,1047')] ).
cnf(6149,plain,
is_a_theorem(implies(implies(A,implies(B,implies(B,C))),implies(A,implies(B,C)))),
inference(hyper,[status(thm)],[6095,1,2770]),
[iquote('hyper,6095,1,2770')] ).
cnf(6790,plain,
is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))),
inference(hyper,[status(thm)],[6149,1,1047]),
[iquote('hyper,6149,1,1047')] ).
cnf(6791,plain,
$false,
inference(binary,[status(thm)],[6790,2]),
[iquote('binary,6790.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : LCL093-1 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 09:17:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.34/2.55 ----- Otter 3.3f, August 2004 -----
% 2.34/2.55 The process was started by sandbox on n021.cluster.edu,
% 2.34/2.55 Wed Jul 27 09:17:53 2022
% 2.34/2.55 The command was "./otter". The process ID is 28609.
% 2.34/2.55
% 2.34/2.55 set(prolog_style_variables).
% 2.34/2.55 set(auto).
% 2.34/2.55 dependent: set(auto1).
% 2.34/2.55 dependent: set(process_input).
% 2.34/2.55 dependent: clear(print_kept).
% 2.34/2.55 dependent: clear(print_new_demod).
% 2.34/2.55 dependent: clear(print_back_demod).
% 2.34/2.55 dependent: clear(print_back_sub).
% 2.34/2.55 dependent: set(control_memory).
% 2.34/2.55 dependent: assign(max_mem, 12000).
% 2.34/2.55 dependent: assign(pick_given_ratio, 4).
% 2.34/2.55 dependent: assign(stats_level, 1).
% 2.34/2.55 dependent: assign(max_seconds, 10800).
% 2.34/2.55 clear(print_given).
% 2.34/2.55
% 2.34/2.55 list(usable).
% 2.34/2.55 0 [] -is_a_theorem(implies(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 2.34/2.55 0 [] is_a_theorem(implies(implies(implies(P,Q),implies(R,S)),implies(implies(S,P),implies(T,implies(R,P))))).
% 2.34/2.55 0 [] -is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))).
% 2.34/2.55 end_of_list.
% 2.34/2.55
% 2.34/2.55 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 2.34/2.55
% 2.34/2.55 This is a Horn set without equality. The strategy will
% 2.34/2.55 be hyperresolution, with satellites in sos and nuclei
% 2.34/2.55 in usable.
% 2.34/2.55
% 2.34/2.55 dependent: set(hyper_res).
% 2.34/2.55 dependent: clear(order_hyper).
% 2.34/2.55
% 2.34/2.55 ------------> process usable:
% 2.34/2.55 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 2.34/2.55 ** KEPT (pick-wt=12): 2 [] -is_a_theorem(implies(implies(a,b),implies(implies(b,c),implies(a,c)))).
% 2.34/2.55
% 2.34/2.55 ------------> process sos:
% 2.34/2.55 ** KEPT (pick-wt=18): 3 [] is_a_theorem(implies(implies(implies(A,B),implies(C,D)),implies(implies(D,A),implies(E,implies(C,A))))).
% 2.34/2.55
% 2.34/2.55 ======= end of input processing =======
% 2.34/2.55
% 2.34/2.55 =========== start of search ===========
% 2.34/2.55
% 2.34/2.55
% 2.34/2.55 Resetting weight limit to 16.
% 2.34/2.55
% 2.34/2.55
% 2.34/2.55 Resetting weight limit to 16.
% 2.34/2.55
% 2.34/2.55 sos_size=5509
% 2.34/2.55
% 2.34/2.55 -------- PROOF --------
% 2.34/2.55
% 2.34/2.55 ----> UNIT CONFLICT at 0.66 sec ----> 6791 [binary,6790.1,2.1] $F.
% 2.34/2.55
% 2.34/2.55 Length of proof is 48. Level of proof is 32.
% 2.34/2.55
% 2.34/2.55 ---------------- PROOF ----------------
% 2.34/2.55 % SZS status Unsatisfiable
% 2.34/2.55 % SZS output start Refutation
% See solution above
% 2.34/2.55 ------------ end of proof -------------
% 2.34/2.55
% 2.34/2.55
% 2.34/2.55 Search stopped by max_proofs option.
% 2.34/2.55
% 2.34/2.55
% 2.34/2.55 Search stopped by max_proofs option.
% 2.34/2.55
% 2.34/2.55 ============ end of search ============
% 2.34/2.55
% 2.34/2.55 -------------- statistics -------------
% 2.34/2.55 clauses given 420
% 2.34/2.55 clauses generated 133910
% 2.34/2.55 clauses kept 6790
% 2.34/2.55 clauses forward subsumed 90300
% 2.34/2.55 clauses back subsumed 343
% 2.34/2.55 Kbytes malloced 4882
% 2.34/2.55
% 2.34/2.55 ----------- times (seconds) -----------
% 2.34/2.55 user CPU time 0.66 (0 hr, 0 min, 0 sec)
% 2.34/2.55 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.34/2.55 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.34/2.55
% 2.34/2.55 That finishes the proof of the theorem.
% 2.34/2.55
% 2.34/2.55 Process 28609 finished Wed Jul 27 09:17:55 2022
% 2.34/2.55 Otter interrupted
% 2.34/2.55 PROOF FOUND
%------------------------------------------------------------------------------