TSTP Solution File: LCL127-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL127-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n019.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:38 EDT 2022
% Result : Unsatisfiable 5.87s 6.05s
% Output : Refutation 5.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 3
% Syntax : Number of clauses : 36 ( 35 unt; 0 nHn; 3 RR)
% Number of literals : 38 ( 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 130 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(e_quivalent(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL127-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(e_quivalent(a,e_quivalent(a,e_quivalent(e_quivalent(b,c),e_quivalent(e_quivalent(b,e),e_quivalent(c,e)))))),
file('LCL127-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(A,e_quivalent(e_quivalent(B,D),e_quivalent(C,D))))),
file('LCL127-1.p',unknown),
[] ).
cnf(4,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(e_quivalent(A,D),e_quivalent(e_quivalent(e_quivalent(B,E),e_quivalent(C,E)),D)))),
inference(hyper,[status(thm)],[3,1,3]),
[iquote('hyper,3,1,3')] ).
cnf(7,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(B,C)),D),e_quivalent(e_quivalent(e_quivalent(A,E),e_quivalent(e_quivalent(e_quivalent(B,F),e_quivalent(C,F)),E)),D))),
inference(hyper,[status(thm)],[4,1,3]),
[iquote('hyper,4,1,3')] ).
cnf(18,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(e_quivalent(C,D),e_quivalent(E,D)),B)),e_quivalent(e_quivalent(A,F),e_quivalent(e_quivalent(e_quivalent(C,G),e_quivalent(E,G)),F)))),
inference(hyper,[status(thm)],[7,1,4]),
[iquote('hyper,7,1,4')] ).
cnf(19,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(e_quivalent(C,D),e_quivalent(E,D)),B)),e_quivalent(A,e_quivalent(e_quivalent(C,F),e_quivalent(E,F))))),
inference(hyper,[status(thm)],[7,1,3]),
[iquote('hyper,7,1,3')] ).
cnf(72,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(C,B)),e_quivalent(e_quivalent(A,D),e_quivalent(C,D)))),
inference(hyper,[status(thm)],[18,1,19]),
[iquote('hyper,18,1,19')] ).
cnf(102,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(e_quivalent(A,B),C))),
inference(hyper,[status(thm)],[72,1,72]),
[iquote('hyper,72,1,72')] ).
cnf(119,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),C),D),e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),E),e_quivalent(C,E)),D))),
inference(hyper,[status(thm)],[102,1,4]),
[iquote('hyper,102,1,4')] ).
cnf(120,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(e_quivalent(e_quivalent(A,B),D),e_quivalent(C,D)))),
inference(hyper,[status(thm)],[102,1,3]),
[iquote('hyper,102,1,3')] ).
cnf(130,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(B,C)),D),e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,E),e_quivalent(C,E))),D))),
inference(hyper,[status(thm)],[120,1,3]),
[iquote('hyper,120,1,3')] ).
cnf(196,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(D,C)),e_quivalent(e_quivalent(A,B),D))),
inference(hyper,[status(thm)],[119,1,102]),
[iquote('hyper,119,1,102')] ).
cnf(217,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(A,B))),
inference(hyper,[status(thm)],[196,1,102]),
[iquote('hyper,196,1,102')] ).
cnf(223,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(e_quivalent(e_quivalent(A,D),e_quivalent(B,D)),C))),
inference(hyper,[status(thm)],[217,1,4]),
[iquote('hyper,217,1,4')] ).
cnf(224,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(A,C),e_quivalent(B,C)))),
inference(hyper,[status(thm)],[217,1,3]),
[iquote('hyper,217,1,3')] ).
cnf(263,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(e_quivalent(A,C),D),e_quivalent(e_quivalent(B,C),D)))),
inference(hyper,[status(thm)],[224,1,3]),
[iquote('hyper,224,1,3')] ).
cnf(276,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(C,B)),e_quivalent(A,C))),
inference(hyper,[status(thm)],[223,1,217]),
[iquote('hyper,223,1,217')] ).
cnf(282,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(C,B)),D),e_quivalent(e_quivalent(A,C),D))),
inference(hyper,[status(thm)],[276,1,224]),
[iquote('hyper,276,1,224')] ).
cnf(292,plain,
is_a_theorem(e_quivalent(A,A)),
inference(hyper,[status(thm)],[276,1,217]),
[iquote('hyper,276,1,217')] ).
cnf(323,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(e_quivalent(A,D),e_quivalent(C,e_quivalent(D,B))))),
inference(hyper,[status(thm)],[282,1,282]),
[iquote('hyper,282,1,282')] ).
cnf(517,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(D,C))),e_quivalent(A,e_quivalent(B,D)))),
inference(hyper,[status(thm)],[130,1,292]),
[iquote('hyper,130,1,292')] ).
cnf(520,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(C,D),e_quivalent(B,D))),e_quivalent(A,C))),
inference(hyper,[status(thm)],[130,1,276]),
[iquote('hyper,130,1,276')] ).
cnf(565,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(D,B)),e_quivalent(A,e_quivalent(D,C)))),
inference(hyper,[status(thm)],[517,1,3]),
[iquote('hyper,517,1,3')] ).
cnf(624,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,B)),A)),
inference(hyper,[status(thm)],[520,1,3]),
[iquote('hyper,520,1,3')] ).
cnf(630,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(A,e_quivalent(B,e_quivalent(C,C))))),
inference(hyper,[status(thm)],[624,1,323]),
[iquote('hyper,624,1,323')] ).
cnf(745,plain,
is_a_theorem(e_quivalent(A,e_quivalent(A,e_quivalent(B,B)))),
inference(hyper,[status(thm)],[630,1,292]),
[iquote('hyper,630,1,292')] ).
cnf(779,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(A,e_quivalent(C,C)),B))),
inference(hyper,[status(thm)],[745,1,224]),
[iquote('hyper,745,1,224')] ).
cnf(1215,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,e_quivalent(C,C))),e_quivalent(A,B))),
inference(hyper,[status(thm)],[779,1,517]),
[iquote('hyper,779,1,517')] ).
cnf(2372,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(C,B)),A)),
inference(hyper,[status(thm)],[565,1,1215]),
[iquote('hyper,565,1,1215')] ).
cnf(2423,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(C,B)),D),E),e_quivalent(e_quivalent(A,D),E))),
inference(hyper,[status(thm)],[2372,1,263]),
[iquote('hyper,2372,1,263')] ).
cnf(2424,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(C,B)),D),e_quivalent(A,D))),
inference(hyper,[status(thm)],[2372,1,224]),
[iquote('hyper,2372,1,224')] ).
cnf(2443,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(B,C)),D),e_quivalent(e_quivalent(e_quivalent(C,E),e_quivalent(B,E)),D)),A)),
inference(hyper,[status(thm)],[2372,1,7]),
[iquote('hyper,2372,1,7')] ).
cnf(10597,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(B,C),e_quivalent(D,C)),e_quivalent(B,D))),A)),
inference(hyper,[status(thm)],[2443,1,2423]),
[iquote('hyper,2443,1,2423')] ).
cnf(10599,plain,
is_a_theorem(e_quivalent(A,e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(e_quivalent(B,D),e_quivalent(C,D)))))),
inference(hyper,[status(thm)],[10597,1,2424]),
[iquote('hyper,10597,1,2424')] ).
cnf(10600,plain,
$false,
inference(binary,[status(thm)],[10599,2]),
[iquote('binary,10599.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL127-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n019.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 09:20:37 EDT 2022
% 0.12/0.34 % CPUTime :
% 5.87/6.05 ----- Otter 3.3f, August 2004 -----
% 5.87/6.05 The process was started by sandbox on n019.cluster.edu,
% 5.87/6.05 Wed Jul 27 09:20:37 2022
% 5.87/6.05 The command was "./otter". The process ID is 28020.
% 5.87/6.05
% 5.87/6.05 set(prolog_style_variables).
% 5.87/6.05 set(auto).
% 5.87/6.05 dependent: set(auto1).
% 5.87/6.05 dependent: set(process_input).
% 5.87/6.05 dependent: clear(print_kept).
% 5.87/6.05 dependent: clear(print_new_demod).
% 5.87/6.05 dependent: clear(print_back_demod).
% 5.87/6.05 dependent: clear(print_back_sub).
% 5.87/6.05 dependent: set(control_memory).
% 5.87/6.05 dependent: assign(max_mem, 12000).
% 5.87/6.05 dependent: assign(pick_given_ratio, 4).
% 5.87/6.05 dependent: assign(stats_level, 1).
% 5.87/6.05 dependent: assign(max_seconds, 10800).
% 5.87/6.05 clear(print_given).
% 5.87/6.05
% 5.87/6.05 list(usable).
% 5.87/6.05 0 [] -is_a_theorem(e_quivalent(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 5.87/6.05 0 [] is_a_theorem(e_quivalent(e_quivalent(X,e_quivalent(Y,Z)),e_quivalent(X,e_quivalent(e_quivalent(Y,U),e_quivalent(Z,U))))).
% 5.87/6.05 0 [] -is_a_theorem(e_quivalent(a,e_quivalent(a,e_quivalent(e_quivalent(b,c),e_quivalent(e_quivalent(b,e),e_quivalent(c,e)))))).
% 5.87/6.05 end_of_list.
% 5.87/6.05
% 5.87/6.05 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 5.87/6.05
% 5.87/6.05 This is a Horn set without equality. The strategy will
% 5.87/6.05 be hyperresolution, with satellites in sos and nuclei
% 5.87/6.05 in usable.
% 5.87/6.05
% 5.87/6.05 dependent: set(hyper_res).
% 5.87/6.05 dependent: clear(order_hyper).
% 5.87/6.05
% 5.87/6.05 ------------> process usable:
% 5.87/6.05 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(e_quivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 5.87/6.05 ** KEPT (pick-wt=16): 2 [] -is_a_theorem(e_quivalent(a,e_quivalent(a,e_quivalent(e_quivalent(b,c),e_quivalent(e_quivalent(b,e),e_quivalent(c,e)))))).
% 5.87/6.05
% 5.87/6.05 ------------> process sos:
% 5.87/6.05 ** KEPT (pick-wt=16): 3 [] is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(A,e_quivalent(e_quivalent(B,D),e_quivalent(C,D))))).
% 5.87/6.05
% 5.87/6.05 ======= end of input processing =======
% 5.87/6.05
% 5.87/6.05 =========== start of search ===========
% 5.87/6.05
% 5.87/6.05
% 5.87/6.05 Resetting weight limit to 20.
% 5.87/6.05
% 5.87/6.05
% 5.87/6.05 Resetting weight limit to 20.
% 5.87/6.05
% 5.87/6.05 sos_size=5259
% 5.87/6.05
% 5.87/6.05 -------- PROOF --------
% 5.87/6.05
% 5.87/6.05 ----> UNIT CONFLICT at 4.16 sec ----> 10600 [binary,10599.1,2.1] $F.
% 5.87/6.05
% 5.87/6.05 Length of proof is 32. Level of proof is 20.
% 5.87/6.05
% 5.87/6.05 ---------------- PROOF ----------------
% 5.87/6.05 % SZS status Unsatisfiable
% 5.87/6.05 % SZS output start Refutation
% See solution above
% 5.87/6.05 ------------ end of proof -------------
% 5.87/6.05
% 5.87/6.05
% 5.87/6.05 Search stopped by max_proofs option.
% 5.87/6.05
% 5.87/6.05
% 5.87/6.05 Search stopped by max_proofs option.
% 5.87/6.05
% 5.87/6.05 ============ end of search ============
% 5.87/6.05
% 5.87/6.05 -------------- statistics -------------
% 5.87/6.05 clauses given 1173
% 5.87/6.05 clauses generated 895606
% 5.87/6.05 clauses kept 10599
% 5.87/6.05 clauses forward subsumed 304358
% 5.87/6.05 clauses back subsumed 74
% 5.87/6.05 Kbytes malloced 6835
% 5.87/6.05
% 5.87/6.05 ----------- times (seconds) -----------
% 5.87/6.05 user CPU time 4.16 (0 hr, 0 min, 4 sec)
% 5.87/6.05 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 5.87/6.05 wall-clock time 5 (0 hr, 0 min, 5 sec)
% 5.87/6.05
% 5.87/6.05 That finishes the proof of the theorem.
% 5.87/6.05
% 5.87/6.05 Process 28020 finished Wed Jul 27 09:20:42 2022
% 5.87/6.05 Otter interrupted
% 5.87/6.05 PROOF FOUND
%------------------------------------------------------------------------------