TSTP Solution File: COM002-1 by SNARK---20120808r022
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SNARK---20120808r022
% Problem : COM002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run-snark %s %d
% Computer : n015.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 : 600s
% DateTime : Fri Jul 15 01:42:05 EDT 2022
% Result : Unsatisfiable 0.20s 0.51s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 9
% Syntax : Number of clauses : 16 ( 13 unt; 0 nHn; 16 RR)
% Number of literals : 21 ( 0 equ; 7 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 : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(direct_success,axiom,
( succeeds(X,Y)
| ~ follows(X,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',direct_success) ).
cnf(transitivity_of_success,axiom,
( succeeds(X,Y)
| ~ succeeds(X,Z)
| ~ succeeds(Z,Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_success) ).
cnf(goto_success,axiom,
( succeeds(X,Y)
| ~ has(Y,goto(Z))
| ~ labels(Z,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goto_success) ).
cnf(label_state_3,hypothesis,
labels(loop,p3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',label_state_3) ).
cnf(transition_3_to_6,hypothesis,
follows(p6,p3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_3_to_6) ).
cnf(transition_6_to_7,hypothesis,
follows(p7,p6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_6_to_7) ).
cnf(transition_7_to_8,hypothesis,
follows(p8,p7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_7_to_8) ).
cnf(state_8,hypothesis,
has(p8,goto(loop)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',state_8) ).
cnf(prove_there_is_a_loop_through_p3,negated_conjecture,
~ succeeds(p3,p3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_there_is_a_loop_through_p3) ).
cnf(20,plain,
succeeds(p8,p7),
inference('HYPERRESOLVE',[status(thm)],[direct_success,transition_7_to_8]) ).
cnf(21,plain,
succeeds(p7,p6),
inference('HYPERRESOLVE',[status(thm)],[direct_success,transition_6_to_7]) ).
cnf(23,plain,
succeeds(p6,p3),
inference('HYPERRESOLVE',[status(thm)],[direct_success,transition_3_to_6]) ).
cnf(29,plain,
succeeds(p3,p8),
inference('HYPERRESOLVE',[status(thm)],[goto_success,state_8,label_state_3]) ).
cnf(31,plain,
succeeds(p8,p6),
inference('HYPERRESOLVE',[status(thm)],[transitivity_of_success,21,20]) ).
cnf(43,plain,
~ succeeds(p8,p3),
inference('UR-RESOLVE',[status(thm)],[transitivity_of_success,29,prove_there_is_a_loop_through_p3]) ).
cnf(44,plain,
$false,
inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[transitivity_of_success,31,23]),43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COM002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : run-snark %s %d
% 0.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Thu Jun 16 18:16:56 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.47 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.48 *
% 0.20/0.48 *
% 0.20/0.48 #<PACKAGE "SNARK-USER">
% 0.20/0.48 *
% 0.20/0.48 SNARK-TPTP-OPTIONS
% 0.20/0.48 *
% 0.20/0.48 ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48 (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48 (USE-FACTORING :POS)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48 (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48 (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48 (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48 (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48 (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48 (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48 (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48 (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48 (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48 *
% 0.20/0.48 "."
% 0.20/0.48 *
% 0.20/0.48 ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-16T18:16:56
% 0.20/0.48 ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n015.cluster.edu at 2022-06-16T18:16:56
% 0.20/0.51
% 0.20/0.51
% 0.20/0.51 #||
% 0.20/0.51 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.51 % SZS output start Refutation
% See solution above
% 0.20/0.52 ||#
% 0.20/0.52
% 0.20/0.52 ; Summary of computation:
% 0.20/0.52 ; 65 formulas have been input or derived (from 30 formulas).
% 0.20/0.52 ; 44 (68%) were retained. Of these,
% 0.20/0.52 ; 44 (100%) are still being kept.
% 0.20/0.52 ;
% 0.20/0.52 ; Run time in seconds excluding printing time:
% 0.20/0.52 ; 0.003 10% Read assertion file (1 call)
% 0.20/0.52 ; 0.000 0% Assert (19 calls)
% 0.20/0.52 ; 0.001 3% Process new row (57 calls)
% 0.20/0.52 ; 0.002 6% Resolution (58 calls)
% 0.20/0.52 ; 0.000 0% Paramodulation (29 calls)
% 0.20/0.52 ; 0.000 0% Condensing (4 calls)
% 0.20/0.52 ; 0.000 0% Forward subsumption (4 calls)
% 0.20/0.52 ; 0.000 0% Backward subsumption (4 calls)
% 0.20/0.52 ; 0.002 6% Forward simplification (57 calls)
% 0.20/0.52 ; 0.000 0% Backward simplification (44 calls)
% 0.20/0.52 ; 0.000 0% Sortal reasoning (32 calls)
% 0.20/0.52 ; 0.001 3% Purity testing (1 call)
% 0.20/0.52 ; 0.022 71% Other
% 0.20/0.52 ; 0.031 Total
% 0.20/0.52 ; 0.033 Real time
% 0.20/0.52 ;
% 0.20/0.52 ; Term-hash-array has 59 terms in all.
% 0.20/0.52 ; Feature-vector-row-index has 4 entries (4 at peak, 4 added, 0 deleted).
% 0.20/0.52 ; Feature-vector-row-index has 8 nodes (8 at peak, 8 added, 0 deleted).
% 0.20/0.52 ; Retrieved 0 possibly forward subsuming rows in 4 calls.
% 0.20/0.52 ; Retrieved 0 possibly backward subsumed rows in 4 calls.
% 0.20/0.52 ; Path-index has 75 entries (75 at peak, 75 added, 0 deleted).
% 0.20/0.52 ; Path-index has 152 nodes (152 at peak, 152 added, 0 deleted).
% 0.20/0.52 ; Trie-index has 75 entries (75 at peak, 75 added, 0 deleted).
% 0.20/0.52 ; Trie-index has 145 nodes (145 at peak, 145 added, 0 deleted).
% 0.20/0.52 ; Retrieved 14 generalization terms in 49 calls.
% 0.20/0.52 ; Retrieved 39 instance terms in 39 calls.
% 0.20/0.52 ; Retrieved 290 unifiable terms in 221 calls.
% 0.20/0.52 ;
% 0.20/0.52 ; The agenda of rows to process has 3 entries:
% 0.20/0.52 ; 3 with value 7
% 0.20/0.52 ; The agenda of rows to give has 14 entries:
% 0.20/0.52 ; 12 with value (4 6) 1 with value (4 7) 1 with value (4 8)
% 0.20/0.52 Evaluation took:
% 0.20/0.52 0.033 seconds of real time
% 0.20/0.52 0.025865 seconds of user run time
% 0.20/0.52 0.006876 seconds of system run time
% 0.20/0.52 0 calls to %EVAL
% 0.20/0.52 0 page faults and
% 0.20/0.52 2,215,152 bytes consed.
% 0.20/0.52 :PROOF-FOUND
% 0.20/0.52 ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-16T18:16:56
% 0.20/0.52 :PROOF-FOUND
% 0.20/0.52 *
%------------------------------------------------------------------------------