TSTP Solution File: LCL004-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL004-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n009.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:17 EDT 2022
% Result : Unsatisfiable 1.82s 2.01s
% Output : Refutation 1.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 38
% Number of leaves : 3
% Syntax : Number of clauses : 46 ( 45 unt; 0 nHn; 3 RR)
% Number of literals : 48 ( 0 equ; 3 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 149 ( 79 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(or(not(A),B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL004-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(or(not(a),or(b,a))),
file('LCL004-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(or(not(or(not(or(not(A),B)),or(C,or(D,E)))),or(not(or(not(D),A)),or(C,or(E,A))))),
file('LCL004-1.p',unknown),
[] ).
cnf(4,plain,
is_a_theorem(or(not(or(not(A),or(not(B),C))),or(not(or(not(D),B)),or(or(E,B),or(not(B),C))))),
inference(hyper,[status(thm)],[3,1,3]),
[iquote('hyper,3,1,3')] ).
cnf(6,plain,
is_a_theorem(or(not(or(not(or(A,B)),C)),or(not(or(not(D),B)),or(or(not(B),E),C)))),
inference(hyper,[status(thm)],[4,1,3]),
[iquote('hyper,4,1,3')] ).
cnf(10,plain,
is_a_theorem(or(not(or(not(or(not(A),B)),or(C,A))),or(not(or(not(D),A)),or(E,or(C,A))))),
inference(hyper,[status(thm)],[6,1,3]),
[iquote('hyper,6,1,3')] ).
cnf(13,plain,
is_a_theorem(or(not(or(not(A),or(not(B),or(C,B)))),or(D,or(not(or(not(E),B)),or(not(B),or(C,B)))))),
inference(hyper,[status(thm)],[10,1,10]),
[iquote('hyper,10,1,10')] ).
cnf(65,plain,
is_a_theorem(or(not(or(not(not(or(not(A),B))),C)),or(D,or(or(not(B),or(E,B)),C)))),
inference(hyper,[status(thm)],[13,1,3]),
[iquote('hyper,13,1,3')] ).
cnf(79,plain,
is_a_theorem(or(A,or(not(or(not(B),C)),or(not(C),or(or(not(D),or(E,D)),C))))),
inference(hyper,[status(thm)],[65,1,13]),
[iquote('hyper,65,1,13')] ).
cnf(86,plain,
is_a_theorem(or(not(or(not(A),B)),or(not(B),or(or(not(C),or(D,C)),B)))),
inference(hyper,[status(thm)],[79,1,79]),
[iquote('hyper,79,1,79')] ).
cnf(95,plain,
is_a_theorem(or(not(or(not(or(not(A),or(B,A))),C)),or(not(D),or(D,C)))),
inference(hyper,[status(thm)],[86,1,3]),
[iquote('hyper,86,1,3')] ).
cnf(110,plain,
is_a_theorem(or(A,or(not(or(not(B),C)),or(not(C),or(C,C))))),
inference(hyper,[status(thm)],[95,1,13]),
[iquote('hyper,95,1,13')] ).
cnf(147,plain,
is_a_theorem(or(not(or(not(A),B)),or(not(B),or(B,B)))),
inference(hyper,[status(thm)],[110,1,110]),
[iquote('hyper,110,1,110')] ).
cnf(157,plain,
is_a_theorem(or(not(or(not(A),B)),or(not(A),or(A,B)))),
inference(hyper,[status(thm)],[147,1,3]),
[iquote('hyper,147,1,3')] ).
cnf(169,plain,
is_a_theorem(or(not(or(not(A),A)),or(not(A),or(B,A)))),
inference(hyper,[status(thm)],[157,1,3]),
[iquote('hyper,157,1,3')] ).
cnf(184,plain,
is_a_theorem(or(A,or(not(or(not(B),C)),or(not(C),or(D,C))))),
inference(hyper,[status(thm)],[169,1,13]),
[iquote('hyper,169,1,13')] ).
cnf(246,plain,
is_a_theorem(or(not(or(not(A),B)),or(not(B),or(C,B)))),
inference(hyper,[status(thm)],[184,1,184]),
[iquote('hyper,184,1,184')] ).
cnf(258,plain,
is_a_theorem(or(not(or(not(A),or(B,C))),or(D,or(not(C),or(B,C))))),
inference(hyper,[status(thm)],[246,1,10]),
[iquote('hyper,246,1,10')] ).
cnf(259,plain,
is_a_theorem(or(not(or(not(A),B)),or(not(C),or(C,B)))),
inference(hyper,[status(thm)],[246,1,3]),
[iquote('hyper,246,1,3')] ).
cnf(278,plain,
is_a_theorem(or(not(or(not(A),B)),or(not(A),or(C,B)))),
inference(hyper,[status(thm)],[259,1,3]),
[iquote('hyper,259,1,3')] ).
cnf(404,plain,
is_a_theorem(or(not(or(not(A),B)),or(C,or(not(B),or(D,B))))),
inference(hyper,[status(thm)],[278,1,246]),
[iquote('hyper,278,1,246')] ).
cnf(576,plain,
is_a_theorem(or(not(or(not(not(A)),B)),or(C,or(or(D,A),B)))),
inference(hyper,[status(thm)],[404,1,3]),
[iquote('hyper,404,1,3')] ).
cnf(673,plain,
is_a_theorem(or(not(or(not(or(A,B)),not(B))),or(C,or(D,not(B))))),
inference(hyper,[status(thm)],[576,1,3]),
[iquote('hyper,576,1,3')] ).
cnf(1951,plain,
is_a_theorem(or(A,or(not(or(B,not(C))),or(D,or(B,not(C)))))),
inference(hyper,[status(thm)],[258,1,673]),
[iquote('hyper,258,1,673')] ).
cnf(2156,plain,
is_a_theorem(or(not(or(A,not(B))),or(C,or(A,not(B))))),
inference(hyper,[status(thm)],[1951,1,1951]),
[iquote('hyper,1951,1,1951')] ).
cnf(2210,plain,
is_a_theorem(or(not(or(not(not(A)),A)),or(B,or(not(C),A)))),
inference(hyper,[status(thm)],[2156,1,3]),
[iquote('hyper,2156,1,3')] ).
cnf(2233,plain,
is_a_theorem(or(A,or(not(or(not(B),C)),or(D,or(not(B),C))))),
inference(hyper,[status(thm)],[2210,1,258]),
[iquote('hyper,2210,1,258')] ).
cnf(2632,plain,
is_a_theorem(or(not(or(not(A),B)),or(C,or(not(A),B)))),
inference(hyper,[status(thm)],[2233,1,2233]),
[iquote('hyper,2233,1,2233')] ).
cnf(2669,plain,
is_a_theorem(or(not(or(not(not(A)),A)),or(B,or(C,A)))),
inference(hyper,[status(thm)],[2632,1,3]),
[iquote('hyper,2632,1,3')] ).
cnf(2717,plain,
is_a_theorem(or(A,or(not(or(B,C)),or(D,or(B,C))))),
inference(hyper,[status(thm)],[2669,1,258]),
[iquote('hyper,2669,1,258')] ).
cnf(2723,plain,
is_a_theorem(or(not(or(not(A),not(B))),or(C,or(B,not(B))))),
inference(hyper,[status(thm)],[2669,1,3]),
[iquote('hyper,2669,1,3')] ).
cnf(2825,plain,
is_a_theorem(or(not(or(A,B)),or(C,or(A,B)))),
inference(hyper,[status(thm)],[2717,1,2717]),
[iquote('hyper,2717,1,2717')] ).
cnf(2835,plain,
is_a_theorem(or(not(or(A,B)),or(C,or(D,or(A,B))))),
inference(hyper,[status(thm)],[2825,1,278]),
[iquote('hyper,2825,1,278')] ).
cnf(2912,plain,
is_a_theorem(or(not(or(not(A),B)),or(C,or(or(not(B),D),B)))),
inference(hyper,[status(thm)],[2835,1,3]),
[iquote('hyper,2835,1,3')] ).
cnf(3164,plain,
is_a_theorem(or(not(or(not(or(not(A),B)),C)),or(D,or(A,C)))),
inference(hyper,[status(thm)],[2912,1,3]),
[iquote('hyper,2912,1,3')] ).
cnf(3185,plain,
is_a_theorem(or(A,or(B,or(C,or(D,not(D)))))),
inference(hyper,[status(thm)],[3164,1,2723]),
[iquote('hyper,3164,1,2723')] ).
cnf(3196,plain,
is_a_theorem(or(A,or(B,or(not(C),or(C,D))))),
inference(hyper,[status(thm)],[3164,1,259]),
[iquote('hyper,3164,1,259')] ).
cnf(3295,plain,
is_a_theorem(or(A,or(B,or(C,not(C))))),
inference(hyper,[status(thm)],[3185,1,3185]),
[iquote('hyper,3185,1,3185')] ).
cnf(3303,plain,
is_a_theorem(or(A,or(B,not(B)))),
inference(hyper,[status(thm)],[3295,1,3295]),
[iquote('hyper,3295,1,3295')] ).
cnf(3308,plain,
is_a_theorem(or(A,not(A))),
inference(hyper,[status(thm)],[3303,1,3303]),
[iquote('hyper,3303,1,3303')] ).
cnf(3313,plain,
is_a_theorem(not(not(or(A,not(A))))),
inference(hyper,[status(thm)],[3308,1,3308]),
[iquote('hyper,3308,1,3308')] ).
cnf(3743,plain,
is_a_theorem(or(A,or(not(B),or(B,C)))),
inference(hyper,[status(thm)],[3196,1,3196]),
[iquote('hyper,3196,1,3196')] ).
cnf(3744,plain,
is_a_theorem(or(not(A),or(A,B))),
inference(hyper,[status(thm)],[3743,1,3743]),
[iquote('hyper,3743,1,3743')] ).
cnf(3767,plain,
is_a_theorem(or(not(not(or(A,not(A)))),B)),
inference(hyper,[status(thm)],[3744,1,3313]),
[iquote('hyper,3744,1,3313')] ).
cnf(3820,plain,
is_a_theorem(or(not(A),or(B,A))),
inference(hyper,[status(thm)],[3767,1,246]),
[iquote('hyper,3767,1,246')] ).
cnf(3821,plain,
$false,
inference(binary,[status(thm)],[3820,2]),
[iquote('binary,3820.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL004-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n009.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:16:51 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.82/2.01 ----- Otter 3.3f, August 2004 -----
% 1.82/2.01 The process was started by sandbox2 on n009.cluster.edu,
% 1.82/2.01 Wed Jul 27 09:16:51 2022
% 1.82/2.01 The command was "./otter". The process ID is 24606.
% 1.82/2.01
% 1.82/2.01 set(prolog_style_variables).
% 1.82/2.01 set(auto).
% 1.82/2.01 dependent: set(auto1).
% 1.82/2.01 dependent: set(process_input).
% 1.82/2.01 dependent: clear(print_kept).
% 1.82/2.01 dependent: clear(print_new_demod).
% 1.82/2.01 dependent: clear(print_back_demod).
% 1.82/2.01 dependent: clear(print_back_sub).
% 1.82/2.01 dependent: set(control_memory).
% 1.82/2.01 dependent: assign(max_mem, 12000).
% 1.82/2.01 dependent: assign(pick_given_ratio, 4).
% 1.82/2.01 dependent: assign(stats_level, 1).
% 1.82/2.01 dependent: assign(max_seconds, 10800).
% 1.82/2.01 clear(print_given).
% 1.82/2.01
% 1.82/2.01 list(usable).
% 1.82/2.01 0 [] -is_a_theorem(or(not(X),Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 1.82/2.01 0 [] is_a_theorem(or(not(or(not(or(not(X),Y)),or(Z,or(U,V)))),or(not(or(not(U),X)),or(Z,or(V,X))))).
% 1.82/2.01 0 [] -is_a_theorem(or(not(a),or(b,a))).
% 1.82/2.01 end_of_list.
% 1.82/2.01
% 1.82/2.01 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.82/2.01
% 1.82/2.01 This is a Horn set without equality. The strategy will
% 1.82/2.01 be hyperresolution, with satellites in sos and nuclei
% 1.82/2.01 in usable.
% 1.82/2.01
% 1.82/2.01 dependent: set(hyper_res).
% 1.82/2.01 dependent: clear(order_hyper).
% 1.82/2.01
% 1.82/2.01 ------------> process usable:
% 1.82/2.01 ** KEPT (pick-wt=9): 1 [] -is_a_theorem(or(not(A),B))| -is_a_theorem(A)|is_a_theorem(B).
% 1.82/2.01 ** KEPT (pick-wt=7): 2 [] -is_a_theorem(or(not(a),or(b,a))).
% 1.82/2.01
% 1.82/2.01 ------------> process sos:
% 1.82/2.01 ** KEPT (pick-wt=25): 3 [] is_a_theorem(or(not(or(not(or(not(A),B)),or(C,or(D,E)))),or(not(or(not(D),A)),or(C,or(E,A))))).
% 1.82/2.01
% 1.82/2.01 ======= end of input processing =======
% 1.82/2.01
% 1.82/2.01 =========== start of search ===========
% 1.82/2.01
% 1.82/2.01
% 1.82/2.01 Resetting weight limit to 13.
% 1.82/2.01
% 1.82/2.01
% 1.82/2.01 Resetting weight limit to 13.
% 1.82/2.01
% 1.82/2.01 sos_size=991
% 1.82/2.01
% 1.82/2.01 -------- PROOF --------
% 1.82/2.01
% 1.82/2.01 ----> UNIT CONFLICT at 0.16 sec ----> 3821 [binary,3820.1,2.1] $F.
% 1.82/2.01
% 1.82/2.01 Length of proof is 42. Level of proof is 37.
% 1.82/2.01
% 1.82/2.01 ---------------- PROOF ----------------
% 1.82/2.01 % SZS status Unsatisfiable
% 1.82/2.01 % SZS output start Refutation
% See solution above
% 1.82/2.01 ------------ end of proof -------------
% 1.82/2.01
% 1.82/2.01
% 1.82/2.01 Search stopped by max_proofs option.
% 1.82/2.01
% 1.82/2.01
% 1.82/2.01 Search stopped by max_proofs option.
% 1.82/2.01
% 1.82/2.01 ============ end of search ============
% 1.82/2.01
% 1.82/2.01 -------------- statistics -------------
% 1.82/2.01 clauses given 164
% 1.82/2.01 clauses generated 8944
% 1.82/2.01 clauses kept 3820
% 1.82/2.01 clauses forward subsumed 4924
% 1.82/2.01 clauses back subsumed 2797
% 1.82/2.01 Kbytes malloced 4882
% 1.82/2.01
% 1.82/2.01 ----------- times (seconds) -----------
% 1.82/2.01 user CPU time 0.16 (0 hr, 0 min, 0 sec)
% 1.82/2.01 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.82/2.01 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.82/2.01
% 1.82/2.01 That finishes the proof of the theorem.
% 1.82/2.01
% 1.82/2.01 Process 24606 finished Wed Jul 27 09:16:53 2022
% 1.82/2.01 Otter interrupted
% 1.82/2.01 PROOF FOUND
%------------------------------------------------------------------------------