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

View Problem - Process Solution

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

% Computer : n022.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 : Tue Jul 19 05:11:10 EDT 2022

% Result   : Theorem 0.49s 0.67s
% Output   : Refutation 0.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   25 (   5 unt;  12 nHn;  15 RR)
%            Number of literals    :   48 (   6 equ;  16 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   37 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    ( ~ member(X,intersection(Y,Z))
    | member(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn) ).

cnf(2,axiom,
    ( member(X,intersection(Y,Z))
    | ~ member(X,Y)
    | ~ member(X,Z) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn) ).

cnf(3,axiom,
    ( ~ intersect(X,Y)
    | member('SKOLEMAAAV1'(X,Y),X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersect_defn) ).

cnf(4,axiom,
    ( ~ intersect(X,Y)
    | member('SKOLEMAAAV1'(X,Y),Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersect_defn) ).

cnf(5,axiom,
    ( intersect(X,Y)
    | ~ member(Z,X)
    | ~ member(Z,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersect_defn) ).

cnf(6,axiom,
    ~ member(X,empty_set),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_set_defn) ).

cnf(7,axiom,
    ( ~ disjoint(X,Y)
    | ~ intersect(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',disjoint_defn) ).

cnf(8,axiom,
    ( disjoint(X,Y)
    | intersect(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',disjoint_defn) ).

cnf(15,axiom,
    ( ~ empty(X)
    | ~ member(Y,X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_defn) ).

cnf(16,axiom,
    ( empty(X)
    | member('SKOLEMAAAV3'(X),X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_defn) ).

cnf(19,axiom,
    ( X = Y
    | member('SKOLEMAAAV4'(X,Y),X)
    | member('SKOLEMAAAV4'(X,Y),Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_member_defn) ).

cnf(20,negated_conjecture,
    ( ~ disjoint('SKOLEMAAAV5','SKOLEMAAAV6')
    | intersection('SKOLEMAAAV5','SKOLEMAAAV6') != empty_set ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th118) ).

cnf(21,negated_conjecture,
    ( disjoint('SKOLEMAAAV5','SKOLEMAAAV6')
    | intersection('SKOLEMAAAV5','SKOLEMAAAV6') = empty_set ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th118) ).

cnf(24,plain,
    ( empty(intersection(X,Y))
    | member('SKOLEMAAAV3'(intersection(X,Y)),X) ),
    inference('HYPERRESOLVE',[status(thm)],[1,16]) ).

cnf(25,plain,
    ~ intersect(empty_set,X),
    inference('UR-RESOLVE',[status(thm)],[3,6]) ).

cnf(26,plain,
    ( disjoint(X,Y)
    | member('SKOLEMAAAV1'(X,Y),X) ),
    inference('HYPERRESOLVE',[status(thm)],[3,8]) ).

cnf(28,plain,
    ( disjoint(X,Y)
    | member('SKOLEMAAAV1'(X,Y),Y) ),
    inference('HYPERRESOLVE',[status(thm)],[4,8]) ).

cnf(36,plain,
    ( empty_set = X
    | member('SKOLEMAAAV4'(empty_set,X),X) ),
    inference('HYPERRESOLVE',[status(thm)],[6,19]) ).

cnf(64,plain,
    ( disjoint(X,Y)
    | member('SKOLEMAAAV1'(X,Y),intersection(X,Y)) ),
    inference('HYPERRESOLVE',[status(thm)],[2,28,26]) ).

cnf(136,plain,
    ( disjoint(X,Y)
    | intersect(intersection(X,Y),Y) ),
    inference('HYPERRESOLVE',[status(thm)],[5,64,28]) ).

cnf(187,plain,
    ( empty(intersection(X,Y))
    | intersect(X,Y) ),
    inference('HYPERRESOLVE',[status(thm)],[5,24,24]) ).

cnf(196,plain,
    ( empty(intersection('SKOLEMAAAV5','SKOLEMAAAV6'))
    | intersection('SKOLEMAAAV5','SKOLEMAAAV6') = empty_set ),
    inference('HYPERRESOLVE',[status(thm)],[7,187,21]) ).

cnf(246,plain,
    intersection('SKOLEMAAAV5','SKOLEMAAAV6') = empty_set,
    inference('HYPERRESOLVE',[status(thm)],[15,196,36]) ).

cnf(247,plain,
    ~ disjoint('SKOLEMAAAV5','SKOLEMAAAV6'),
    inference('REWRITE',[status(thm)],[20,246,theory(equality)]) ).

cnf(255,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[136,247]),25,246,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET636+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n022.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jul 11 04:14:25 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.46  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47  * 
% 0.19/0.47  * 
% 0.19/0.48  #<PACKAGE "SNARK-USER">
% 0.19/0.48  * 
% 0.19/0.48  SNARK-TPTP-OPTIONS
% 0.19/0.48  * 
% 0.19/0.48  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.48   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.48   (USE-FACTORING :POS)
% 0.19/0.48   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.48   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.48   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.48   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.48   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.48   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.48   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.48   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.48   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.48   (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.48  * 
% 0.19/0.48  "."
% 0.19/0.48  * 
% 0.19/0.48  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-11T04:14:25
% 0.19/0.48  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n022.cluster.edu at 2022-07-11T04:14:25
% 0.19/0.49  
% 0.19/0.49  ; Recognized commutativity assertion (= (|intersection| ?X ?Y) (|intersection| ?Y ?X)).
% 0.19/0.49  ; Recognized commutativity assertion (OR (NOT (|intersect| ?X ?Y)) (|intersect| ?Y ?X)).
% 0.19/0.49  ; Declaring intersection to be commutative.
% 0.49/0.67  ; Declaring intersect to be commutative.
% 0.49/0.67  
% 0.49/0.67  #||
% 0.49/0.67  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.49/0.67  % SZS output start Refutation
% See solution above
% 0.49/0.67  ||#
% 0.49/0.67  
% 0.49/0.67  ; Summary of computation:
% 0.49/0.67  ;      1496 formulas have been input or derived (from 85 formulas).
% 0.49/0.67  ;       255 (17%) were retained.  Of these,
% 0.49/0.67  ;            8 ( 3%) were simplified or subsumed later,
% 0.49/0.67  ;          247 (97%) are still being kept.
% 0.49/0.67  ; 
% 0.49/0.67  ; Run time in seconds excluding printing time:
% 0.49/0.67  ;     0.003   2%   Read assertion file          (1 call)
% 0.49/0.67  ;     0.001   1%   Assert                       (12 calls)
% 0.49/0.67  ;     0.030  16%   Process new row              (1,193 calls)
% 0.49/0.67  ;     0.022  12%   Resolution                   (168 calls)
% 0.49/0.67  ;     0.004   2%   Paramodulation               (84 calls)
% 0.49/0.67  ;     0.000   0%   Factoring                    (60 calls)
% 0.49/0.67  ;     0.012   6%   Condensing                   (914 calls)
% 0.49/0.67  ;     0.035  19%   Forward subsumption          (914 calls)
% 0.49/0.67  ;     0.006   3%   Backward subsumption         (233 calls)
% 0.49/0.67  ;     0.025  13%   Clause clause subsumption    (8,688 calls)
% 0.49/0.67  ;     0.019  10%   Forward simplification       (1,175 calls)
% 0.49/0.67  ;     0.001   1%   Backward simplification      (255 calls)
% 0.49/0.67  ;     0.003   2%   Ordering                     (893 calls)
% 0.49/0.67  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.49/0.67  ;     0.000   0%   Purity testing               (1 call)
% 0.49/0.67  ;     0.028  15%   Other
% 0.49/0.67  ;     0.189        Total
% 0.49/0.67  ;     0.195        Real time
% 0.49/0.67  ; 
% 0.49/0.67  ; Term-hash-array has 290 terms in all.
% 0.49/0.67  ; Feature-vector-row-index has 229 entries (233 at peak, 233 added, 4 deleted).
% 0.49/0.67  ; Feature-vector-row-index has 227 nodes (260 at peak, 260 added, 33 deleted).
% 0.49/0.67  ;  Retrieved 18,122 possibly forward subsuming rows in 914 calls.
% 0.49/0.67  ;  Retrieved 1,534 possibly backward subsumed rows in 233 calls.
% 0.49/0.67  ; Path-index has 286 entries (286 at peak, 294 added, 8 deleted).
% 0.49/0.67  ; Path-index has 165 nodes (165 at peak, 177 added, 12 deleted).
% 0.49/0.67  ; Trie-index has 286 entries (286 at peak, 294 added, 8 deleted).
% 0.49/0.67  ; Trie-index has 431 nodes (431 at peak, 449 added, 18 deleted).
% 0.49/0.67  ; Retrieved 489 generalization terms in 3,773 calls.
% 0.49/0.67  ; Retrieved 26 instance terms in 21 calls.
% 0.49/0.67  ; Retrieved 6,808 unifiable terms in 721 calls.
% 0.49/0.67  ; 
% 0.49/0.67  ; The agenda of rows to process has 19 entries:
% 0.49/0.67  ;     7 with value 11              6 with value 12               6 with value 13
% 0.49/0.67  ; The agenda of rows to give has 167 entries:
% 0.49/0.67  ;     1 with value (4 5)          28 with value (4 19)           1 with value (4 25)
% 0.49/0.67  ;     2 with value (4 7)          27 with value (4 20)          13 with value (4 26)
% 0.49/0.67  ;     4 with value (4 9)          22 with value (4 21)           3 with value (4 27)
% 0.49/0.67  ;     1 with value (4 11)         21 with value (4 22)           2 with value (4 28)
% 0.49/0.67  ;     3 with value (4 16)          7 with value (4 23)           1 with value (4 29)
% 0.49/0.67  ;     4 with value (4 17)          7 with value (4 24)           1 with value (4 32)
% 0.49/0.67  ;    19 with value (4 18)
% 0.49/0.67  Evaluation took:
% 0.49/0.67    0.196 seconds of real time
% 0.49/0.67    0.16584 seconds of user run time
% 0.49/0.67    0.029902 seconds of system run time
% 0.49/0.67    [Run times include 0.005 seconds GC run time.]
% 0.49/0.67    0 calls to %EVAL
% 0.49/0.67    0 page faults and
% 0.49/0.67    14,077,840 bytes consed.
% 0.49/0.67  :PROOF-FOUND
% 0.49/0.67  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-11T04:14:25
% 0.49/0.67  :PROOF-FOUND
% 0.49/0.67  * 
%------------------------------------------------------------------------------