TSTP Solution File: COM002_1 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : COM002_1 : TPTP v8.1.0. Released v5.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% 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  : 600s
% DateTime : Fri Jul 15 01:42:05 EDT 2022

% Result   : Theorem 0.20s 0.50s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   16 (  13 unt;   0 typ;   0 def)
%            Number of atoms       :   47 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   12 (   7   ~;   5   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :   26 (  26 fml;   0 var)
%            Number of types       :    0 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   13 (  12 usr;   8 prp; 0-2 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    8 (   0 sgn   8   !;   0   ?;   8   :)

% Comments : 
%------------------------------------------------------------------------------
tff(1,axiom,
    ! [X: state,Y: state] :
      ( ~ follows(X,Y)
      | succeeds(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',direct_success) ).

tff(2,axiom,
    ! [X: state,Y: state,Z: state] :
      ( ~ succeeds(X,Y)
      | ~ succeeds(Y,Z)
      | succeeds(X,Z) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_success) ).

tff(3,axiom,
    ! [X: state,Y: label,Z: state] :
      ( ~ has(X,goto(Y))
      | ~ labels(Y,Z)
      | succeeds(Z,X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goto_success) ).

tff(8,hypothesis,
    labels(loop,p3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',label_state_3) ).

tff(13,hypothesis,
    follows(p6,p3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_3_to_6) ).

tff(15,hypothesis,
    follows(p7,p6),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_6_to_7) ).

tff(17,hypothesis,
    follows(p8,p7),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transition_7_to_8) ).

tff(18,hypothesis,
    has(p8,goto(loop)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',state_8) ).

tff(19,negated_conjecture,
    ~ succeeds(p3,p3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_there_is_a_loop_through_p3) ).

tff(20,plain,
    succeeds(p8,p7),
    inference('HYPERRESOLVE',[status(thm)],[1,17]) ).

tff(21,plain,
    succeeds(p7,p6),
    inference('HYPERRESOLVE',[status(thm)],[1,15]) ).

tff(23,plain,
    succeeds(p6,p3),
    inference('HYPERRESOLVE',[status(thm)],[1,13]) ).

tff(29,plain,
    succeeds(p3,p8),
    inference('HYPERRESOLVE',[status(thm)],[3,18,8]) ).

tff(31,plain,
    succeeds(p8,p6),
    inference('HYPERRESOLVE',[status(thm)],[2,21,20]) ).

tff(43,plain,
    ~ succeeds(p8,p3),
    inference('UR-RESOLVE',[status(thm)],[2,29,19]) ).

cnf(44,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[2,31,23]),43]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : COM002_1 : TPTP v8.1.0. Released v5.0.0.
% 0.11/0.13  % Command  : run-snark %s %d
% 0.14/0.34  % Computer : n020.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Thu Jun 16 18:05:49 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.45  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46  * 
% 0.20/0.46  * 
% 0.20/0.46  #<PACKAGE "SNARK-USER">
% 0.20/0.46  * 
% 0.20/0.46  SNARK-TPTP-OPTIONS
% 0.20/0.46  * 
% 0.20/0.46  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.46   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.46   (USE-FACTORING :POS)
% 0.20/0.46   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.46   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.46   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.46   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.46   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.46   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.46   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.46   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.46   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.46   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.46  * 
% 0.20/0.46  "."
% 0.20/0.46  * 
% 0.20/0.46  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T18:05:49
% 0.20/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n020.cluster.edu at 2022-06-16T18:05:49
% 0.20/0.50  
% 0.20/0.50  
% 0.20/0.50  #||
% 0.20/0.50  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.50  % SZS output start Refutation
% See solution above
% 0.20/0.50  ||#
% 0.20/0.50  
% 0.20/0.50  ; Summary of computation:
% 0.20/0.50  ;        65 formulas have been input or derived (from 30 formulas).
% 0.20/0.50  ;        44 (68%) were retained.  Of these,
% 0.20/0.50  ;           44 (100%) are still being kept.
% 0.20/0.50  ; 
% 0.20/0.50  ; Run time in seconds excluding printing time:
% 0.20/0.50  ;     0.006  18%   Read assertion file          (1 call)
% 0.20/0.50  ;     0.001   3%   Assert                       (19 calls)
% 0.20/0.50  ;     0.001   3%   Process new row              (58 calls)
% 0.20/0.50  ;     0.000   0%   Resolution                   (58 calls)
% 0.20/0.50  ;     0.002   6%   Paramodulation               (29 calls)
% 0.20/0.50  ;     0.000   0%   Condensing                   (4 calls)
% 0.20/0.50  ;     0.000   0%   Forward subsumption          (4 calls)
% 0.20/0.50  ;     0.000   0%   Backward subsumption         (4 calls)
% 0.20/0.50  ;     0.002   6%   Forward simplification       (58 calls)
% 0.20/0.50  ;     0.000   0%   Backward simplification      (44 calls)
% 0.20/0.50  ;     0.000   0%   Sortal reasoning             (38 calls)
% 0.20/0.50  ;     0.000   0%   Purity testing               (1 call)
% 0.20/0.50  ;     0.021  64%   Other
% 0.20/0.50  ;     0.033        Total
% 0.20/0.50  ;     0.036        Real time
% 0.20/0.50  ; 
% 0.20/0.50  ; Term-hash-array has 60 terms in all.
% 0.20/0.50  ; Feature-vector-row-index has 4 entries (4 at peak, 4 added, 0 deleted).
% 0.20/0.50  ; Feature-vector-row-index has 10 nodes (10 at peak, 10 added, 0 deleted).
% 0.20/0.50  ;  Retrieved 0 possibly forward subsuming rows in 4 calls.
% 0.20/0.50  ;  Retrieved 0 possibly backward subsumed rows in 4 calls.
% 0.20/0.50  ; Path-index has 76 entries (76 at peak, 76 added, 0 deleted).
% 0.20/0.50  ; Path-index has 152 nodes (152 at peak, 152 added, 0 deleted).
% 0.20/0.50  ; Trie-index has 76 entries (76 at peak, 76 added, 0 deleted).
% 0.20/0.50  ; Trie-index has 145 nodes (145 at peak, 145 added, 0 deleted).
% 0.20/0.50  ; Retrieved 15 generalization terms in 50 calls.
% 0.20/0.50  ; Retrieved 39 instance terms in 39 calls.
% 0.20/0.50  ; Retrieved 417 unifiable terms in 234 calls.
% 0.20/0.50  ; 
% 0.20/0.50  ; The agenda of rows to process has 3 entries:
% 0.20/0.50  ;     3 with value 7
% 0.20/0.50  ; The agenda of rows to give has 14 entries:
% 0.20/0.50  ;    12 with value (4 6)           1 with value (4 7)            1 with value (4 8)
% 0.20/0.50  Evaluation took:
% 0.20/0.50    0.036 seconds of real time
% 0.20/0.50    0.031091 seconds of user run time
% 0.20/0.50    0.00495 seconds of system run time
% 0.20/0.50    0 calls to %EVAL
% 0.20/0.50    0 page faults and
% 0.20/0.50    2,391,280 bytes consed.
% 0.20/0.50  :PROOF-FOUND
% 0.20/0.50  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-16T18:05:49
% 0.20/0.50  :PROOF-FOUND
% 0.20/0.50  * 
%------------------------------------------------------------------------------