TSTP Solution File: LCL121-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL121-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n022.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:37 EDT 2022
% Result : Unsatisfiable 2.65s 2.82s
% Output : Refutation 2.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 3
% Syntax : Number of clauses : 30 ( 29 unt; 0 nHn; 3 RR)
% Number of literals : 32 ( 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 : 98 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(e_quivalent(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL121-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(e_quivalent(a,e_quivalent(a,e_quivalent(e_quivalent(b,e_quivalent(c,c)),b)))),
file('LCL121-1.p',unknown),
[] ).
cnf(3,axiom,
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)))))),
file('LCL121-1.p',unknown),
[] ).
cnf(4,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(e_quivalent(B,D),e_quivalent(C,D))))),e_quivalent(e_quivalent(E,F),e_quivalent(e_quivalent(E,G),e_quivalent(F,G))))),
inference(hyper,[status(thm)],[3,1,3]),
[iquote('hyper,3,1,3')] ).
cnf(6,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(A,C),e_quivalent(B,C)))),
inference(hyper,[status(thm)],[4,1,3]),
[iquote('hyper,4,1,3')] ).
cnf(7,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)],[6,1,6]),
[iquote('hyper,6,1,6')] ).
cnf(14,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)],[7,1,6]),
[iquote('hyper,7,1,6')] ).
cnf(17,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(e_quivalent(A,B),C))),
inference(hyper,[status(thm)],[14,1,14]),
[iquote('hyper,14,1,14')] ).
cnf(18,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(e_quivalent(D,B),C)),e_quivalent(e_quivalent(A,E),e_quivalent(D,E)))),
inference(hyper,[status(thm)],[14,1,7]),
[iquote('hyper,14,1,7')] ).
cnf(21,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(D,C))),E),e_quivalent(e_quivalent(A,e_quivalent(B,D)),E))),
inference(hyper,[status(thm)],[14,1,4]),
[iquote('hyper,14,1,4')] ).
cnf(25,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)],[17,1,7]),
[iquote('hyper,17,1,7')] ).
cnf(30,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(A,B))),
inference(hyper,[status(thm)],[25,1,17]),
[iquote('hyper,25,1,17')] ).
cnf(31,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)],[25,1,4]),
[iquote('hyper,25,1,4')] ).
cnf(32,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(C,B)),e_quivalent(A,C))),
inference(hyper,[status(thm)],[30,1,7]),
[iquote('hyper,30,1,7')] ).
cnf(35,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)],[32,1,6]),
[iquote('hyper,32,1,6')] ).
cnf(37,plain,
is_a_theorem(e_quivalent(A,A)),
inference(hyper,[status(thm)],[32,1,30]),
[iquote('hyper,32,1,30')] ).
cnf(41,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)],[31,1,31]),
[iquote('hyper,31,1,31')] ).
cnf(44,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(C,e_quivalent(B,D))),e_quivalent(e_quivalent(A,D),C))),
inference(hyper,[status(thm)],[31,1,7]),
[iquote('hyper,31,1,7')] ).
cnf(48,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)],[35,1,35]),
[iquote('hyper,35,1,35')] ).
cnf(49,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(C,B)),e_quivalent(D,C)),e_quivalent(A,D))),
inference(hyper,[status(thm)],[35,1,31]),
[iquote('hyper,35,1,31')] ).
cnf(121,plain,
is_a_theorem(e_quivalent(A,e_quivalent(A,e_quivalent(B,B)))),
inference(hyper,[status(thm)],[49,1,31]),
[iquote('hyper,49,1,31')] ).
cnf(127,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(A,e_quivalent(C,C)),B))),
inference(hyper,[status(thm)],[121,1,14]),
[iquote('hyper,121,1,14')] ).
cnf(216,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,B)),A)),
inference(hyper,[status(thm)],[127,1,37]),
[iquote('hyper,127,1,37')] ).
cnf(235,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,B),C)),C),A)),
inference(hyper,[status(thm)],[216,1,44]),
[iquote('hyper,216,1,44')] ).
cnf(236,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(C,C),B)),A)),
inference(hyper,[status(thm)],[216,1,41]),
[iquote('hyper,216,1,41')] ).
cnf(485,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,B),C)),D),e_quivalent(A,e_quivalent(D,C)))),
inference(hyper,[status(thm)],[235,1,48]),
[iquote('hyper,235,1,48')] ).
cnf(1360,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(C,B)),A)),
inference(hyper,[status(thm)],[21,1,236]),
[iquote('hyper,21,1,236')] ).
cnf(1412,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)],[1360,1,18]),
[iquote('hyper,1360,1,18')] ).
cnf(8083,plain,
is_a_theorem(e_quivalent(A,e_quivalent(A,e_quivalent(e_quivalent(B,e_quivalent(C,C)),B)))),
inference(hyper,[status(thm)],[1412,1,485]),
[iquote('hyper,1412,1,485')] ).
cnf(8084,plain,
$false,
inference(binary,[status(thm)],[8083,2]),
[iquote('binary,8083.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL121-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % 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:15:20 EDT 2022
% 0.12/0.34 % CPUTime :
% 2.65/2.82 ----- Otter 3.3f, August 2004 -----
% 2.65/2.82 The process was started by sandbox2 on n022.cluster.edu,
% 2.65/2.82 Wed Jul 27 09:15:20 2022
% 2.65/2.82 The command was "./otter". The process ID is 11209.
% 2.65/2.82
% 2.65/2.82 set(prolog_style_variables).
% 2.65/2.82 set(auto).
% 2.65/2.82 dependent: set(auto1).
% 2.65/2.82 dependent: set(process_input).
% 2.65/2.82 dependent: clear(print_kept).
% 2.65/2.82 dependent: clear(print_new_demod).
% 2.65/2.82 dependent: clear(print_back_demod).
% 2.65/2.82 dependent: clear(print_back_sub).
% 2.65/2.82 dependent: set(control_memory).
% 2.65/2.82 dependent: assign(max_mem, 12000).
% 2.65/2.82 dependent: assign(pick_given_ratio, 4).
% 2.65/2.82 dependent: assign(stats_level, 1).
% 2.65/2.82 dependent: assign(max_seconds, 10800).
% 2.65/2.82 clear(print_given).
% 2.65/2.82
% 2.65/2.82 list(usable).
% 2.65/2.82 0 [] -is_a_theorem(e_quivalent(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 2.65/2.82 0 [] is_a_theorem(e_quivalent(X,e_quivalent(X,e_quivalent(e_quivalent(Y,Z),e_quivalent(e_quivalent(Y,U),e_quivalent(Z,U)))))).
% 2.65/2.82 0 [] -is_a_theorem(e_quivalent(a,e_quivalent(a,e_quivalent(e_quivalent(b,e_quivalent(c,c)),b)))).
% 2.65/2.82 end_of_list.
% 2.65/2.82
% 2.65/2.82 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 2.65/2.82
% 2.65/2.82 This is a Horn set without equality. The strategy will
% 2.65/2.82 be hyperresolution, with satellites in sos and nuclei
% 2.65/2.82 in usable.
% 2.65/2.82
% 2.65/2.82 dependent: set(hyper_res).
% 2.65/2.82 dependent: clear(order_hyper).
% 2.65/2.82
% 2.65/2.82 ------------> process usable:
% 2.65/2.82 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(e_quivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 2.65/2.82 ** KEPT (pick-wt=12): 2 [] -is_a_theorem(e_quivalent(a,e_quivalent(a,e_quivalent(e_quivalent(b,e_quivalent(c,c)),b)))).
% 2.65/2.82
% 2.65/2.82 ------------> process sos:
% 2.65/2.82 ** KEPT (pick-wt=16): 3 [] 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)))))).
% 2.65/2.82
% 2.65/2.82 ======= end of input processing =======
% 2.65/2.82
% 2.65/2.82 =========== start of search ===========
% 2.65/2.82
% 2.65/2.82
% 2.65/2.82 Resetting weight limit to 20.
% 2.65/2.82
% 2.65/2.82
% 2.65/2.82 Resetting weight limit to 20.
% 2.65/2.82
% 2.65/2.82 sos_size=5849
% 2.65/2.82
% 2.65/2.82 -------- PROOF --------
% 2.65/2.82
% 2.65/2.82 ----> UNIT CONFLICT at 0.92 sec ----> 8084 [binary,8083.1,2.1] $F.
% 2.65/2.82
% 2.65/2.82 Length of proof is 26. Level of proof is 17.
% 2.65/2.82
% 2.65/2.82 ---------------- PROOF ----------------
% 2.65/2.82 % SZS status Unsatisfiable
% 2.65/2.82 % SZS output start Refutation
% See solution above
% 2.65/2.82 ------------ end of proof -------------
% 2.65/2.82
% 2.65/2.82
% 2.65/2.82 Search stopped by max_proofs option.
% 2.65/2.82
% 2.65/2.82
% 2.65/2.82 Search stopped by max_proofs option.
% 2.65/2.82
% 2.65/2.82 ============ end of search ============
% 2.65/2.82
% 2.65/2.82 -------------- statistics -------------
% 2.65/2.82 clauses given 338
% 2.65/2.82 clauses generated 70418
% 2.65/2.82 clauses kept 8083
% 2.65/2.82 clauses forward subsumed 39346
% 2.65/2.82 clauses back subsumed 10
% 2.65/2.82 Kbytes malloced 4882
% 2.65/2.82
% 2.65/2.82 ----------- times (seconds) -----------
% 2.65/2.82 user CPU time 0.92 (0 hr, 0 min, 0 sec)
% 2.65/2.82 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.65/2.82 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.65/2.82
% 2.65/2.82 That finishes the proof of the theorem.
% 2.65/2.82
% 2.65/2.82 Process 11209 finished Wed Jul 27 09:15:22 2022
% 2.65/2.82 Otter interrupted
% 2.65/2.82 PROOF FOUND
%------------------------------------------------------------------------------