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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : SET173+3 : TPTP v8.1.0. Released v2.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 : Tue Jul 19 05:08:04 EDT 2022

% Result   : Theorem 0.39s 0.62s
% Output   : Refutation 0.47s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   11 (   4 unt;   3 nHn;   7 RR)
%            Number of literals    :   23 (   5 equ;   7 neg)
%            Maximal clause size   :    3 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   19 (   4 sgn)

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

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

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

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

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

cnf(14,negated_conjecture,
    intersection('SKOLEMAAAT3',union('SKOLEMAAAT3','SKOLEMAAAT4')) != 'SKOLEMAAAT3',
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_absorbtion_for_intersection) ).

cnf(17,plain,
    ( X = Y
    | member('SKOLEMAAAT2'(X,Y),Y)
    | member('SKOLEMAAAT2'(X,Y),union(X,Z)) ),
    inference('HYPERRESOLVE',[status(thm)],[2,13]) ).

cnf(47,plain,
    ( X = Y
    | member('SKOLEMAAAT2'(X,Y),Y)
    | member('SKOLEMAAAT2'(X,Y),intersection(union(X,Z),X)) ),
    inference('HYPERRESOLVE',[status(thm)],[4,17,13]) ).

cnf(156,plain,
    member('SKOLEMAAAT2'('SKOLEMAAAT3',intersection('SKOLEMAAAT3',union('SKOLEMAAAT3','SKOLEMAAAT4'))),intersection('SKOLEMAAAT3',union('SKOLEMAAAT3','SKOLEMAAAT4'))),
    inference('UR-RESOLVE',[status(thm)],[47,14]) ).

cnf(173,plain,
    member('SKOLEMAAAT2'('SKOLEMAAAT3',intersection('SKOLEMAAAT3',union('SKOLEMAAAT3','SKOLEMAAAT4'))),'SKOLEMAAAT3'),
    inference('HYPERRESOLVE',[status(thm)],[3,156]) ).

cnf(174,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[12,156,14]),173]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET173+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n019.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 09:54:08 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.45  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.46  * 
% 0.20/0.46  * 
% 0.20/0.47  #<PACKAGE "SNARK-USER">
% 0.20/0.47  * 
% 0.20/0.47  SNARK-TPTP-OPTIONS
% 0.20/0.47  * 
% 0.20/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47   (USE-FACTORING :POS)
% 0.20/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47  * 
% 0.20/0.47  "."
% 0.20/0.47  * 
% 0.20/0.47  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-11T09:54:08
% 0.20/0.47  ; 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-07-11T09:54:08
% 0.20/0.48  
% 0.20/0.48  ; Recognized commutativity assertion (= (|union| ?X ?Y) (|union| ?Y ?X)).
% 0.20/0.48  ; Recognized commutativity assertion (= (|intersection| ?X ?Y) (|intersection| ?Y ?X)).
% 0.20/0.48  ; Declaring union to be commutative.
% 0.39/0.62  ; Declaring intersection to be commutative.
% 0.39/0.62  
% 0.39/0.62  #||
% 0.39/0.62  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.62  % SZS output start Refutation
% See solution above
% 0.47/0.63  ||#
% 0.47/0.63  
% 0.47/0.63  ; Summary of computation:
% 0.47/0.63  ;       727 formulas have been input or derived (from 35 formulas).
% 0.47/0.63  ;       174 (24%) were retained.  Of these,
% 0.47/0.63  ;           21 (12%) were simplified or subsumed later,
% 0.47/0.63  ;          153 (88%) are still being kept.
% 0.47/0.63  ; 
% 0.47/0.63  ; Run time in seconds excluding printing time:
% 0.47/0.63  ;     0.002   1%   Read assertion file          (1 call)
% 0.47/0.63  ;     0.001   1%   Assert                       (9 calls)
% 0.47/0.63  ;     0.016  10%   Process new row              (560 calls)
% 0.47/0.63  ;     0.018  12%   Resolution                   (68 calls)
% 0.47/0.63  ;     0.001   1%   Paramodulation               (34 calls)
% 0.47/0.63  ;     0.000   0%   Factoring                    (18 calls)
% 0.47/0.63  ;     0.012   8%   Condensing                   (494 calls)
% 0.47/0.63  ;     0.026  17%   Forward subsumption          (494 calls)
% 0.47/0.63  ;     0.005   3%   Backward subsumption         (158 calls)
% 0.47/0.63  ;     0.029  19%   Clause clause subsumption    (2,727 calls)
% 0.47/0.63  ;     0.013   8%   Forward simplification       (549 calls)
% 0.47/0.63  ;     0.001   1%   Backward simplification      (174 calls)
% 0.47/0.63  ;     0.008   5%   Ordering                     (1,499 calls)
% 0.47/0.63  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.47/0.63  ;     0.000   0%   Purity testing               (1 call)
% 0.47/0.63  ;     0.023  15%   Other
% 0.47/0.63  ;     0.155        Total
% 0.47/0.63  ;     0.157        Real time
% 0.47/0.63  ; 
% 0.47/0.63  ; Term-hash-array has 324 terms in all.
% 0.47/0.63  ; Feature-vector-row-index has 137 entries (139 at peak, 158 added, 21 deleted).
% 0.47/0.63  ; Feature-vector-row-index has 384 nodes (384 at peak, 424 added, 40 deleted).
% 0.47/0.63  ;  Retrieved 4,738 possibly forward subsuming rows in 494 calls.
% 0.47/0.63  ;  Retrieved 235 possibly backward subsumed rows in 158 calls.
% 0.47/0.63  ; Path-index has 301 entries (302 at peak, 326 added, 25 deleted).
% 0.47/0.63  ; Path-index has 277 nodes (277 at peak, 281 added, 4 deleted).
% 0.47/0.63  ; Trie-index has 301 entries (302 at peak, 326 added, 25 deleted).
% 0.47/0.63  ; Trie-index has 838 nodes (838 at peak, 886 added, 48 deleted).
% 0.47/0.63  ; Retrieved 533 generalization terms in 1,521 calls.
% 0.47/0.63  ; Retrieved 22 instance terms in 15 calls.
% 0.47/0.63  ; Retrieved 4,880 unifiable terms in 421 calls.
% 0.47/0.63  ; 
% 0.47/0.63  ; The agenda of rows to process has 22 entries:
% 0.47/0.63  ;     1 with value 19              1 with value 34               4 with value 52
% 0.47/0.63  ;     1 with value 21              1 with value 40               1 with value 53
% 0.47/0.63  ;     1 with value 23              1 with value 43               6 with value 54
% 0.47/0.63  ;     1 with value 27              1 with value 47               1 with value 55
% 0.47/0.63  ;     1 with value 30              1 with value 50
% 0.47/0.63  ; The agenda of rows to give has 121 entries:
% 0.47/0.63  ;     1 with value (4 17)          8 with value (4 32)           2 with value (4 41)
% 0.47/0.63  ;     5 with value (4 25)          6 with value (4 33)           1 with value (4 42)
% 0.47/0.63  ;     7 with value (4 26)          7 with value (4 34)           1 with value (4 43)
% 0.47/0.63  ;     7 with value (4 27)          7 with value (4 35)           1 with value (4 44)
% 0.47/0.63  ;     7 with value (4 28)          4 with value (4 36)           4 with value (4 45)
% 0.47/0.63  ;    12 with value (4 29)          4 with value (4 37)           5 with value (4 47)
% 0.47/0.63  ;     7 with value (4 30)          7 with value (4 38)           1 with value (4 52)
% 0.47/0.63  ;     9 with value (4 31)          8 with value (4 39)
% 0.47/0.63  Evaluation took:
% 0.47/0.63    0.158 seconds of real time
% 0.47/0.63    0.138938 seconds of user run time
% 0.47/0.63    0.01876 seconds of system run time
% 0.47/0.63    0 calls to %EVAL
% 0.47/0.63    0 page faults and
% 0.47/0.63    11,698,440 bytes consed.
% 0.47/0.63  :PROOF-FOUND
% 0.47/0.63  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-11T09:54:08
% 0.47/0.63  :PROOF-FOUND
% 0.47/0.63  * 
%------------------------------------------------------------------------------