TSTP Solution File: LCL014-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL014-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n024.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 2.74s 2.91s
% Output : Refutation 2.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of clauses : 27 ( 26 unt; 0 nHn; 3 RR)
% Number of literals : 29 ( 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; 3 con; 0-2 aty)
% Number of variables : 74 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(e_quivalent(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL014-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(e_quivalent(a,e_quivalent(e_quivalent(b,e_quivalent(a,c)),e_quivalent(c,b)))),
file('LCL014-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(C,e_quivalent(A,B)))),
file('LCL014-1.p',unknown),
[] ).
cnf(4,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(A,e_quivalent(B,C)),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,B),e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(B,C)),C),D)),D)),
inference(hyper,[status(thm)],[4,1,4]),
[iquote('hyper,4,1,4')] ).
cnf(6,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(B,e_quivalent(C,A))))),
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,e_quivalent(B,C)),e_quivalent(e_quivalent(C,e_quivalent(A,B)),D)),D)),
inference(hyper,[status(thm)],[4,1,3]),
[iquote('hyper,4,1,3')] ).
cnf(9,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(B,C),e_quivalent(B,e_quivalent(C,A))),D)),D)),
inference(hyper,[status(thm)],[6,1,4]),
[iquote('hyper,6,1,4')] ).
cnf(13,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(B,C)),C),D)),e_quivalent(D,E)),E)),
inference(hyper,[status(thm)],[5,1,4]),
[iquote('hyper,5,1,4')] ).
cnf(16,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(e_quivalent(C,e_quivalent(A,B)),D)),e_quivalent(D,E)),E)),
inference(hyper,[status(thm)],[7,1,4]),
[iquote('hyper,7,1,4')] ).
cnf(31,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,A),B))),
inference(hyper,[status(thm)],[9,1,4]),
[iquote('hyper,9,1,4')] ).
cnf(32,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,e_quivalent(e_quivalent(C,B),C))),A)),
inference(hyper,[status(thm)],[31,1,31]),
[iquote('hyper,31,1,31')] ).
cnf(35,plain,
is_a_theorem(e_quivalent(A,e_quivalent(B,e_quivalent(A,B)))),
inference(hyper,[status(thm)],[31,1,5]),
[iquote('hyper,31,1,5')] ).
cnf(88,plain,
is_a_theorem(e_quivalent(A,A)),
inference(hyper,[status(thm)],[32,1,35]),
[iquote('hyper,32,1,35')] ).
cnf(97,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(A,B)),B)),
inference(hyper,[status(thm)],[88,1,4]),
[iquote('hyper,88,1,4')] ).
cnf(156,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,e_quivalent(B,C)),C)),A)),
inference(hyper,[status(thm)],[97,1,31]),
[iquote('hyper,97,1,31')] ).
cnf(348,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,e_quivalent(B,C)),C),e_quivalent(A,B))),
inference(hyper,[status(thm)],[13,1,88]),
[iquote('hyper,13,1,88')] ).
cnf(769,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(B,e_quivalent(C,A)))),
inference(hyper,[status(thm)],[16,1,88]),
[iquote('hyper,16,1,88')] ).
cnf(2215,plain,
is_a_theorem(e_quivalent(A,e_quivalent(B,e_quivalent(B,A)))),
inference(hyper,[status(thm)],[348,1,156]),
[iquote('hyper,348,1,156')] ).
cnf(2253,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(B,A))),
inference(hyper,[status(thm)],[2215,1,3]),
[iquote('hyper,2215,1,3')] ).
cnf(2544,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(B,A),C)),C)),
inference(hyper,[status(thm)],[2253,1,4]),
[iquote('hyper,2253,1,4')] ).
cnf(4040,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(C,e_quivalent(A,B))))),
inference(hyper,[status(thm)],[769,1,769]),
[iquote('hyper,769,1,769')] ).
cnf(7116,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(e_quivalent(C,B),A)))),
inference(hyper,[status(thm)],[2544,1,2253]),
[iquote('hyper,2544,1,2253')] ).
cnf(7763,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(B,e_quivalent(C,A))),C)),
inference(hyper,[status(thm)],[4040,1,2253]),
[iquote('hyper,4040,1,2253')] ).
cnf(8349,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(C,e_quivalent(B,A)))),
inference(hyper,[status(thm)],[7116,1,3]),
[iquote('hyper,7116,1,3')] ).
cnf(12117,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,e_quivalent(A,C)),e_quivalent(C,B)))),
inference(hyper,[status(thm)],[8349,1,7763]),
[iquote('hyper,8349,1,7763')] ).
cnf(12118,plain,
$false,
inference(binary,[status(thm)],[12117,2]),
[iquote('binary,12117.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL014-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n024.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:20:40 EDT 2022
% 0.12/0.34 % CPUTime :
% 2.74/2.91 ----- Otter 3.3f, August 2004 -----
% 2.74/2.91 The process was started by sandbox2 on n024.cluster.edu,
% 2.74/2.91 Wed Jul 27 09:20:40 2022
% 2.74/2.91 The command was "./otter". The process ID is 27054.
% 2.74/2.91
% 2.74/2.91 set(prolog_style_variables).
% 2.74/2.91 set(auto).
% 2.74/2.91 dependent: set(auto1).
% 2.74/2.91 dependent: set(process_input).
% 2.74/2.91 dependent: clear(print_kept).
% 2.74/2.91 dependent: clear(print_new_demod).
% 2.74/2.91 dependent: clear(print_back_demod).
% 2.74/2.91 dependent: clear(print_back_sub).
% 2.74/2.91 dependent: set(control_memory).
% 2.74/2.91 dependent: assign(max_mem, 12000).
% 2.74/2.91 dependent: assign(pick_given_ratio, 4).
% 2.74/2.91 dependent: assign(stats_level, 1).
% 2.74/2.91 dependent: assign(max_seconds, 10800).
% 2.74/2.91 clear(print_given).
% 2.74/2.91
% 2.74/2.91 list(usable).
% 2.74/2.91 0 [] -is_a_theorem(e_quivalent(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 2.74/2.91 0 [] is_a_theorem(e_quivalent(e_quivalent(X,e_quivalent(Y,Z)),e_quivalent(Z,e_quivalent(X,Y)))).
% 2.74/2.91 0 [] -is_a_theorem(e_quivalent(a,e_quivalent(e_quivalent(b,e_quivalent(a,c)),e_quivalent(c,b)))).
% 2.74/2.91 end_of_list.
% 2.74/2.91
% 2.74/2.91 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 2.74/2.91
% 2.74/2.91 This is a Horn set without equality. The strategy will
% 2.74/2.91 be hyperresolution, with satellites in sos and nuclei
% 2.74/2.91 in usable.
% 2.74/2.91
% 2.74/2.91 dependent: set(hyper_res).
% 2.74/2.91 dependent: clear(order_hyper).
% 2.74/2.91
% 2.74/2.91 ------------> process usable:
% 2.74/2.91 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(e_quivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 2.74/2.91 ** KEPT (pick-wt=12): 2 [] -is_a_theorem(e_quivalent(a,e_quivalent(e_quivalent(b,e_quivalent(a,c)),e_quivalent(c,b)))).
% 2.74/2.91
% 2.74/2.91 ------------> process sos:
% 2.74/2.91 ** KEPT (pick-wt=12): 3 [] is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(C,e_quivalent(A,B)))).
% 2.74/2.91
% 2.74/2.91 ======= end of input processing =======
% 2.74/2.91
% 2.74/2.91 =========== start of search ===========
% 2.74/2.91
% 2.74/2.91
% 2.74/2.91 Resetting weight limit to 16.
% 2.74/2.91
% 2.74/2.91
% 2.74/2.91 Resetting weight limit to 16.
% 2.74/2.91
% 2.74/2.91 sos_size=6570
% 2.74/2.91
% 2.74/2.91 -------- PROOF --------
% 2.74/2.91
% 2.74/2.91 ----> UNIT CONFLICT at 1.11 sec ----> 12118 [binary,12117.1,2.1] $F.
% 2.74/2.91
% 2.74/2.91 Length of proof is 23. Level of proof is 14.
% 2.74/2.91
% 2.74/2.91 ---------------- PROOF ----------------
% 2.74/2.91 % SZS status Unsatisfiable
% 2.74/2.91 % SZS output start Refutation
% See solution above
% 2.74/2.91 ------------ end of proof -------------
% 2.74/2.91
% 2.74/2.91
% 2.74/2.91 Search stopped by max_proofs option.
% 2.74/2.91
% 2.74/2.91
% 2.74/2.91 Search stopped by max_proofs option.
% 2.74/2.91
% 2.74/2.91 ============ end of search ============
% 2.74/2.91
% 2.74/2.91 -------------- statistics -------------
% 2.74/2.91 clauses given 408
% 2.74/2.91 clauses generated 107902
% 2.74/2.91 clauses kept 12117
% 2.74/2.91 clauses forward subsumed 33361
% 2.74/2.91 clauses back subsumed 7
% 2.74/2.91 Kbytes malloced 6835
% 2.74/2.91
% 2.74/2.91 ----------- times (seconds) -----------
% 2.74/2.91 user CPU time 1.11 (0 hr, 0 min, 1 sec)
% 2.74/2.91 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.74/2.91 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.74/2.91
% 2.74/2.91 That finishes the proof of the theorem.
% 2.74/2.91
% 2.74/2.91 Process 27054 finished Wed Jul 27 09:20:42 2022
% 2.74/2.91 Otter interrupted
% 2.74/2.91 PROOF FOUND
%------------------------------------------------------------------------------