TSTP Solution File: SET014-2 by SNARK---20120808r022

View Problem - Process Solution

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

% Computer : n020.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:42 EDT 2022

% Result   : Unsatisfiable 0.39s 0.61s
% Output   : Refutation 0.39s
% 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(membership_in_subsets,axiom,
    ( ~ member(X,Y)
    | ~ subset(Y,Z)
    | member(X,Z) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',membership_in_subsets) ).

cnf(subsets_axiom1,axiom,
    ( subset(X,Y)
    | member(member_of_1_not_of_2(X,Y),X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',subsets_axiom1) ).

cnf(subsets_axiom2,axiom,
    ( ~ member(member_of_1_not_of_2(X,Y),Y)
    | subset(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',subsets_axiom2) ).

cnf(member_of_union_is_member_of_one_set,axiom,
    ( ~ member(X,union(Y,Z))
    | member(X,Y)
    | member(X,Z) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET002-0.ax',member_of_union_is_member_of_one_set) ).

cnf(a_subset_of_c,hypothesis,
    subset(as,cs),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_subset_of_c) ).

cnf(b_subset_of_c,hypothesis,
    subset(bs,cs),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_subset_of_c) ).

cnf(prove_a_union_b_subset_of_c,negated_conjecture,
    ~ subset(union(as,bs),cs),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_union_b_subset_of_c) ).

cnf(26,plain,
    member(member_of_1_not_of_2(union(as,bs),cs),union(as,bs)),
    inference('HYPERRESOLVE',[status(thm)],[prove_a_union_b_subset_of_c,subsets_axiom1]) ).

cnf(27,plain,
    ~ member(member_of_1_not_of_2(union(as,bs),cs),cs),
    inference('UR-RESOLVE',[status(thm)],[subsets_axiom2,prove_a_union_b_subset_of_c]) ).

cnf(108,plain,
    ~ member(member_of_1_not_of_2(union(as,bs),cs),as),
    inference('UR-RESOLVE',[status(thm)],[membership_in_subsets,27,a_subset_of_c]) ).

cnf(109,plain,
    ~ member(member_of_1_not_of_2(union(as,bs),cs),bs),
    inference('UR-RESOLVE',[status(thm)],[membership_in_subsets,27,b_subset_of_c]) ).

cnf(776,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[member_of_union_is_member_of_one_set,109,108]),26]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET014-2 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.12/0.34  % Computer : n020.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Mon Jul 11 10:17:28 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  * 
% 0.19/0.46  * 
% 0.19/0.46  #<PACKAGE "SNARK-USER">
% 0.19/0.46  * 
% 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-11T10:17:28
% 0.19/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n020.cluster.edu at 2022-07-11T10:17:28
% 0.19/0.48  
% 0.19/0.48  ; Recognized commutativity assertion (OR (NOT (|equal_sets| ?X ?Y)) (|equal_sets| ?Y ?X)).
% 0.19/0.48  ; Recognized commutativity assertion (OR (NOT (|equal_elements| ?X ?Y)) (|equal_elements| ?Y ?X)).
% 0.19/0.48  ; Declaring equal_sets to be commutative.
% 0.39/0.61  ; Declaring equal_elements to be commutative.
% 0.39/0.61  
% 0.39/0.61  #||
% 0.39/0.61  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.39/0.61  % SZS output start Refutation
% See solution above
% 0.39/0.61  ||#
% 0.39/0.61  
% 0.39/0.61  ; Summary of computation:
% 0.39/0.61  ;      1829 formulas have been input or derived (from 79 formulas).
% 0.39/0.61  ;       776 (42%) were retained.  Of these,
% 0.39/0.61  ;          776 (100%) are still being kept.
% 0.39/0.61  ; 
% 0.39/0.61  ; Run time in seconds excluding printing time:
% 0.39/0.61  ;     0.005   3%   Read assertion file          (1 call)
% 0.39/0.61  ;     0.001   1%   Assert                       (24 calls)
% 0.39/0.61  ;     0.056  39%   Process new row              (1,505 calls)
% 0.39/0.61  ;     0.025  17%   Resolution                   (156 calls)
% 0.39/0.61  ;     0.000   0%   Paramodulation               (78 calls)
% 0.39/0.61  ;     0.000   0%   Factoring                    (4 calls)
% 0.39/0.61  ;     0.000   0%   Condensing                   (91 calls)
% 0.39/0.61  ;     0.004   3%   Forward subsumption          (91 calls)
% 0.39/0.61  ;     0.001   1%   Backward subsumption         (82 calls)
% 0.39/0.61  ;     0.001   1%   Clause clause subsumption    (153 calls)
% 0.39/0.61  ;     0.015  10%   Forward simplification       (1,505 calls)
% 0.39/0.61  ;     0.007   5%   Backward simplification      (776 calls)
% 0.39/0.61  ;     0.001   1%   Ordering                     (143 calls)
% 0.39/0.61  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.39/0.61  ;     0.000   0%   Purity testing               (1 call)
% 0.39/0.61  ;     0.029  20%   Other
% 0.39/0.61  ;     0.145        Total
% 0.39/0.61  ;     0.147        Real time
% 0.39/0.61  ; 
% 0.39/0.61  ; Term-hash-array has 1,386 terms in all.
% 0.39/0.61  ; Feature-vector-row-index has 82 entries (82 at peak, 82 added, 0 deleted).
% 0.39/0.61  ; Feature-vector-row-index has 260 nodes (260 at peak, 260 added, 0 deleted).
% 0.39/0.61  ;  Retrieved 128 possibly forward subsuming rows in 91 calls.
% 0.39/0.61  ;  Retrieved 54 possibly backward subsumed rows in 82 calls.
% 0.39/0.61  ; Path-index has 1,390 entries (1,390 at peak, 1,390 added, 0 deleted).
% 0.39/0.61  ; Path-index has 1,227 nodes (1,227 at peak, 1,227 added, 0 deleted).
% 0.39/0.61  ; Trie-index has 1,390 entries (1,390 at peak, 1,390 added, 0 deleted).
% 0.39/0.61  ; Trie-index has 3,876 nodes (3,876 at peak, 3,876 added, 0 deleted).
% 0.39/0.61  ; Retrieved 1,069 generalization terms in 1,610 calls.
% 0.39/0.61  ; Retrieved 703 instance terms in 693 calls.
% 0.39/0.61  ; Retrieved 19,453 unifiable terms in 1,521 calls.
% 0.39/0.61  ; 
% 0.39/0.61  ; The agenda of rows to process has 38 entries:
% 0.39/0.61  ;     5 with value 15              6 with value 17              24 with value 20
% 0.39/0.61  ;     1 with value 16              2 with value 18
% 0.39/0.61  ; The agenda of rows to give has 697 entries:
% 0.39/0.61  ;     1 with value (4 9)         136 with value (4 16)          22 with value (4 21)
% 0.39/0.61  ;    27 with value (4 12)         24 with value (4 17)           4 with value (4 22)
% 0.39/0.61  ;    23 with value (4 13)        125 with value (4 18)           1 with value (4 23)
% 0.39/0.61  ;    62 with value (4 14)         13 with value (4 19)           4 with value (4 24)
% 0.39/0.61  ;    47 with value (4 15)        208 with value (4 20)
% 0.39/0.61  Evaluation took:
% 0.39/0.61    0.147 seconds of real time
% 0.39/0.61    0.136336 seconds of user run time
% 0.39/0.61    0.010771 seconds of system run time
% 0.39/0.61    0 calls to %EVAL
% 0.39/0.61    0 page faults and
% 0.39/0.61    9,164,432 bytes consed.
% 0.39/0.61  :PROOF-FOUND
% 0.39/0.61  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-11T10:17:28
% 0.39/0.61  :PROOF-FOUND
% 0.39/0.61  * 
%------------------------------------------------------------------------------