TSTP Solution File: COM001-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : COM001-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n008.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:19 EDT 2022
% Result : Unsatisfiable 1.69s 1.89s
% Output : Refutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of clauses : 11 ( 8 unt; 0 nHn; 11 RR)
% Number of literals : 16 ( 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 : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( succeeds(A,B)
| ~ follows(A,B) ),
file('COM001-1.p',unknown),
[] ).
cnf(2,axiom,
( succeeds(A,B)
| ~ succeeds(A,C)
| ~ succeeds(C,B) ),
file('COM001-1.p',unknown),
[] ).
cnf(3,axiom,
( succeeds(A,B)
| ~ has(B,goto(C))
| ~ labels(C,A) ),
file('COM001-1.p',unknown),
[] ).
cnf(5,axiom,
~ succeeds(p3,p3),
file('COM001-1.p',unknown),
[] ).
cnf(6,axiom,
labels(loop,p3),
file('COM001-1.p',unknown),
[] ).
cnf(10,axiom,
follows(p8,p3),
file('COM001-1.p',unknown),
[] ).
cnf(11,axiom,
has(p8,goto(loop)),
file('COM001-1.p',unknown),
[] ).
cnf(13,plain,
succeeds(p8,p3),
inference(hyper,[status(thm)],[10,1]),
[iquote('hyper,10,1')] ).
cnf(16,plain,
succeeds(p3,p8),
inference(hyper,[status(thm)],[11,3,6]),
[iquote('hyper,11,3,6')] ).
cnf(20,plain,
succeeds(p3,p3),
inference(hyper,[status(thm)],[16,2,13]),
[iquote('hyper,16,2,13')] ).
cnf(21,plain,
$false,
inference(binary,[status(thm)],[20,5]),
[iquote('binary,20.1,5.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM001-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n008.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:37:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.69/1.89 ----- Otter 3.3f, August 2004 -----
% 1.69/1.89 The process was started by sandbox on n008.cluster.edu,
% 1.69/1.89 Wed Jul 27 06:37:23 2022
% 1.69/1.89 The command was "./otter". The process ID is 27704.
% 1.69/1.89
% 1.69/1.89 set(prolog_style_variables).
% 1.69/1.89 set(auto).
% 1.69/1.89 dependent: set(auto1).
% 1.69/1.89 dependent: set(process_input).
% 1.69/1.89 dependent: clear(print_kept).
% 1.69/1.89 dependent: clear(print_new_demod).
% 1.69/1.89 dependent: clear(print_back_demod).
% 1.69/1.89 dependent: clear(print_back_sub).
% 1.69/1.89 dependent: set(control_memory).
% 1.69/1.89 dependent: assign(max_mem, 12000).
% 1.69/1.89 dependent: assign(pick_given_ratio, 4).
% 1.69/1.89 dependent: assign(stats_level, 1).
% 1.69/1.89 dependent: assign(max_seconds, 10800).
% 1.69/1.89 clear(print_given).
% 1.69/1.89
% 1.69/1.89 list(usable).
% 1.69/1.89 0 [] succeeds(Goal_state,Start_state)| -follows(Goal_state,Start_state).
% 1.69/1.89 0 [] succeeds(Goal_state,Start_state)| -succeeds(Goal_state,Intermediate_state)| -succeeds(Intermediate_state,Start_state).
% 1.69/1.89 0 [] succeeds(Goal_state,Start_state)| -has(Start_state,goto(Label))| -labels(Label,Goal_state).
% 1.69/1.89 0 [] succeeds(Goal_state,Start_state)| -has(Start_state,ifthen(Condition,Goal_state)).
% 1.69/1.89 0 [] labels(loop,p3).
% 1.69/1.89 0 [] has(p3,ifthen(e_qual_function(register_j,n),p4)).
% 1.69/1.89 0 [] has(p4,goto(out)).
% 1.69/1.89 0 [] follows(p5,p4).
% 1.69/1.89 0 [] follows(p8,p3).
% 1.69/1.89 0 [] has(p8,goto(loop)).
% 1.69/1.89 0 [] -succeeds(p3,p3).
% 1.69/1.89 end_of_list.
% 1.69/1.89
% 1.69/1.89 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.69/1.89
% 1.69/1.89 This is a Horn set without equality. The strategy will
% 1.69/1.89 be hyperresolution, with satellites in sos and nuclei
% 1.69/1.89 in usable.
% 1.69/1.89
% 1.69/1.89 dependent: set(hyper_res).
% 1.69/1.89 dependent: clear(order_hyper).
% 1.69/1.89
% 1.69/1.89 ------------> process usable:
% 1.69/1.89 ** KEPT (pick-wt=6): 1 [] succeeds(A,B)| -follows(A,B).
% 1.69/1.89 ** KEPT (pick-wt=9): 2 [] succeeds(A,B)| -succeeds(A,C)| -succeeds(C,B).
% 1.69/1.89 ** KEPT (pick-wt=10): 3 [] succeeds(A,B)| -has(B,goto(C))| -labels(C,A).
% 1.69/1.89 ** KEPT (pick-wt=8): 4 [] succeeds(A,B)| -has(B,ifthen(C,A)).
% 1.69/1.89 ** KEPT (pick-wt=3): 5 [] -succeeds(p3,p3).
% 1.69/1.89
% 1.69/1.89 ------------> process sos:
% 1.69/1.89 ** KEPT (pick-wt=3): 6 [] labels(loop,p3).
% 1.69/1.89 ** KEPT (pick-wt=7): 7 [] has(p3,ifthen(e_qual_function(register_j,n),p4)).
% 1.69/1.89 ** KEPT (pick-wt=4): 8 [] has(p4,goto(out)).
% 1.69/1.89 ** KEPT (pick-wt=3): 9 [] follows(p5,p4).
% 1.69/1.89 ** KEPT (pick-wt=3): 10 [] follows(p8,p3).
% 1.69/1.89 ** KEPT (pick-wt=4): 11 [] has(p8,goto(loop)).
% 1.69/1.89
% 1.69/1.89 ======= end of input processing =======
% 1.69/1.89
% 1.69/1.89 =========== start of search ===========
% 1.69/1.89
% 1.69/1.89 -------- PROOF --------
% 1.69/1.89
% 1.69/1.89 ----> UNIT CONFLICT at 0.00 sec ----> 21 [binary,20.1,5.1] $F.
% 1.69/1.89
% 1.69/1.89 Length of proof is 3. Level of proof is 2.
% 1.69/1.89
% 1.69/1.89 ---------------- PROOF ----------------
% 1.69/1.89 % SZS status Unsatisfiable
% 1.69/1.89 % SZS output start Refutation
% See solution above
% 1.69/1.89 ------------ end of proof -------------
% 1.69/1.89
% 1.69/1.89
% 1.69/1.89 Search stopped by max_proofs option.
% 1.69/1.89
% 1.69/1.89
% 1.69/1.89 Search stopped by max_proofs option.
% 1.69/1.89
% 1.69/1.89 ============ end of search ============
% 1.69/1.89
% 1.69/1.89 -------------- statistics -------------
% 1.69/1.89 clauses given 11
% 1.69/1.89 clauses generated 9
% 1.69/1.89 clauses kept 20
% 1.69/1.89 clauses forward subsumed 0
% 1.69/1.89 clauses back subsumed 0
% 1.69/1.89 Kbytes malloced 976
% 1.69/1.89
% 1.69/1.89 ----------- times (seconds) -----------
% 1.69/1.89 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.69/1.89 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.69/1.89 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.69/1.89
% 1.69/1.89 That finishes the proof of the theorem.
% 1.69/1.89
% 1.69/1.89 Process 27704 finished Wed Jul 27 06:37:25 2022
% 1.69/1.89 Otter interrupted
% 1.69/1.89 PROOF FOUND
%------------------------------------------------------------------------------