TSTP Solution File: GRA002+3 by SNARK---20120808r022

View Problem - Process Solution

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

% Computer : n027.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 9.93s 10.19s
% Output   : Refutation 9.93s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   22 (   8 unt;   8 nHn;  21 RR)
%            Number of literals    :   48 (  12 equ;  19 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   2 prp; 0-3 aty)
%            Number of functors    :   13 (  13 usr;   7 con; 0-2 aty)
%            Number of variables   :   36 (  18 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(32,axiom,
    ( ~ path(X,Y,Z)
    | precedes(U,V,Z)
    | ~ on_path(U,Z)
    | ~ on_path(V,Z)
    | ~ sequential(U,V) ),
    file('/export/starexec/sandbox/benchmark/Axioms/GRA001+0.ax',precedes_defn) ).

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

cnf(54,axiom,
    ( ~ path(X,Y,Z)
    | number_of_in(sequential_pairs,Z) = minus(length_of(Z),n1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',path_length_sequential_pairs) ).

cnf(55,axiom,
    ( ~ path(X,Y,Z)
    | on_path('SKOLEMAAAR7'(Z),Z)
    | number_of_in(sequential_pairs,Z) = number_of_in(triangles,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sequential_pairs_and_triangles) ).

cnf(56,axiom,
    ( ~ path(X,Y,Z)
    | on_path('SKOLEMAAAR8'(Z),Z)
    | number_of_in(sequential_pairs,Z) = number_of_in(triangles,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sequential_pairs_and_triangles) ).

cnf(57,axiom,
    ( ~ path(X,Y,Z)
    | sequential('SKOLEMAAAR7'(Z),'SKOLEMAAAR8'(Z))
    | number_of_in(sequential_pairs,Z) = number_of_in(triangles,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sequential_pairs_and_triangles) ).

cnf(58,axiom,
    ( ~ path(X,Y,Z)
    | ~ triangle('SKOLEMAAAR7'(Z),'SKOLEMAAAR8'(Z),U)
    | number_of_in(sequential_pairs,Z) = number_of_in(triangles,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sequential_pairs_and_triangles) ).

cnf(59,axiom,
    less_or_equal(number_of_in(X,Y),number_of_in(X,graph)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',graph_has_them_all) ).

cnf(60,axiom,
    ( ~ complete
    | ~ shortest_path(X,Y,Z)
    | ~ precedes(U,V,Z)
    | ~ sequential(U,V)
    | triangle(U,V,'SKOLEMAAAR9'(U,V)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sequential_is_triangle) ).

cnf(61,negated_conjecture,
    complete,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',maximal_path_length) ).

cnf(62,negated_conjecture,
    shortest_path('SKOLEMAAAR11','SKOLEMAAAR12','SKOLEMAAAR10'),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',maximal_path_length) ).

cnf(63,negated_conjecture,
    ~ less_or_equal(minus(length_of('SKOLEMAAAR10'),n1),number_of_in(triangles,graph)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',maximal_path_length) ).

cnf(70,plain,
    ( ~ shortest_path(X,Y,Z)
    | ~ precedes(U,V,Z)
    | ~ sequential(U,V)
    | triangle(U,V,'SKOLEMAAAR9'(U,V)) ),
    inference('REWRITE',[status(thm)],[60,61]) ).

cnf(74,plain,
    path('SKOLEMAAAR11','SKOLEMAAAR12','SKOLEMAAAR10'),
    inference('HYPERRESOLVE',[status(thm)],[39,62]) ).

cnf(85,plain,
    number_of_in(sequential_pairs,'SKOLEMAAAR10') = minus(length_of('SKOLEMAAAR10'),n1),
    inference('HYPERRESOLVE',[status(thm)],[54,74]) ).

cnf(86,plain,
    ( on_path('SKOLEMAAAR8'('SKOLEMAAAR10'),'SKOLEMAAAR10')
    | minus(length_of('SKOLEMAAAR10'),n1) = number_of_in(triangles,'SKOLEMAAAR10') ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[56,74]),85,theory(equality)]) ).

cnf(87,plain,
    ( on_path('SKOLEMAAAR7'('SKOLEMAAAR10'),'SKOLEMAAAR10')
    | minus(length_of('SKOLEMAAAR10'),n1) = number_of_in(triangles,'SKOLEMAAAR10') ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[55,74]),85,theory(equality)]) ).

cnf(88,plain,
    ( sequential('SKOLEMAAAR7'('SKOLEMAAAR10'),'SKOLEMAAAR8'('SKOLEMAAAR10'))
    | minus(length_of('SKOLEMAAAR10'),n1) = number_of_in(triangles,'SKOLEMAAAR10') ),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[57,74]),85,theory(equality)]) ).

cnf(691,plain,
    ( minus(length_of('SKOLEMAAAR10'),n1) = number_of_in(triangles,'SKOLEMAAAR10')
    | precedes('SKOLEMAAAR7'('SKOLEMAAAR10'),'SKOLEMAAAR8'('SKOLEMAAAR10'),'SKOLEMAAAR10') ),
    inference('HYPERRESOLVE',[status(thm)],[32,88,74,87,86]) ).

cnf(2807,plain,
    ( minus(length_of('SKOLEMAAAR10'),n1) = number_of_in(triangles,'SKOLEMAAAR10')
    | triangle('SKOLEMAAAR7'('SKOLEMAAAR10'),'SKOLEMAAAR8'('SKOLEMAAAR10'),'SKOLEMAAAR9'('SKOLEMAAAR7'('SKOLEMAAAR10'),'SKOLEMAAAR8'('SKOLEMAAAR10'))) ),
    inference('HYPERRESOLVE',[status(thm)],[70,691,62,88]) ).

cnf(3207,plain,
    minus(length_of('SKOLEMAAAR10'),n1) = number_of_in(triangles,'SKOLEMAAAR10'),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[58,2807,74]),85,theory(equality)]) ).

cnf(3208,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[59,3207,theory(equality)]),63]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : GRA002+3 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.00/0.10  % Command  : run-snark %s %d
% 0.09/0.30  % Computer : n027.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit : 300
% 0.09/0.30  % WCLimit  : 600
% 0.09/0.30  % DateTime : Tue May 31 03:09:02 EDT 2022
% 0.09/0.30  % CPUTime  : 
% 0.16/0.39  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/0.40  * 
% 0.16/0.40  * 
% 0.16/0.41  #<PACKAGE "SNARK-USER">
% 0.16/0.41  * 
% 0.16/0.41  SNARK-TPTP-OPTIONS
% 0.16/0.41  * 
% 0.16/0.41  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.16/0.41   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.16/0.41   (USE-FACTORING :POS)
% 0.16/0.41   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.16/0.41   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.16/0.41   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.16/0.41   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.16/0.41   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.16/0.41   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.16/0.41   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.16/0.41   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.16/0.41   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.16/0.41   (DECLARE-TPTP-SYMBOLS2))
% 0.16/0.41  * 
% 0.16/0.41  "."
% 0.16/0.41  * 
% 0.16/0.41  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-31T03:09:02
% 0.16/0.41  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n027.cluster.edu at 2022-05-31T03:09:02
% 9.93/10.19  
% 9.93/10.19  
% 9.93/10.19  #||
% 9.93/10.19  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.93/10.19  % SZS output start Refutation
% See solution above
% 9.93/10.19  ||#
% 9.93/10.19  
% 9.93/10.19  ; Summary of computation:
% 9.93/10.19  ;      4884 formulas have been input or derived (from 214 formulas).
% 9.93/10.19  ;      3208 (66%) were retained.  Of these,
% 9.93/10.19  ;          913 (28%) were simplified or subsumed later,
% 9.93/10.19  ;         2295 (72%) are still being kept.
% 9.93/10.19  ; 
% 9.93/10.19  ; Run time in seconds excluding printing time:
% 9.93/10.19  ;     0.007   0%   Read assertion file          (1 call)
% 9.93/10.19  ;     0.002   0%   Assert                       (19 calls)
% 9.93/10.19  ;     1.104  11%   Process new row              (4,729 calls)
% 9.93/10.19  ;     5.440  56%   Resolution                   (426 calls)
% 9.93/10.19  ;     0.022   0%   Paramodulation               (213 calls)
% 9.93/10.19  ;     0.001   0%   Factoring                    (76 calls)
% 9.93/10.19  ;     0.010   0%   Condensing                   (3,263 calls)
% 9.93/10.19  ;     1.664  17%   Forward subsumption          (3,263 calls)
% 9.93/10.19  ;     0.491   5%   Backward subsumption         (3,103 calls)
% 9.93/10.19  ;     0.371   4%   Clause clause subsumption    (63,949 calls)
% 9.93/10.19  ;     0.346   4%   Forward simplification       (4,726 calls)
% 9.93/10.19  ;     0.176   2%   Backward simplification      (3,208 calls)
% 9.93/10.19  ;     0.065   1%   Ordering                     (10,014 calls)
% 9.93/10.19  ;     0.000   0%   Sortal reasoning             (32 calls)
% 9.93/10.19  ;     0.000   0%   Purity testing               (1 call)
% 9.93/10.19  ;     0.060   1%   Other
% 9.93/10.19  ;     9.759        Total
% 9.93/10.19  ;     9.785        Real time
% 9.93/10.19  ; 
% 9.93/10.20  ; Term-hash-array has 5,257 terms in all.
% 9.93/10.20  ; Feature-vector-row-index has 2,190 entries (3,094 at peak, 3,103 added, 913 deleted).
% 9.93/10.20  ; Feature-vector-row-index has 5,610 nodes (8,998 at peak, 9,058 added, 3,448 deleted).
% 9.93/10.20  ;  Retrieved 43,125 possibly forward subsuming rows in 3,263 calls.
% 9.93/10.20  ;  Retrieved 21,008 possibly backward subsumed rows in 3,103 calls.
% 9.93/10.20  ; Path-index has 3,736 entries (5,267 at peak, 5,283 added, 1,547 deleted).
% 9.93/10.20  ; Path-index has 4,104 nodes (4,255 at peak, 4,274 added, 170 deleted).
% 9.93/10.20  ; Trie-index has 3,736 entries (5,267 at peak, 5,283 added, 1,547 deleted).
% 9.93/10.20  ; Trie-index has 26,228 nodes (33,330 at peak, 33,410 added, 7,182 deleted).
% 9.93/10.20  ; Retrieved 569 generalization terms in 22,630 calls.
% 9.93/10.20  ; Retrieved 125 instance terms in 104 calls.
% 9.93/10.20  ; Retrieved 4,197,517 unifiable terms in 193,857 calls.
% 9.93/10.20  ; 
% 9.93/10.20  ; The agenda of rows to process has 3 entries:
% 9.93/10.20  ;     3 with value 18
% 9.93/10.20  ; The agenda of rows to give has 2105 entries:
% 9.93/10.20  ;    20 with value (4 28)          2 with value (4 54)          48 with value (4 84)
% 9.93/10.20  ;    39 with value (4 29)        104 with value (4 57)           2 with value (4 85)
% 9.93/10.20  ;    15 with value (4 30)          2 with value (4 58)          32 with value (4 86)
% 9.93/10.20  ;    11 with value (4 31)          8 with value (4 59)          40 with value (4 87)
% 9.93/10.20  ;    15 with value (4 32)          8 with value (4 60)          16 with value (4 88)
% 9.93/10.20  ;     8 with value (4 33)         80 with value (4 61)         128 with value (4 89)
% 9.93/10.20  ;     8 with value (4 34)          9 with value (4 62)          36 with value (4 93)
% 9.93/10.20  ;     8 with value (4 35)          3 with value (4 63)          72 with value (4 95)
% 9.93/10.20  ;     9 with value (4 36)          3 with value (4 64)          32 with value (4 96)
% 9.93/10.20  ;     5 with value (4 37)         10 with value (4 65)          16 with value (4 98)
% 9.93/10.20  ;    20 with value (4 38)          2 with value (4 66)           2 with value (4 100)
% 9.93/10.20  ;    17 with value (4 39)          1 with value (4 67)          64 with value (4 103)
% 9.93/10.20  ;     3 with value (4 40)         67 with value (4 68)         144 with value (4 105)
% 9.93/10.20  ;    20 with value (4 42)         20 with value (4 69)           2 with value (4 106)
% 9.93/10.20  ;    40 with value (4 43)         10 with value (4 70)          64 with value (4 107)
% 9.93/10.20  ;    43 with value (4 44)          9 with value (4 71)           4 with value (4 109)
% 9.93/10.20  ;    49 with value (4 45)         12 with value (4 72)         192 with value (4 113)
% 9.93/10.20  ;    11 with value (4 46)         10 with value (4 73)          16 with value (4 115)
% 9.93/10.20  ;    10 with value (4 47)         16 with value (4 74)           2 with value (4 118)
% 9.93/10.20  ;    28 with value (4 48)         16 with value (4 75)          16 with value (4 121)
% 9.93/10.20  ;    65 with value (4 49)         32 with value (4 76)          16 with value (4 125)
% 9.93/10.20  ;     6 with value (4 50)         64 with value (4 77)           8 with value (4 127)
% 9.93/10.20  ;    18 with value (4 51)         66 with value (4 80)          32 with value (4 129)
% 9.93/10.20  ;    10 with value (4 52)          8 with value (4 81)          16 with value (4 133)
% 9.93/10.20  ;     1 with value (4 53)         64 with value (4 83)
% 9.93/10.20  Evaluation took:
% 9.93/10.20    9.787 seconds of real time
% 9.93/10.20    9.441562 seconds of user run time
% 9.93/10.20    0.322852 seconds of system run time
% 9.93/10.20    [Run times include 0.537 seconds GC run time.]
% 9.93/10.20    0 calls to %EVAL
% 9.93/10.20    0 page faults and
% 9.93/10.20    381,989,120 bytes consed.
% 9.93/10.20  :PROOF-FOUND
% 9.93/10.20  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-05-31T03:09:12
% 9.93/10.20  :PROOF-FOUND
% 9.93/10.20  * 
%------------------------------------------------------------------------------