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

View Problem - Process Solution

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

% Computer : n028.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:05:43 EDT 2022

% Result   : Theorem 0.19s 0.51s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   12 (   8 unt;   2 nHn;  11 RR)
%            Number of literals    :   18 (   0 equ;   8 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   10 (   0 sgn)

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

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

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

cnf(5,axiom,
    ( subset(X,Y)
    | ~ member('SKOLEMAAAV1'(X,Y),Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).

cnf(10,negated_conjecture,
    subset('SKOLEMAAAV3','SKOLEMAAAV4'),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_union_subset) ).

cnf(11,negated_conjecture,
    subset('SKOLEMAAAV5','SKOLEMAAAV4'),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_union_subset) ).

cnf(12,negated_conjecture,
    ~ subset(union('SKOLEMAAAV3','SKOLEMAAAV5'),'SKOLEMAAAV4'),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_union_subset) ).

cnf(13,plain,
    member('SKOLEMAAAV1'(union('SKOLEMAAAV3','SKOLEMAAAV5'),'SKOLEMAAAV4'),union('SKOLEMAAAV3','SKOLEMAAAV5')),
    inference('HYPERRESOLVE',[status(thm)],[12,4]) ).

cnf(14,plain,
    ~ member('SKOLEMAAAV1'(union('SKOLEMAAAV3','SKOLEMAAAV5'),'SKOLEMAAAV4'),'SKOLEMAAAV4'),
    inference('UR-RESOLVE',[status(thm)],[5,12]) ).

cnf(25,plain,
    ~ member('SKOLEMAAAV1'(union('SKOLEMAAAV3','SKOLEMAAAV5'),'SKOLEMAAAV4'),'SKOLEMAAAV3'),
    inference('UR-RESOLVE',[status(thm)],[3,14,10]) ).

cnf(26,plain,
    ~ member('SKOLEMAAAV1'(union('SKOLEMAAAV3','SKOLEMAAAV5'),'SKOLEMAAAV4'),'SKOLEMAAAV5'),
    inference('UR-RESOLVE',[status(thm)],[3,14,11]) ).

cnf(31,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[1,26,25]),13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET014+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n028.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 : Sun Jul 10 13:22:27 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.47  #<PACKAGE "SNARK-USER">
% 0.19/0.47  * 
% 0.19/0.47  SNARK-TPTP-OPTIONS
% 0.19/0.47  * 
% 0.19/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47   (USE-FACTORING :POS)
% 0.19/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47  * 
% 0.19/0.47  "."
% 0.19/0.47  * 
% 0.19/0.47  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-10T13:22:27
% 0.19/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n028.cluster.edu at 2022-07-10T13:22:27
% 0.19/0.49  
% 0.19/0.49  ; Recognized commutativity assertion (= (|union| ?X ?Y) (|union| ?Y ?X)).
% 0.19/0.51  ; Declaring union to be commutative.
% 0.19/0.51  
% 0.19/0.51  #||
% 0.19/0.51  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.51  % SZS output start Refutation
% See solution above
% 0.19/0.51  ||#
% 0.19/0.51  
% 0.19/0.51  ; Summary of computation:
% 0.19/0.51  ;        61 formulas have been input or derived (from 16 formulas).
% 0.19/0.51  ;        31 (51%) were retained.  Of these,
% 0.19/0.51  ;           31 (100%) are still being kept.
% 0.19/0.51  ; 
% 0.19/0.51  ; Run time in seconds excluding printing time:
% 0.19/0.51  ;     0.002   6%   Read assertion file          (1 call)
% 0.19/0.51  ;     0.001   3%   Assert                       (6 calls)
% 0.19/0.51  ;     0.002   6%   Process new row              (51 calls)
% 0.19/0.51  ;     0.002   6%   Resolution                   (30 calls)
% 0.19/0.51  ;     0.000   0%   Paramodulation               (15 calls)
% 0.19/0.51  ;     0.000   0%   Factoring                    (2 calls)
% 0.19/0.51  ;     0.001   3%   Condensing                   (26 calls)
% 0.19/0.51  ;     0.000   0%   Forward subsumption          (26 calls)
% 0.19/0.51  ;     0.000   0%   Backward subsumption         (18 calls)
% 0.19/0.51  ;     0.002   6%   Clause clause subsumption    (32 calls)
% 0.19/0.51  ;     0.000   0%   Forward simplification       (51 calls)
% 0.19/0.51  ;     0.001   3%   Backward simplification      (31 calls)
% 0.19/0.51  ;     0.001   3%   Ordering                     (53 calls)
% 0.19/0.51  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.19/0.51  ;     0.000   0%   Purity testing               (1 call)
% 0.19/0.51  ;     0.024  67%   Other
% 0.19/0.51  ;     0.036        Total
% 0.19/0.51  ;     0.037        Real time
% 0.19/0.51  ; 
% 0.19/0.51  ; Term-hash-array has 65 terms in all.
% 0.19/0.51  ; Feature-vector-row-index has 18 entries (18 at peak, 18 added, 0 deleted).
% 0.19/0.51  ; Feature-vector-row-index has 46 nodes (46 at peak, 46 added, 0 deleted).
% 0.19/0.51  ;  Retrieved 27 possibly forward subsuming rows in 26 calls.
% 0.19/0.51  ;  Retrieved 5 possibly backward subsumed rows in 18 calls.
% 0.19/0.51  ; Path-index has 68 entries (68 at peak, 68 added, 0 deleted).
% 0.19/0.51  ; Path-index has 83 nodes (83 at peak, 83 added, 0 deleted).
% 0.19/0.51  ; Trie-index has 68 entries (68 at peak, 68 added, 0 deleted).
% 0.19/0.51  ; Trie-index has 119 nodes (119 at peak, 119 added, 0 deleted).
% 0.19/0.51  ; Retrieved 10 generalization terms in 54 calls.
% 0.19/0.51  ; Retrieved 15 instance terms in 12 calls.
% 0.19/0.51  ; Retrieved 535 unifiable terms in 128 calls.
% 0.19/0.51  ; 
% 0.19/0.51  ; The agenda of rows to process has 4 entries:
% 0.19/0.51  ;     4 with value 15
% 0.19/0.51  ; The agenda of rows to give has 15 entries:
% 0.19/0.51  ;     1 with value (4 13)          4 with value (4 19)           2 with value (4 26)
% 0.19/0.51  ;     1 with value (4 14)          2 with value (4 21)           2 with value (4 38)
% 0.19/0.51  ;     3 with value (4 15)
% 0.19/0.51  Evaluation took:
% 0.19/0.51    0.038 seconds of real time
% 0.19/0.51    0.031479 seconds of user run time
% 0.19/0.51    0.006031 seconds of system run time
% 0.19/0.51    0 calls to %EVAL
% 0.19/0.51    0 page faults and
% 0.19/0.51    2,435,736 bytes consed.
% 0.19/0.51  :PROOF-FOUND
% 0.19/0.51  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-10T13:22:27
% 0.19/0.51  :PROOF-FOUND
% 0.19/0.51  * 
%------------------------------------------------------------------------------