TSTP Solution File: GRA003+1 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : GRA003+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n019.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 : Sat Jul 16 07:21:53 EDT 2022

% Result   : Theorem 0.21s 0.55s
% Output   : Refutation 0.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   27 (  13 unt;   1 nHn;  27 RR)
%            Number of literals    :   60 (  10 equ;  36 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   32 (  15 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(6,axiom,
    ( ~ path(X,Y,Z)
    | vertex(X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',path_properties) ).

cnf(7,axiom,
    ( ~ path(X,Y,Z)
    | vertex(Y) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',path_properties) ).

cnf(15,axiom,
    ( ~ path(X,Y,Z)
    | ~ on_path(U,Z)
    | edge(U) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',on_path_properties) ).

cnf(28,axiom,
    ( ~ path(X,Y,Z)
    | ~ precedes(U,V,Z)
    | on_path(U,Z) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',precedes_properties) ).

cnf(29,axiom,
    ( ~ path(X,Y,Z)
    | ~ precedes(U,V,Z)
    | on_path(V,Z) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',precedes_properties) ).

cnf(33,axiom,
    ( ~ shortest_path(X,Y,Z)
    | path(X,Y,Z) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',shortest_path_defn) ).

cnf(34,axiom,
    ( ~ shortest_path(X,Y,Z)
    | X != Y ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',shortest_path_defn) ).

cnf(39,axiom,
    ( ~ shortest_path(X,Y,Z)
    | ~ precedes(U,V,Z)
    | ~ precedes(V,U,Z) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRA001+0.ax',shortest_path_properties) ).

cnf(54,negated_conjecture,
    shortest_path('SKOLEMAAAV9','SKOLEMAAAV10','SKOLEMAAAV13'),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',vertices_and_edges) ).

cnf(55,negated_conjecture,
    precedes('SKOLEMAAAV11','SKOLEMAAAV12','SKOLEMAAAV13'),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',vertices_and_edges) ).

cnf(56,negated_conjecture,
    ( ~ vertex('SKOLEMAAAV9')
    | ~ vertex('SKOLEMAAAV10')
    | 'SKOLEMAAAV9' = 'SKOLEMAAAV10'
    | ~ edge('SKOLEMAAAV11')
    | ~ edge('SKOLEMAAAV12')
    | 'SKOLEMAAAV11' = 'SKOLEMAAAV12'
    | ~ path('SKOLEMAAAV9','SKOLEMAAAV10','SKOLEMAAAV13') ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',vertices_and_edges) ).

cnf(58,plain,
    'SKOLEMAAAV9' != 'SKOLEMAAAV10',
    inference('UR-RESOLVE',[status(thm)],[34,54]) ).

cnf(59,plain,
    ( ~ vertex('SKOLEMAAAV9')
    | ~ vertex('SKOLEMAAAV10')
    | ~ edge('SKOLEMAAAV11')
    | ~ edge('SKOLEMAAAV12')
    | 'SKOLEMAAAV11' = 'SKOLEMAAAV12'
    | ~ path('SKOLEMAAAV9','SKOLEMAAAV10','SKOLEMAAAV13') ),
    inference('REWRITE',[status(thm)],[56,58]) ).

cnf(61,plain,
    path('SKOLEMAAAV9','SKOLEMAAAV10','SKOLEMAAAV13'),
    inference('HYPERRESOLVE',[status(thm)],[33,54]) ).

cnf(62,plain,
    ( ~ vertex('SKOLEMAAAV9')
    | ~ vertex('SKOLEMAAAV10')
    | ~ edge('SKOLEMAAAV11')
    | ~ edge('SKOLEMAAAV12')
    | 'SKOLEMAAAV11' = 'SKOLEMAAAV12' ),
    inference('REWRITE',[status(thm)],[59,61]) ).

cnf(63,plain,
    ~ precedes(X,X,'SKOLEMAAAV13'),
    inference('UR-RESOLVE',[status(thm)],[39,54]) ).

cnf(70,plain,
    vertex('SKOLEMAAAV10'),
    inference('HYPERRESOLVE',[status(thm)],[7,61]) ).

cnf(71,plain,
    ( ~ vertex('SKOLEMAAAV9')
    | ~ edge('SKOLEMAAAV11')
    | ~ edge('SKOLEMAAAV12')
    | 'SKOLEMAAAV11' = 'SKOLEMAAAV12' ),
    inference('REWRITE',[status(thm)],[62,70]) ).

cnf(72,plain,
    vertex('SKOLEMAAAV9'),
    inference('HYPERRESOLVE',[status(thm)],[6,61]) ).

cnf(73,plain,
    ( ~ edge('SKOLEMAAAV11')
    | ~ edge('SKOLEMAAAV12')
    | 'SKOLEMAAAV11' = 'SKOLEMAAAV12' ),
    inference('REWRITE',[status(thm)],[71,72]) ).

cnf(74,plain,
    on_path('SKOLEMAAAV12','SKOLEMAAAV13'),
    inference('HYPERRESOLVE',[status(thm)],[29,61,55]) ).

cnf(75,plain,
    on_path('SKOLEMAAAV11','SKOLEMAAAV13'),
    inference('HYPERRESOLVE',[status(thm)],[28,61,55]) ).

cnf(90,plain,
    edge('SKOLEMAAAV12'),
    inference('HYPERRESOLVE',[status(thm)],[15,74,61]) ).

cnf(91,plain,
    ( ~ edge('SKOLEMAAAV11')
    | 'SKOLEMAAAV11' = 'SKOLEMAAAV12' ),
    inference('REWRITE',[status(thm)],[73,90]) ).

cnf(95,plain,
    edge('SKOLEMAAAV11'),
    inference('HYPERRESOLVE',[status(thm)],[15,75,61]) ).

cnf(96,plain,
    'SKOLEMAAAV11' = 'SKOLEMAAAV12',
    inference('REWRITE',[status(thm)],[91,95]) ).

cnf(97,plain,
    $false,
    inference('REWRITE',[status(thm)],[55,63,96,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : GRA003+1 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.14/0.14  % Command  : run-snark %s %d
% 0.14/0.35  % Computer : n019.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Tue May 31 02:31:41 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.48  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.49  * 
% 0.21/0.49  * 
% 0.21/0.49  #<PACKAGE "SNARK-USER">
% 0.21/0.49  * 
% 0.21/0.49  SNARK-TPTP-OPTIONS
% 0.21/0.49  * 
% 0.21/0.49  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.50   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.50   (USE-FACTORING :POS)
% 0.21/0.50   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.50   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.50   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.50   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.50   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.50   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.50   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.50   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.50   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.50   (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.50  * 
% 0.21/0.50  "."
% 0.21/0.50  * 
% 0.21/0.50  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-31T02:31:41
% 0.21/0.50  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n019.cluster.edu at 2022-05-31T02:31:41
% 0.21/0.52  WARNING:
% 0.21/0.52     #:|complete| is a proposition that occurs only negatively; disabling rows that contain it.
% 0.21/0.55  
% 0.21/0.55  
% 0.21/0.55  #||
% 0.21/0.55  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.55  % SZS output start Refutation
% See solution above
% 0.39/0.55  ||#
% 0.39/0.55  
% 0.39/0.55  ; Summary of computation:
% 0.39/0.55  ;       140 formulas have been input or derived (from 69 formulas).
% 0.39/0.55  ;        97 (69%) were retained.  Of these,
% 0.39/0.55  ;           17 (18%) were simplified or subsumed later,
% 0.39/0.55  ;           80 (82%) are still being kept.
% 0.39/0.55  ; 
% 0.39/0.55  ; Run time in seconds excluding printing time:
% 0.39/0.55  ;     0.008  15%   Read assertion file          (1 call)
% 0.39/0.55  ;     0.002   4%   Assert                       (18 calls)
% 0.39/0.55  ;     0.006  11%   Process new row              (116 calls)
% 0.39/0.55  ;     0.005   9%   Resolution                   (136 calls)
% 0.39/0.55  ;     0.000   0%   Paramodulation               (68 calls)
% 0.39/0.55  ;     0.003   5%   Condensing                   (67 calls)
% 0.39/0.55  ;     0.001   2%   Forward subsumption          (67 calls)
% 0.39/0.55  ;     0.001   2%   Backward subsumption         (67 calls)
% 0.39/0.55  ;     0.000   0%   Clause clause subsumption    (25 calls)
% 0.39/0.55  ;     0.004   7%   Forward simplification       (110 calls)
% 0.39/0.55  ;     0.001   2%   Backward simplification      (97 calls)
% 0.39/0.55  ;     0.000   0%   Ordering                     (32 calls)
% 0.39/0.55  ;     0.001   2%   Sortal reasoning             (32 calls)
% 0.39/0.55  ;     0.001   2%   Purity testing               (1 call)
% 0.39/0.55  ;     0.022  40%   Other
% 0.39/0.55  ;     0.055        Total
% 0.39/0.55  ;     0.059        Real time
% 0.39/0.55  ; 
% 0.39/0.56  ; Term-hash-array has 150 terms in all.
% 0.39/0.56  ; Feature-vector-row-index has 59 entries (62 at peak, 67 added, 8 deleted).
% 0.39/0.56  ; Feature-vector-row-index has 308 nodes (338 at peak, 398 added, 90 deleted).
% 0.39/0.56  ;  Retrieved 16 possibly forward subsuming rows in 67 calls.
% 0.39/0.56  ;  Retrieved 9 possibly backward subsumed rows in 67 calls.
% 0.39/0.56  ; Path-index has 144 entries (161 at peak, 182 added, 38 deleted).
% 0.39/0.56  ; Path-index has 396 nodes (426 at peak, 455 added, 59 deleted).
% 0.39/0.56  ; Trie-index has 144 entries (161 at peak, 182 added, 38 deleted).
% 0.39/0.56  ; Trie-index has 355 nodes (394 at peak, 423 added, 68 deleted).
% 0.39/0.56  ; Retrieved 28 generalization terms in 68 calls.
% 0.39/0.56  ; Retrieved 48 instance terms in 29 calls.
% 0.39/0.56  ; Retrieved 2,529 unifiable terms in 625 calls.
% 0.39/0.56  ; 
% 0.39/0.56  ; The agenda of backward simplifiable rows to process has 10 entries:
% 0.39/0.56  ;    10 with value 0
% 0.39/0.56  ; The agenda of rows to process has 7 entries:
% 0.39/0.56  ;     3 with value 7               4 with value 9
% 0.39/0.56  ; The agenda of input rows to give has 1 entry:
% 0.39/0.56  ;     1 with value 4
% 0.39/0.56  ; The agenda of rows to give has 16 entries:
% 0.39/0.56  ;     1 with value (4 6)           1 with value (4 12)           1 with value (4 20)
% 0.39/0.56  ;     3 with value (4 7)           1 with value (4 13)           2 with value (4 26)
% 0.39/0.56  ;     2 with value (4 9)           2 with value (4 19)           2 with value (4 27)
% 0.39/0.56  ;     1 with value (4 10)
% 0.39/0.56  Evaluation took:
% 0.39/0.56    0.059 seconds of real time
% 0.39/0.56    0.047454 seconds of user run time
% 0.39/0.56    0.012156 seconds of system run time
% 0.39/0.56    0 calls to %EVAL
% 0.39/0.56    0 page faults and
% 0.39/0.56    4,446,360 bytes consed.
% 0.39/0.56  :PROOF-FOUND
% 0.39/0.56  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-05-31T02:31:41
% 0.39/0.56  :PROOF-FOUND
% 0.39/0.56  * 
%------------------------------------------------------------------------------