TSTP Solution File: LCL011-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL011-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n006.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.39s 2.60s
% Output : Refutation 2.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of clauses : 20 ( 19 unt; 0 nHn; 3 RR)
% Number of literals : 22 ( 0 equ; 3 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 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 : 55 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(e_quivalent(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL011-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(e_quivalent(e_quivalent(a,b),e_quivalent(e_quivalent(a,c),e_quivalent(c,b)))),
file('LCL011-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(C,A),e_quivalent(B,C)))),
file('LCL011-1.p',unknown),
[] ).
cnf(4,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(e_quivalent(e_quivalent(D,B),e_quivalent(C,D)),A))),
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,C),e_quivalent(D,B))),e_quivalent(E,A)),e_quivalent(E,e_quivalent(C,D)))),
inference(hyper,[status(thm)],[4,1,4]),
[iquote('hyper,4,1,4')] ).
cnf(6,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,e_quivalent(C,D))),e_quivalent(e_quivalent(e_quivalent(e_quivalent(E,C),e_quivalent(D,E)),B),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(D,B),A)),e_quivalent(C,D))),
inference(hyper,[status(thm)],[4,1,3]),
[iquote('hyper,4,1,3')] ).
cnf(10,plain,
is_a_theorem(e_quivalent(A,e_quivalent(B,e_quivalent(A,B)))),
inference(hyper,[status(thm)],[7,1,4]),
[iquote('hyper,7,1,4')] ).
cnf(12,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(C,B),A)),C)),
inference(hyper,[status(thm)],[10,1,4]),
[iquote('hyper,10,1,4')] ).
cnf(34,plain,
is_a_theorem(e_quivalent(A,A)),
inference(hyper,[status(thm)],[12,1,4]),
[iquote('hyper,12,1,4')] ).
cnf(36,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,B),A))),
inference(hyper,[status(thm)],[34,1,10]),
[iquote('hyper,34,1,10')] ).
cnf(38,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(B,A))),
inference(hyper,[status(thm)],[34,1,3]),
[iquote('hyper,34,1,3')] ).
cnf(43,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(e_quivalent(C,C),B),A))),
inference(hyper,[status(thm)],[36,1,3]),
[iquote('hyper,36,1,3')] ).
cnf(60,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,A)),B)),
inference(hyper,[status(thm)],[38,1,10]),
[iquote('hyper,38,1,10')] ).
cnf(68,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(C,A)),e_quivalent(e_quivalent(e_quivalent(D,E),e_quivalent(F,D)),G)),e_quivalent(e_quivalent(B,C),e_quivalent(G,e_quivalent(E,F))))),
inference(hyper,[status(thm)],[6,1,6]),
[iquote('hyper,6,1,6')] ).
cnf(96,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,A),B))),
inference(hyper,[status(thm)],[60,1,5]),
[iquote('hyper,60,1,5')] ).
cnf(101,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),A),B)),
inference(hyper,[status(thm)],[96,1,38]),
[iquote('hyper,96,1,38')] ).
cnf(517,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,A),B),e_quivalent(e_quivalent(C,B),C))),
inference(hyper,[status(thm)],[43,1,101]),
[iquote('hyper,43,1,101')] ).
cnf(8417,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(A,C),e_quivalent(C,B)))),
inference(hyper,[status(thm)],[68,1,517]),
[iquote('hyper,68,1,517')] ).
cnf(8418,plain,
$false,
inference(binary,[status(thm)],[8417,2]),
[iquote('binary,8417.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL011-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n006.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 09:21:16 EDT 2022
% 0.13/0.33 % CPUTime :
% 2.39/2.60 ----- Otter 3.3f, August 2004 -----
% 2.39/2.60 The process was started by sandbox2 on n006.cluster.edu,
% 2.39/2.60 Wed Jul 27 09:21:17 2022
% 2.39/2.60 The command was "./otter". The process ID is 8373.
% 2.39/2.60
% 2.39/2.60 set(prolog_style_variables).
% 2.39/2.60 set(auto).
% 2.39/2.60 dependent: set(auto1).
% 2.39/2.60 dependent: set(process_input).
% 2.39/2.60 dependent: clear(print_kept).
% 2.39/2.60 dependent: clear(print_new_demod).
% 2.39/2.60 dependent: clear(print_back_demod).
% 2.39/2.60 dependent: clear(print_back_sub).
% 2.39/2.60 dependent: set(control_memory).
% 2.39/2.60 dependent: assign(max_mem, 12000).
% 2.39/2.60 dependent: assign(pick_given_ratio, 4).
% 2.39/2.60 dependent: assign(stats_level, 1).
% 2.39/2.60 dependent: assign(max_seconds, 10800).
% 2.39/2.60 clear(print_given).
% 2.39/2.60
% 2.39/2.60 list(usable).
% 2.39/2.60 0 [] -is_a_theorem(e_quivalent(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 2.39/2.60 0 [] is_a_theorem(e_quivalent(e_quivalent(X,Y),e_quivalent(e_quivalent(Z,X),e_quivalent(Y,Z)))).
% 2.39/2.60 0 [] -is_a_theorem(e_quivalent(e_quivalent(a,b),e_quivalent(e_quivalent(a,c),e_quivalent(c,b)))).
% 2.39/2.60 end_of_list.
% 2.39/2.60
% 2.39/2.60 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 2.39/2.60
% 2.39/2.60 This is a Horn set without equality. The strategy will
% 2.39/2.60 be hyperresolution, with satellites in sos and nuclei
% 2.39/2.60 in usable.
% 2.39/2.60
% 2.39/2.60 dependent: set(hyper_res).
% 2.39/2.60 dependent: clear(order_hyper).
% 2.39/2.60
% 2.39/2.60 ------------> process usable:
% 2.39/2.60 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(e_quivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 2.39/2.60 ** KEPT (pick-wt=12): 2 [] -is_a_theorem(e_quivalent(e_quivalent(a,b),e_quivalent(e_quivalent(a,c),e_quivalent(c,b)))).
% 2.39/2.60
% 2.39/2.60 ------------> process sos:
% 2.39/2.60 ** KEPT (pick-wt=12): 3 [] is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(C,A),e_quivalent(B,C)))).
% 2.39/2.60
% 2.39/2.60 ======= end of input processing =======
% 2.39/2.60
% 2.39/2.60 =========== start of search ===========
% 2.39/2.60
% 2.39/2.60
% 2.39/2.60 Resetting weight limit to 16.
% 2.39/2.60
% 2.39/2.60
% 2.39/2.60 Resetting weight limit to 16.
% 2.39/2.60
% 2.39/2.60 sos_size=7267
% 2.39/2.60
% 2.39/2.60 -------- PROOF --------
% 2.39/2.60
% 2.39/2.60 ----> UNIT CONFLICT at 0.56 sec ----> 8418 [binary,8417.1,2.1] $F.
% 2.39/2.60
% 2.39/2.60 Length of proof is 16. Level of proof is 11.
% 2.39/2.60
% 2.39/2.60 ---------------- PROOF ----------------
% 2.39/2.60 % SZS status Unsatisfiable
% 2.39/2.60 % SZS output start Refutation
% See solution above
% 2.39/2.60 ------------ end of proof -------------
% 2.39/2.60
% 2.39/2.60
% 2.39/2.60 Search stopped by max_proofs option.
% 2.39/2.60
% 2.39/2.60
% 2.39/2.60 Search stopped by max_proofs option.
% 2.39/2.60
% 2.39/2.60 ============ end of search ============
% 2.39/2.60
% 2.39/2.60 -------------- statistics -------------
% 2.39/2.60 clauses given 201
% 2.39/2.60 clauses generated 23915
% 2.39/2.60 clauses kept 8417
% 2.39/2.60 clauses forward subsumed 10829
% 2.39/2.60 clauses back subsumed 0
% 2.39/2.60 Kbytes malloced 4882
% 2.39/2.60
% 2.39/2.60 ----------- times (seconds) -----------
% 2.39/2.60 user CPU time 0.56 (0 hr, 0 min, 0 sec)
% 2.39/2.60 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.39/2.60 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.39/2.60
% 2.39/2.60 That finishes the proof of the theorem.
% 2.39/2.60
% 2.39/2.60 Process 8373 finished Wed Jul 27 09:21:19 2022
% 2.39/2.60 Otter interrupted
% 2.39/2.60 PROOF FOUND
%------------------------------------------------------------------------------