TSTP Solution File: LCL015-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL015-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:18 EDT 2022
% Result : Unsatisfiable 4.36s 4.58s
% Output : Refutation 4.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 3
% Syntax : Number of clauses : 43 ( 42 unt; 0 nHn; 3 RR)
% Number of literals : 45 ( 0 equ; 3 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 11 ( 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 : 143 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(e_quivalent(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL015-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(e_quivalent(e_quivalent(a,e_quivalent(b,c)),e_quivalent(c,e_quivalent(a,b)))),
file('LCL015-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(C,e_quivalent(e_quivalent(B,C),A)))),
file('LCL015-1.p',unknown),
[] ).
cnf(4,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(B,e_quivalent(e_quivalent(C,B),D)),A),e_quivalent(D,C)))),
inference(hyper,[status(thm)],[3,1,3]),
[iquote('hyper,3,1,3')] ).
cnf(5,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,A),C)),e_quivalent(D,e_quivalent(e_quivalent(e_quivalent(E,e_quivalent(e_quivalent(F,E),G)),D),e_quivalent(G,F)))),e_quivalent(C,B))),
inference(hyper,[status(thm)],[4,1,4]),
[iquote('hyper,4,1,4')] ).
cnf(7,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,A),C)),e_quivalent(e_quivalent(D,E),e_quivalent(F,e_quivalent(e_quivalent(E,F),D)))),e_quivalent(C,B))),
inference(hyper,[status(thm)],[4,1,3]),
[iquote('hyper,4,1,3')] ).
cnf(13,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(B,e_quivalent(e_quivalent(e_quivalent(C,e_quivalent(e_quivalent(D,C),E)),B),e_quivalent(E,D))),A),F)),F)),
inference(hyper,[status(thm)],[7,1,7]),
[iquote('hyper,7,1,7')] ).
cnf(32,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(B,e_quivalent(C,A))),C),B)),
inference(hyper,[status(thm)],[5,1,3]),
[iquote('hyper,5,1,3')] ).
cnf(35,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,A),C)),e_quivalent(e_quivalent(e_quivalent(D,e_quivalent(E,e_quivalent(F,D))),F),E)),e_quivalent(C,B))),
inference(hyper,[status(thm)],[32,1,4]),
[iquote('hyper,32,1,4')] ).
cnf(36,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,A),e_quivalent(e_quivalent(C,e_quivalent(B,e_quivalent(D,C))),D)))),
inference(hyper,[status(thm)],[32,1,3]),
[iquote('hyper,32,1,3')] ).
cnf(42,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(B,e_quivalent(C,e_quivalent(D,B))),D),C)),e_quivalent(e_quivalent(E,e_quivalent(A,e_quivalent(F,E))),F))),
inference(hyper,[status(thm)],[36,1,32]),
[iquote('hyper,36,1,32')] ).
cnf(84,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(B,C),e_quivalent(D,e_quivalent(e_quivalent(C,D),B))),e_quivalent(E,A))),E)),
inference(hyper,[status(thm)],[35,1,32]),
[iquote('hyper,35,1,32')] ).
cnf(104,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(e_quivalent(D,e_quivalent(e_quivalent(C,D),B)),A)))),
inference(hyper,[status(thm)],[84,1,36]),
[iquote('hyper,84,1,36')] ).
cnf(112,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(e_quivalent(B,C),e_quivalent(e_quivalent(D,e_quivalent(e_quivalent(C,D),B)),E)),A),E))),
inference(hyper,[status(thm)],[104,1,3]),
[iquote('hyper,104,1,3')] ).
cnf(170,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(e_quivalent(B,e_quivalent(C,e_quivalent(D,B))),D),C),e_quivalent(E,A))),E)),
inference(hyper,[status(thm)],[42,1,32]),
[iquote('hyper,42,1,32')] ).
cnf(196,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(B,e_quivalent(C,e_quivalent(D,B))),D),e_quivalent(C,A)))),
inference(hyper,[status(thm)],[170,1,36]),
[iquote('hyper,170,1,36')] ).
cnf(202,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,A),C)),B),C)),
inference(hyper,[status(thm)],[196,1,13]),
[iquote('hyper,196,1,13')] ).
cnf(204,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,e_quivalent(C,e_quivalent(B,A)))),C)),
inference(hyper,[status(thm)],[196,1,7]),
[iquote('hyper,196,1,7')] ).
cnf(252,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(A,B),B))),
inference(hyper,[status(thm)],[204,1,202]),
[iquote('hyper,204,1,202')] ).
cnf(267,plain,
is_a_theorem(e_quivalent(A,e_quivalent(B,e_quivalent(e_quivalent(e_quivalent(B,C),C),A)))),
inference(hyper,[status(thm)],[204,1,36]),
[iquote('hyper,204,1,36')] ).
cnf(275,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),B),A)),
inference(hyper,[status(thm)],[252,1,35]),
[iquote('hyper,252,1,35')] ).
cnf(279,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(e_quivalent(B,C),C),A),B))),
inference(hyper,[status(thm)],[252,1,3]),
[iquote('hyper,252,1,3')] ).
cnf(314,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,A),B))),
inference(hyper,[status(thm)],[275,1,202]),
[iquote('hyper,275,1,202')] ).
cnf(351,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(e_quivalent(B,C),B),A),C))),
inference(hyper,[status(thm)],[314,1,3]),
[iquote('hyper,314,1,3')] ).
cnf(353,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(B,C),C),B)),A)),
inference(hyper,[status(thm)],[314,1,275]),
[iquote('hyper,314,1,275')] ).
cnf(960,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,A),C)),e_quivalent(C,B))),
inference(hyper,[status(thm)],[353,1,112]),
[iquote('hyper,353,1,112')] ).
cnf(973,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,A)),B)),
inference(hyper,[status(thm)],[353,1,4]),
[iquote('hyper,353,1,4')] ).
cnf(996,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,A),C)),D),e_quivalent(C,B)),D)),
inference(hyper,[status(thm)],[973,1,5]),
[iquote('hyper,973,1,5')] ).
cnf(999,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),A),B)),
inference(hyper,[status(thm)],[973,1,351]),
[iquote('hyper,973,1,351')] ).
cnf(1116,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),A),B),C),C)),
inference(hyper,[status(thm)],[999,1,252]),
[iquote('hyper,999,1,252')] ).
cnf(4532,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(C,e_quivalent(A,e_quivalent(B,C))))),
inference(hyper,[status(thm)],[960,1,196]),
[iquote('hyper,960,1,196')] ).
cnf(6486,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(B,C),B),e_quivalent(C,A)))),
inference(hyper,[status(thm)],[4532,1,1116]),
[iquote('hyper,4532,1,1116')] ).
cnf(6795,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(B,A))),
inference(hyper,[status(thm)],[6486,1,960]),
[iquote('hyper,6486,1,960')] ).
cnf(6878,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,e_quivalent(C,A))),e_quivalent(B,C))),
inference(hyper,[status(thm)],[6795,1,4532]),
[iquote('hyper,6795,1,4532')] ).
cnf(6901,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),B),C),A),C)),
inference(hyper,[status(thm)],[6795,1,279]),
[iquote('hyper,6795,1,279')] ).
cnf(6902,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(A,B),B),C)),C)),
inference(hyper,[status(thm)],[6795,1,267]),
[iquote('hyper,6795,1,267')] ).
cnf(7867,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,A),e_quivalent(C,B))),C)),
inference(hyper,[status(thm)],[6902,1,104]),
[iquote('hyper,6902,1,104')] ).
cnf(9346,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,C),C)),e_quivalent(B,A))),
inference(hyper,[status(thm)],[7867,1,6901]),
[iquote('hyper,7867,1,6901')] ).
cnf(10429,plain,
is_a_theorem(e_quivalent(A,e_quivalent(B,e_quivalent(e_quivalent(A,C),e_quivalent(C,B))))),
inference(hyper,[status(thm)],[9346,1,6878]),
[iquote('hyper,9346,1,6878')] ).
cnf(15551,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(B,e_quivalent(C,A))),C)),
inference(hyper,[status(thm)],[10429,1,960]),
[iquote('hyper,10429,1,960')] ).
cnf(18204,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(e_quivalent(C,A),B))),
inference(hyper,[status(thm)],[996,1,15551]),
[iquote('hyper,996,1,15551')] ).
cnf(18449,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(C,e_quivalent(A,B)))),
inference(hyper,[status(thm)],[18204,1,15551]),
[iquote('hyper,18204,1,15551')] ).
cnf(18450,plain,
$false,
inference(binary,[status(thm)],[18449,2]),
[iquote('binary,18449.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL015-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % 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.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jul 27 09:21:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 4.36/4.58 ----- Otter 3.3f, August 2004 -----
% 4.36/4.58 The process was started by sandbox2 on n019.cluster.edu,
% 4.36/4.58 Wed Jul 27 09:21:52 2022
% 4.36/4.58 The command was "./otter". The process ID is 2353.
% 4.36/4.58
% 4.36/4.58 set(prolog_style_variables).
% 4.36/4.58 set(auto).
% 4.36/4.58 dependent: set(auto1).
% 4.36/4.58 dependent: set(process_input).
% 4.36/4.58 dependent: clear(print_kept).
% 4.36/4.58 dependent: clear(print_new_demod).
% 4.36/4.58 dependent: clear(print_back_demod).
% 4.36/4.58 dependent: clear(print_back_sub).
% 4.36/4.58 dependent: set(control_memory).
% 4.36/4.58 dependent: assign(max_mem, 12000).
% 4.36/4.58 dependent: assign(pick_given_ratio, 4).
% 4.36/4.58 dependent: assign(stats_level, 1).
% 4.36/4.58 dependent: assign(max_seconds, 10800).
% 4.36/4.58 clear(print_given).
% 4.36/4.58
% 4.36/4.58 list(usable).
% 4.36/4.58 0 [] -is_a_theorem(e_quivalent(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 4.36/4.58 0 [] is_a_theorem(e_quivalent(e_quivalent(X,Y),e_quivalent(Z,e_quivalent(e_quivalent(Y,Z),X)))).
% 4.36/4.58 0 [] -is_a_theorem(e_quivalent(e_quivalent(a,e_quivalent(b,c)),e_quivalent(c,e_quivalent(a,b)))).
% 4.36/4.58 end_of_list.
% 4.36/4.58
% 4.36/4.58 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 4.36/4.58
% 4.36/4.58 This is a Horn set without equality. The strategy will
% 4.36/4.58 be hyperresolution, with satellites in sos and nuclei
% 4.36/4.58 in usable.
% 4.36/4.58
% 4.36/4.58 dependent: set(hyper_res).
% 4.36/4.58 dependent: clear(order_hyper).
% 4.36/4.58
% 4.36/4.58 ------------> process usable:
% 4.36/4.58 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(e_quivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 4.36/4.58 ** KEPT (pick-wt=12): 2 [] -is_a_theorem(e_quivalent(e_quivalent(a,e_quivalent(b,c)),e_quivalent(c,e_quivalent(a,b)))).
% 4.36/4.58
% 4.36/4.58 ------------> process sos:
% 4.36/4.58 ** KEPT (pick-wt=12): 3 [] is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(C,e_quivalent(e_quivalent(B,C),A)))).
% 4.36/4.58
% 4.36/4.58 ======= end of input processing =======
% 4.36/4.58
% 4.36/4.58 =========== start of search ===========
% 4.36/4.58
% 4.36/4.58
% 4.36/4.58 Resetting weight limit to 16.
% 4.36/4.58
% 4.36/4.58
% 4.36/4.58 Resetting weight limit to 16.
% 4.36/4.58
% 4.36/4.58 sos_size=5880
% 4.36/4.58
% 4.36/4.58 -------- PROOF --------
% 4.36/4.58
% 4.36/4.58 ----> UNIT CONFLICT at 2.72 sec ----> 18450 [binary,18449.1,2.1] $F.
% 4.36/4.58
% 4.36/4.58 Length of proof is 39. Level of proof is 24.
% 4.36/4.58
% 4.36/4.58 ---------------- PROOF ----------------
% 4.36/4.58 % SZS status Unsatisfiable
% 4.36/4.58 % SZS output start Refutation
% See solution above
% 4.36/4.58 ------------ end of proof -------------
% 4.36/4.58
% 4.36/4.58
% 4.36/4.58 Search stopped by max_proofs option.
% 4.36/4.58
% 4.36/4.58
% 4.36/4.58 Search stopped by max_proofs option.
% 4.36/4.58
% 4.36/4.58 ============ end of search ============
% 4.36/4.58
% 4.36/4.58 -------------- statistics -------------
% 4.36/4.58 clauses given 817
% 4.36/4.58 clauses generated 389808
% 4.36/4.58 clauses kept 18449
% 4.36/4.58 clauses forward subsumed 96050
% 4.36/4.58 clauses back subsumed 0
% 4.36/4.58 Kbytes malloced 8789
% 4.36/4.58
% 4.36/4.58 ----------- times (seconds) -----------
% 4.36/4.58 user CPU time 2.72 (0 hr, 0 min, 2 sec)
% 4.36/4.58 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 4.36/4.58 wall-clock time 4 (0 hr, 0 min, 4 sec)
% 4.36/4.58
% 4.36/4.58 That finishes the proof of the theorem.
% 4.36/4.58
% 4.36/4.58 Process 2353 finished Wed Jul 27 09:21:56 2022
% 4.36/4.58 Otter interrupted
% 4.36/4.58 PROOF FOUND
%------------------------------------------------------------------------------