TSTP Solution File: LCL024-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL024-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n026.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:20 EDT 2022
% Result : Unsatisfiable 4.90s 5.09s
% Output : Refutation 4.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 3
% Syntax : Number of clauses : 34 ( 33 unt; 0 nHn; 3 RR)
% Number of literals : 36 ( 0 equ; 3 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 9 ( 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 : 107 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(e_quivalent(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL024-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(e_quivalent(e_quivalent(e_quivalent(a,e_quivalent(b,c)),c),e_quivalent(b,a))),
file('LCL024-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,e_quivalent(C,A)),e_quivalent(C,B)))),
file('LCL024-1.p',unknown),
[] ).
cnf(4,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,e_quivalent(C,e_quivalent(e_quivalent(D,e_quivalent(E,C)),e_quivalent(E,D))))),e_quivalent(B,A))),
inference(hyper,[status(thm)],[3,1,3]),
[iquote('hyper,3,1,3')] ).
cnf(7,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(B,A)),e_quivalent(C,D)),D)),
inference(hyper,[status(thm)],[4,1,3]),
[iquote('hyper,4,1,3')] ).
cnf(8,plain,
is_a_theorem(e_quivalent(A,A)),
inference(hyper,[status(thm)],[7,1,7]),
[iquote('hyper,7,1,7')] ).
cnf(9,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(B,e_quivalent(C,D)),e_quivalent(C,B)),e_quivalent(D,e_quivalent(A,e_quivalent(E,e_quivalent(e_quivalent(F,e_quivalent(G,E)),e_quivalent(G,F)))))))),
inference(hyper,[status(thm)],[7,1,4]),
[iquote('hyper,7,1,4')] ).
cnf(13,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,e_quivalent(C,C))),e_quivalent(B,A))),
inference(hyper,[status(thm)],[8,1,3]),
[iquote('hyper,8,1,3')] ).
cnf(17,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,e_quivalent(e_quivalent(C,e_quivalent(D,e_quivalent(E,E))),e_quivalent(D,C)))),e_quivalent(B,A))),
inference(hyper,[status(thm)],[13,1,3]),
[iquote('hyper,13,1,3')] ).
cnf(21,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(A,B)),B)),
inference(hyper,[status(thm)],[13,1,3]),
[iquote('hyper,13,1,3')] ).
cnf(42,plain,
is_a_theorem(e_quivalent(A,e_quivalent(B,e_quivalent(B,e_quivalent(A,e_quivalent(C,C)))))),
inference(hyper,[status(thm)],[21,1,13]),
[iquote('hyper,21,1,13')] ).
cnf(45,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,e_quivalent(e_quivalent(C,e_quivalent(C,D)),D))),e_quivalent(B,A))),
inference(hyper,[status(thm)],[21,1,3]),
[iquote('hyper,21,1,3')] ).
cnf(101,plain,
is_a_theorem(e_quivalent(A,e_quivalent(B,e_quivalent(B,A)))),
inference(hyper,[status(thm)],[42,1,4]),
[iquote('hyper,42,1,4')] ).
cnf(126,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(B,A)),e_quivalent(e_quivalent(e_quivalent(D,e_quivalent(E,F)),e_quivalent(E,D)),e_quivalent(F,C)))),
inference(hyper,[status(thm)],[9,1,4]),
[iquote('hyper,9,1,4')] ).
cnf(159,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,e_quivalent(C,e_quivalent(D,e_quivalent(D,C))))),e_quivalent(B,A))),
inference(hyper,[status(thm)],[101,1,3]),
[iquote('hyper,101,1,3')] ).
cnf(722,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(B,e_quivalent(A,e_quivalent(C,C))),D)),D)),
inference(hyper,[status(thm)],[17,1,3]),
[iquote('hyper,17,1,3')] ).
cnf(796,plain,
is_a_theorem(e_quivalent(A,e_quivalent(B,e_quivalent(B,e_quivalent(A,e_quivalent(e_quivalent(C,e_quivalent(C,D)),D)))))),
inference(hyper,[status(thm)],[45,1,21]),
[iquote('hyper,45,1,21')] ).
cnf(2126,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(A,B)),e_quivalent(B,C)),C)),
inference(hyper,[status(thm)],[159,1,3]),
[iquote('hyper,159,1,3')] ).
cnf(7296,plain,
is_a_theorem(e_quivalent(A,e_quivalent(B,e_quivalent(e_quivalent(C,e_quivalent(C,B)),A)))),
inference(hyper,[status(thm)],[796,1,4]),
[iquote('hyper,796,1,4')] ).
cnf(7306,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(A,B)),e_quivalent(C,e_quivalent(C,B)))),
inference(hyper,[status(thm)],[7296,1,2126]),
[iquote('hyper,7296,1,2126')] ).
cnf(7379,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(A,e_quivalent(C,C))),B)),
inference(hyper,[status(thm)],[7306,1,722]),
[iquote('hyper,7306,1,722')] ).
cnf(7390,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,e_quivalent(C,C))),e_quivalent(D,e_quivalent(D,e_quivalent(B,A))))),
inference(hyper,[status(thm)],[7306,1,17]),
[iquote('hyper,7306,1,17')] ).
cnf(9239,plain,
is_a_theorem(e_quivalent(A,e_quivalent(B,e_quivalent(A,B)))),
inference(hyper,[status(thm)],[126,1,7379]),
[iquote('hyper,126,1,7379')] ).
cnf(9358,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,e_quivalent(C,e_quivalent(D,e_quivalent(C,D))))),e_quivalent(B,A))),
inference(hyper,[status(thm)],[9239,1,3]),
[iquote('hyper,9239,1,3')] ).
cnf(10339,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(e_quivalent(C,e_quivalent(B,A)),e_quivalent(D,D))))),
inference(hyper,[status(thm)],[7390,1,4]),
[iquote('hyper,7390,1,4')] ).
cnf(11665,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,A)),B)),
inference(hyper,[status(thm)],[9358,1,9239]),
[iquote('hyper,9358,1,9239')] ).
cnf(11685,plain,
is_a_theorem(e_quivalent(A,e_quivalent(B,e_quivalent(B,e_quivalent(C,e_quivalent(A,C)))))),
inference(hyper,[status(thm)],[9358,1,7306]),
[iquote('hyper,9358,1,7306')] ).
cnf(12488,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(B,e_quivalent(C,C))),A)),
inference(hyper,[status(thm)],[11685,1,17]),
[iquote('hyper,11685,1,17')] ).
cnf(13947,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(B,e_quivalent(A,C)),C))),
inference(hyper,[status(thm)],[12488,1,126]),
[iquote('hyper,12488,1,126')] ).
cnf(14272,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,e_quivalent(A,B)),C)),C)),
inference(hyper,[status(thm)],[13947,1,11665]),
[iquote('hyper,13947,1,11665')] ).
cnf(15626,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(B,A)),e_quivalent(C,C))),
inference(hyper,[status(thm)],[10339,1,14272]),
[iquote('hyper,10339,1,14272')] ).
cnf(15657,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(B,A))),
inference(hyper,[status(thm)],[15626,1,11665]),
[iquote('hyper,15626,1,11665')] ).
cnf(15967,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(B,C)),C),e_quivalent(B,A))),
inference(hyper,[status(thm)],[15657,1,13947]),
[iquote('hyper,15657,1,13947')] ).
cnf(15968,plain,
$false,
inference(binary,[status(thm)],[15967,2]),
[iquote('binary,15967.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL024-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n026.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:41:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 4.90/5.09 ----- Otter 3.3f, August 2004 -----
% 4.90/5.09 The process was started by sandbox on n026.cluster.edu,
% 4.90/5.09 Wed Jul 27 09:41:24 2022
% 4.90/5.09 The command was "./otter". The process ID is 6071.
% 4.90/5.09
% 4.90/5.09 set(prolog_style_variables).
% 4.90/5.09 set(auto).
% 4.90/5.09 dependent: set(auto1).
% 4.90/5.09 dependent: set(process_input).
% 4.90/5.09 dependent: clear(print_kept).
% 4.90/5.09 dependent: clear(print_new_demod).
% 4.90/5.09 dependent: clear(print_back_demod).
% 4.90/5.09 dependent: clear(print_back_sub).
% 4.90/5.09 dependent: set(control_memory).
% 4.90/5.09 dependent: assign(max_mem, 12000).
% 4.90/5.09 dependent: assign(pick_given_ratio, 4).
% 4.90/5.09 dependent: assign(stats_level, 1).
% 4.90/5.09 dependent: assign(max_seconds, 10800).
% 4.90/5.09 clear(print_given).
% 4.90/5.09
% 4.90/5.09 list(usable).
% 4.90/5.09 0 [] -is_a_theorem(e_quivalent(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 4.90/5.09 0 [] is_a_theorem(e_quivalent(X,e_quivalent(e_quivalent(Y,e_quivalent(Z,X)),e_quivalent(Z,Y)))).
% 4.90/5.09 0 [] -is_a_theorem(e_quivalent(e_quivalent(e_quivalent(a,e_quivalent(b,c)),c),e_quivalent(b,a))).
% 4.90/5.09 end_of_list.
% 4.90/5.09
% 4.90/5.09 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 4.90/5.09
% 4.90/5.09 This is a Horn set without equality. The strategy will
% 4.90/5.09 be hyperresolution, with satellites in sos and nuclei
% 4.90/5.09 in usable.
% 4.90/5.09
% 4.90/5.09 dependent: set(hyper_res).
% 4.90/5.09 dependent: clear(order_hyper).
% 4.90/5.09
% 4.90/5.09 ------------> process usable:
% 4.90/5.09 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(e_quivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 4.90/5.09 ** KEPT (pick-wt=12): 2 [] -is_a_theorem(e_quivalent(e_quivalent(e_quivalent(a,e_quivalent(b,c)),c),e_quivalent(b,a))).
% 4.90/5.09
% 4.90/5.09 ------------> process sos:
% 4.90/5.09 ** KEPT (pick-wt=12): 3 [] is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,e_quivalent(C,A)),e_quivalent(C,B)))).
% 4.90/5.09
% 4.90/5.09 ======= end of input processing =======
% 4.90/5.09
% 4.90/5.09 =========== start of search ===========
% 4.90/5.09
% 4.90/5.09
% 4.90/5.09 Resetting weight limit to 20.
% 4.90/5.09
% 4.90/5.09
% 4.90/5.09 Resetting weight limit to 20.
% 4.90/5.09
% 4.90/5.09 sos_size=6421
% 4.90/5.09
% 4.90/5.09 -------- PROOF --------
% 4.90/5.09
% 4.90/5.09 ----> UNIT CONFLICT at 2.96 sec ----> 15968 [binary,15967.1,2.1] $F.
% 4.90/5.09
% 4.90/5.09 Length of proof is 30. Level of proof is 20.
% 4.90/5.09
% 4.90/5.09 ---------------- PROOF ----------------
% 4.90/5.09 % SZS status Unsatisfiable
% 4.90/5.09 % SZS output start Refutation
% See solution above
% 4.90/5.09 ------------ end of proof -------------
% 4.90/5.09
% 4.90/5.09
% 4.90/5.09 Search stopped by max_proofs option.
% 4.90/5.09
% 4.90/5.09
% 4.90/5.09 Search stopped by max_proofs option.
% 4.90/5.09
% 4.90/5.09 ============ end of search ============
% 4.90/5.09
% 4.90/5.09 -------------- statistics -------------
% 4.90/5.09 clauses given 970
% 4.90/5.09 clauses generated 516987
% 4.90/5.09 clauses kept 15967
% 4.90/5.09 clauses forward subsumed 135257
% 4.90/5.09 clauses back subsumed 0
% 4.90/5.09 Kbytes malloced 8789
% 4.90/5.09
% 4.90/5.09 ----------- times (seconds) -----------
% 4.90/5.09 user CPU time 2.96 (0 hr, 0 min, 2 sec)
% 4.90/5.09 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 4.90/5.09 wall-clock time 5 (0 hr, 0 min, 5 sec)
% 4.90/5.09
% 4.90/5.09 That finishes the proof of the theorem.
% 4.90/5.09
% 4.90/5.09 Process 6071 finished Wed Jul 27 09:41:29 2022
% 4.90/5.09 Otter interrupted
% 4.90/5.09 PROOF FOUND
%------------------------------------------------------------------------------