TSTP Solution File: COM002-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : COM002-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n020.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 12:48:20 EDT 2022
% Result : Unsatisfiable 1.92s 2.09s
% Output : Refutation 1.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of clauses : 16 ( 10 unt; 4 nHn; 12 RR)
% Number of literals : 24 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ fails(A,B)
| ~ follows(A,B) ),
file('COM002-2.p',unknown),
[] ).
cnf(2,axiom,
( ~ fails(A,B)
| fails(A,C)
| fails(C,B) ),
file('COM002-2.p',unknown),
[] ).
cnf(3,axiom,
( ~ fails(A,B)
| ~ has(B,goto(C))
| ~ labels(C,A) ),
file('COM002-2.p',unknown),
[] ).
cnf(8,axiom,
labels(loop,p3),
file('COM002-2.p',unknown),
[] ).
cnf(13,axiom,
follows(p6,p3),
file('COM002-2.p',unknown),
[] ).
cnf(15,axiom,
follows(p7,p6),
file('COM002-2.p',unknown),
[] ).
cnf(17,axiom,
follows(p8,p7),
file('COM002-2.p',unknown),
[] ).
cnf(18,axiom,
has(p8,goto(loop)),
file('COM002-2.p',unknown),
[] ).
cnf(19,axiom,
fails(p3,p3),
file('COM002-2.p',unknown),
[] ).
cnf(20,plain,
( fails(p3,A)
| fails(A,p3) ),
inference(hyper,[status(thm)],[19,2]),
[iquote('hyper,19,2')] ).
cnf(21,plain,
fails(p8,p3),
inference(hyper,[status(thm)],[20,3,18,8]),
[iquote('hyper,20,3,18,8')] ).
cnf(26,plain,
( fails(p8,A)
| fails(A,p3) ),
inference(hyper,[status(thm)],[21,2]),
[iquote('hyper,21,2')] ).
cnf(31,plain,
fails(p7,p3),
inference(hyper,[status(thm)],[26,1,17]),
[iquote('hyper,26,1,17')] ).
cnf(34,plain,
( fails(p7,A)
| fails(A,p3) ),
inference(hyper,[status(thm)],[31,2]),
[iquote('hyper,31,2')] ).
cnf(54,plain,
fails(p6,p3),
inference(hyper,[status(thm)],[34,1,15]),
[iquote('hyper,34,1,15')] ).
cnf(58,plain,
$false,
inference(hyper,[status(thm)],[54,1,13]),
[iquote('hyper,54,1,13')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : COM002-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n020.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 06:38:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.92/2.09 ----- Otter 3.3f, August 2004 -----
% 1.92/2.09 The process was started by sandbox2 on n020.cluster.edu,
% 1.92/2.09 Wed Jul 27 06:38:38 2022
% 1.92/2.09 The command was "./otter". The process ID is 7302.
% 1.92/2.09
% 1.92/2.09 set(prolog_style_variables).
% 1.92/2.09 set(auto).
% 1.92/2.09 dependent: set(auto1).
% 1.92/2.09 dependent: set(process_input).
% 1.92/2.09 dependent: clear(print_kept).
% 1.92/2.09 dependent: clear(print_new_demod).
% 1.92/2.09 dependent: clear(print_back_demod).
% 1.92/2.09 dependent: clear(print_back_sub).
% 1.92/2.09 dependent: set(control_memory).
% 1.92/2.09 dependent: assign(max_mem, 12000).
% 1.92/2.09 dependent: assign(pick_given_ratio, 4).
% 1.92/2.09 dependent: assign(stats_level, 1).
% 1.92/2.09 dependent: assign(max_seconds, 10800).
% 1.92/2.09 clear(print_given).
% 1.92/2.09
% 1.92/2.09 list(usable).
% 1.92/2.09 0 [] -fails(Goal_state,Start_state)| -follows(Goal_state,Start_state).
% 1.92/2.09 0 [] -fails(Goal_state,Start_state)|fails(Goal_state,Intermediate_state)|fails(Intermediate_state,Start_state).
% 1.92/2.09 0 [] -fails(Goal_state,Start_state)| -has(Start_state,goto(Label))| -labels(Label,Goal_state).
% 1.92/2.09 0 [] -fails(Goal_state,Start_state)| -has(Start_state,ifthen(Condition,Goal_state)).
% 1.92/2.09 0 [] has(p1,assign(register_j,n0)).
% 1.92/2.09 0 [] follows(p2,p1).
% 1.92/2.09 0 [] has(p2,assign(register_k,n1)).
% 1.92/2.09 0 [] labels(loop,p3).
% 1.92/2.09 0 [] follows(p3,p2).
% 1.92/2.09 0 [] has(p3,ifthen(e_qual_function(register_j,n),p4)).
% 1.92/2.09 0 [] has(p4,goto(out)).
% 1.92/2.09 0 [] follows(p5,p4).
% 1.92/2.09 0 [] follows(p6,p3).
% 1.92/2.09 0 [] has(p6,assign(register_k,times(n2,register_k))).
% 1.92/2.09 0 [] follows(p7,p6).
% 1.92/2.09 0 [] has(p7,assign(register_j,plus(register_j,n1))).
% 1.92/2.09 0 [] follows(p8,p7).
% 1.92/2.09 0 [] has(p8,goto(loop)).
% 1.92/2.09 0 [] fails(p3,p3).
% 1.92/2.09 end_of_list.
% 1.92/2.09
% 1.92/2.09 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.92/2.09
% 1.92/2.09 This is a non-Horn set without equality. The strategy will
% 1.92/2.09 be ordered hyper_res, unit deletion, and factoring, with
% 1.92/2.09 satellites in sos and with nuclei in usable.
% 1.92/2.09
% 1.92/2.09 dependent: set(hyper_res).
% 1.92/2.09 dependent: set(factor).
% 1.92/2.09 dependent: set(unit_deletion).
% 1.92/2.09
% 1.92/2.09 ------------> process usable:
% 1.92/2.09 ** KEPT (pick-wt=6): 1 [] -fails(A,B)| -follows(A,B).
% 1.92/2.09 ** KEPT (pick-wt=9): 2 [] -fails(A,B)|fails(A,C)|fails(C,B).
% 1.92/2.09 ** KEPT (pick-wt=10): 3 [] -fails(A,B)| -has(B,goto(C))| -labels(C,A).
% 1.92/2.09 ** KEPT (pick-wt=8): 4 [] -fails(A,B)| -has(B,ifthen(C,A)).
% 1.92/2.09
% 1.92/2.09 ------------> process sos:
% 1.92/2.09 ** KEPT (pick-wt=5): 5 [] has(p1,assign(register_j,n0)).
% 1.92/2.09 ** KEPT (pick-wt=3): 6 [] follows(p2,p1).
% 1.92/2.09 ** KEPT (pick-wt=5): 7 [] has(p2,assign(register_k,n1)).
% 1.92/2.09 ** KEPT (pick-wt=3): 8 [] labels(loop,p3).
% 1.92/2.09 ** KEPT (pick-wt=3): 9 [] follows(p3,p2).
% 1.92/2.09 ** KEPT (pick-wt=7): 10 [] has(p3,ifthen(e_qual_function(register_j,n),p4)).
% 1.92/2.09 ** KEPT (pick-wt=4): 11 [] has(p4,goto(out)).
% 1.92/2.09 ** KEPT (pick-wt=3): 12 [] follows(p5,p4).
% 1.92/2.09 ** KEPT (pick-wt=3): 13 [] follows(p6,p3).
% 1.92/2.09 ** KEPT (pick-wt=7): 14 [] has(p6,assign(register_k,times(n2,register_k))).
% 1.92/2.09 ** KEPT (pick-wt=3): 15 [] follows(p7,p6).
% 1.92/2.09 ** KEPT (pick-wt=7): 16 [] has(p7,assign(register_j,plus(register_j,n1))).
% 1.92/2.09 ** KEPT (pick-wt=3): 17 [] follows(p8,p7).
% 1.92/2.09 ** KEPT (pick-wt=4): 18 [] has(p8,goto(loop)).
% 1.92/2.09 ** KEPT (pick-wt=3): 19 [] fails(p3,p3).
% 1.92/2.09
% 1.92/2.09 ======= end of input processing =======
% 1.92/2.09
% 1.92/2.09 =========== start of search ===========
% 1.92/2.09
% 1.92/2.09 -------- PROOF --------
% 1.92/2.09
% 1.92/2.09 -----> EMPTY CLAUSE at 0.00 sec ----> 58 [hyper,54,1,13] $F.
% 1.92/2.09
% 1.92/2.09 Length of proof is 6. Level of proof is 6.
% 1.92/2.09
% 1.92/2.09 ---------------- PROOF ----------------
% 1.92/2.09 % SZS status Unsatisfiable
% 1.92/2.09 % SZS output start Refutation
% See solution above
% 1.92/2.09 ------------ end of proof -------------
% 1.92/2.09
% 1.92/2.09
% 1.92/2.09 Search stopped by max_proofs option.
% 1.92/2.09
% 1.92/2.09
% 1.92/2.09 Search stopped by max_proofs option.
% 1.92/2.09
% 1.92/2.09 ============ end of search ============
% 1.92/2.09
% 1.92/2.09 -------------- statistics -------------
% 1.92/2.09 clauses given 35
% 1.92/2.09 clauses generated 87
% 1.92/2.09 clauses kept 57
% 1.92/2.09 clauses forward subsumed 47
% 1.92/2.09 clauses back subsumed 2
% 1.92/2.09 Kbytes malloced 976
% 1.92/2.09
% 1.92/2.09 ----------- times (seconds) -----------
% 1.92/2.09 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.92/2.09 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.92/2.09 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.92/2.09
% 1.92/2.09 That finishes the proof of the theorem.
% 1.92/2.09
% 1.92/2.09 Process 7302 finished Wed Jul 27 06:38:40 2022
% 1.92/2.09 Otter interrupted
% 1.92/2.09 PROOF FOUND
%------------------------------------------------------------------------------