TSTP Solution File: LCL103-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL103-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n018.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:33 EDT 2022
% Result : Unsatisfiable 3.01s 3.22s
% Output : Refutation 3.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of clauses : 21 ( 20 unt; 0 nHn; 3 RR)
% Number of literals : 23 ( 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ is_a_theorem(e_quivalent(A,B))
| ~ is_a_theorem(A)
| is_a_theorem(B) ),
file('LCL103-1.p',unknown),
[] ).
cnf(2,axiom,
~ is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(a,b),e_quivalent(a,c)),e_quivalent(b,c)),e),e)),
file('LCL103-1.p',unknown),
[] ).
cnf(3,axiom,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(e_quivalent(D,B),e_quivalent(e_quivalent(A,D),C)))),
file('LCL103-1.p',unknown),
[] ).
cnf(4,axiom,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(B,A),C)),C)),
file('LCL103-1.p',unknown),
[] ).
cnf(6,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,C),D)),e_quivalent(e_quivalent(e_quivalent(C,B),A),D))),
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(A,e_quivalent(e_quivalent(C,B),D))),D)),
inference(hyper,[status(thm)],[6,1,6]),
[iquote('hyper,6,1,6')] ).
cnf(12,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,e_quivalent(e_quivalent(C,D),E))),e_quivalent(e_quivalent(e_quivalent(B,e_quivalent(D,C)),A),E))),
inference(hyper,[status(thm)],[7,1,3]),
[iquote('hyper,7,1,3')] ).
cnf(13,plain,
is_a_theorem(e_quivalent(A,A)),
inference(hyper,[status(thm)],[7,1,3]),
[iquote('hyper,7,1,3')] ).
cnf(14,plain,
is_a_theorem(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(C,A),e_quivalent(C,B)))),
inference(hyper,[status(thm)],[13,1,3]),
[iquote('hyper,13,1,3')] ).
cnf(22,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,C)),e_quivalent(A,e_quivalent(e_quivalent(D,B),e_quivalent(D,C))))),
inference(hyper,[status(thm)],[14,1,14]),
[iquote('hyper,14,1,14')] ).
cnf(23,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(A,C)),e_quivalent(B,C))),
inference(hyper,[status(thm)],[14,1,6]),
[iquote('hyper,14,1,6')] ).
cnf(27,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(B,e_quivalent(e_quivalent(C,D),E))),e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(D,C),B),E)))),
inference(hyper,[status(thm)],[14,1,6]),
[iquote('hyper,14,1,6')] ).
cnf(30,plain,
is_a_theorem(e_quivalent(e_quivalent(A,e_quivalent(e_quivalent(B,C),D)),e_quivalent(A,e_quivalent(e_quivalent(E,C),e_quivalent(e_quivalent(B,E),D))))),
inference(hyper,[status(thm)],[14,1,3]),
[iquote('hyper,14,1,3')] ).
cnf(36,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,B),A))),
inference(hyper,[status(thm)],[23,1,3]),
[iquote('hyper,23,1,3')] ).
cnf(405,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,e_quivalent(C,C)),e_quivalent(B,A)))),
inference(hyper,[status(thm)],[22,1,36]),
[iquote('hyper,22,1,36')] ).
cnf(430,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,A),B),C),e_quivalent(B,C))),
inference(hyper,[status(thm)],[405,1,6]),
[iquote('hyper,405,1,6')] ).
cnf(645,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(e_quivalent(C,B),A)))),
inference(hyper,[status(thm)],[430,1,3]),
[iquote('hyper,430,1,3')] ).
cnf(2947,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(B,C),e_quivalent(e_quivalent(D,B),e_quivalent(e_quivalent(C,D),A))))),
inference(hyper,[status(thm)],[30,1,645]),
[iquote('hyper,30,1,645')] ).
cnf(8661,plain,
is_a_theorem(e_quivalent(A,e_quivalent(e_quivalent(e_quivalent(B,C),e_quivalent(B,D)),e_quivalent(e_quivalent(D,C),A)))),
inference(hyper,[status(thm)],[2947,1,27]),
[iquote('hyper,2947,1,27')] ).
cnf(10153,plain,
is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(A,C)),e_quivalent(B,C)),D),D)),
inference(hyper,[status(thm)],[8661,1,12]),
[iquote('hyper,8661,1,12')] ).
cnf(10154,plain,
$false,
inference(binary,[status(thm)],[10153,2]),
[iquote('binary,10153.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL103-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n018.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:23:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 3.01/3.22 ----- Otter 3.3f, August 2004 -----
% 3.01/3.22 The process was started by sandbox2 on n018.cluster.edu,
% 3.01/3.22 Wed Jul 27 09:23:01 2022
% 3.01/3.22 The command was "./otter". The process ID is 18323.
% 3.01/3.22
% 3.01/3.22 set(prolog_style_variables).
% 3.01/3.22 set(auto).
% 3.01/3.22 dependent: set(auto1).
% 3.01/3.22 dependent: set(process_input).
% 3.01/3.22 dependent: clear(print_kept).
% 3.01/3.22 dependent: clear(print_new_demod).
% 3.01/3.22 dependent: clear(print_back_demod).
% 3.01/3.22 dependent: clear(print_back_sub).
% 3.01/3.22 dependent: set(control_memory).
% 3.01/3.22 dependent: assign(max_mem, 12000).
% 3.01/3.22 dependent: assign(pick_given_ratio, 4).
% 3.01/3.22 dependent: assign(stats_level, 1).
% 3.01/3.22 dependent: assign(max_seconds, 10800).
% 3.01/3.22 clear(print_given).
% 3.01/3.22
% 3.01/3.22 list(usable).
% 3.01/3.22 0 [] -is_a_theorem(e_quivalent(X,Y))| -is_a_theorem(X)|is_a_theorem(Y).
% 3.01/3.22 0 [] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(X,Y),Z),e_quivalent(e_quivalent(U,Y),e_quivalent(e_quivalent(X,U),Z)))).
% 3.01/3.22 0 [] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(X,Y),e_quivalent(e_quivalent(Y,X),Z)),Z)).
% 3.01/3.22 0 [] -is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(a,b),e_quivalent(a,c)),e_quivalent(b,c)),e),e)).
% 3.01/3.22 end_of_list.
% 3.01/3.22
% 3.01/3.22 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 3.01/3.22
% 3.01/3.22 This is a Horn set without equality. The strategy will
% 3.01/3.22 be hyperresolution, with satellites in sos and nuclei
% 3.01/3.22 in usable.
% 3.01/3.22
% 3.01/3.22 dependent: set(hyper_res).
% 3.01/3.22 dependent: clear(order_hyper).
% 3.01/3.22
% 3.01/3.22 ------------> process usable:
% 3.01/3.22 ** KEPT (pick-wt=8): 1 [] -is_a_theorem(e_quivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 3.01/3.22 ** KEPT (pick-wt=16): 2 [] -is_a_theorem(e_quivalent(e_quivalent(e_quivalent(e_quivalent(e_quivalent(a,b),e_quivalent(a,c)),e_quivalent(b,c)),e),e)).
% 3.01/3.22
% 3.01/3.22 ------------> process sos:
% 3.01/3.22 ** KEPT (pick-wt=16): 3 [] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),C),e_quivalent(e_quivalent(D,B),e_quivalent(e_quivalent(A,D),C)))).
% 3.01/3.22 ** KEPT (pick-wt=12): 4 [] is_a_theorem(e_quivalent(e_quivalent(e_quivalent(A,B),e_quivalent(e_quivalent(B,A),C)),C)).
% 3.01/3.22
% 3.01/3.22 ======= end of input processing =======
% 3.01/3.22
% 3.01/3.22 =========== start of search ===========
% 3.01/3.22
% 3.01/3.22
% 3.01/3.22 Resetting weight limit to 20.
% 3.01/3.22
% 3.01/3.22
% 3.01/3.22 Resetting weight limit to 20.
% 3.01/3.22
% 3.01/3.22 sos_size=6017
% 3.01/3.22
% 3.01/3.22 -------- PROOF --------
% 3.01/3.22
% 3.01/3.22 ----> UNIT CONFLICT at 1.34 sec ----> 10154 [binary,10153.1,2.1] $F.
% 3.01/3.22
% 3.01/3.22 Length of proof is 16. Level of proof is 12.
% 3.01/3.22
% 3.01/3.22 ---------------- PROOF ----------------
% 3.01/3.22 % SZS status Unsatisfiable
% 3.01/3.22 % SZS output start Refutation
% See solution above
% 3.01/3.22 ------------ end of proof -------------
% 3.01/3.22
% 3.01/3.22
% 3.01/3.22 Search stopped by max_proofs option.
% 3.01/3.22
% 3.01/3.22
% 3.01/3.22 Search stopped by max_proofs option.
% 3.01/3.22
% 3.01/3.22 ============ end of search ============
% 3.01/3.22
% 3.01/3.22 -------------- statistics -------------
% 3.01/3.22 clauses given 538
% 3.01/3.22 clauses generated 192871
% 3.01/3.22 clauses kept 10153
% 3.01/3.22 clauses forward subsumed 89986
% 3.01/3.22 clauses back subsumed 1
% 3.01/3.22 Kbytes malloced 6835
% 3.01/3.22
% 3.01/3.22 ----------- times (seconds) -----------
% 3.01/3.22 user CPU time 1.34 (0 hr, 0 min, 1 sec)
% 3.01/3.22 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 3.01/3.22 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 3.01/3.22
% 3.01/3.22 That finishes the proof of the theorem.
% 3.01/3.22
% 3.01/3.22 Process 18323 finished Wed Jul 27 09:23:04 2022
% 3.01/3.22 Otter interrupted
% 3.01/3.22 PROOF FOUND
%------------------------------------------------------------------------------