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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : SWV261-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n007.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 : Wed Jul 20 21:32:24 EDT 2022

% Result   : Unsatisfiable 0.19s 0.51s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   19 (  11 unt;   3 nHn;  14 RR)
%            Number of literals    :   29 (   3 equ;  12 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   4 con; 0-3 aty)
%            Number of variables   :   27 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
    c_in(v_X,v_G,tc_Message_Omsg),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    ~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_union(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(cls_Message_Oparts__Un__subset2_0,axiom,
    c_lessequals(c_Message_Oparts(c_union(X,Y,tc_Message_Omsg)),c_union(c_Message_Oparts(X),c_Message_Oparts(Y),tc_Message_Omsg),tc_set(tc_Message_Omsg)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oparts__Un__subset2_0) ).

cnf(cls_Message_Oparts__mono_0,axiom,
    ( ~ c_lessequals(X,Y,tc_set(tc_Message_Omsg))
    | c_lessequals(c_Message_Oparts(X),c_Message_Oparts(Y),tc_set(tc_Message_Omsg)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Message_Oparts__mono_0) ).

cnf(cls_Set_OUnCI_0,axiom,
    ( ~ c_in(X,Y,Z)
    | c_in(X,c_union(U,Y,Z),Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUnCI_0) ).

cnf(cls_Set_OUnCI_1,axiom,
    ( ~ c_in(X,Y,Z)
    | c_in(X,c_union(Y,U,Z),Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OUnCI_1) ).

cnf(cls_Set_OinsertE_0,axiom,
    ( ~ c_in(X,c_insert(Y,Z,U),U)
    | c_in(X,Z,U)
    | X = Y ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OinsertE_0) ).

cnf(cls_Set_OsubsetI_0,axiom,
    ( c_in(c_Main_OsubsetI__1(X,Y,Z),X,Z)
    | c_lessequals(X,Y,tc_set(Z)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OsubsetI_0) ).

cnf(cls_Set_OsubsetI_1,axiom,
    ( ~ c_in(c_Main_OsubsetI__1(X,Y,Z),Y,Z)
    | c_lessequals(X,Y,tc_set(Z)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_OsubsetI_1) ).

cnf(cls_Set_Osubset__trans_0,axiom,
    ( ~ c_lessequals(X,Y,tc_set(Z))
    | ~ c_lessequals(U,X,tc_set(Z))
    | c_lessequals(U,Y,tc_set(Z)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Set_Osubset__trans_0) ).

cnf(12,plain,
    c_in(v_X,c_union(v_G,X,tc_Message_Omsg),tc_Message_Omsg),
    inference('HYPERRESOLVE',[status(thm)],[cls_Set_OUnCI_1,cls_conjecture_0]) ).

cnf(17,plain,
    ~ c_lessequals(c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
    inference('UR-RESOLVE',[status(thm)],[cls_Set_Osubset__trans_0,cls_Message_Oparts__Un__subset2_0,cls_conjecture_1]) ).

cnf(33,plain,
    ~ c_lessequals(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_set(tc_Message_Omsg)),
    inference('UR-RESOLVE',[status(thm)],[cls_Message_Oparts__mono_0,17]) ).

cnf(36,plain,
    c_in(c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg),c_insert(v_X,v_H,tc_Message_Omsg),tc_Message_Omsg),
    inference('HYPERRESOLVE',[status(thm)],[33,cls_Set_OsubsetI_0]) ).

cnf(37,plain,
    ~ c_in(c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg),
    inference('UR-RESOLVE',[status(thm)],[cls_Set_OsubsetI_1,33]) ).

cnf(67,plain,
    ( c_in(c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg),v_H,tc_Message_Omsg)
    | c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg) = v_X ),
    inference('HYPERRESOLVE',[status(thm)],[cls_Set_OinsertE_0,36]) ).

cnf(68,plain,
    ~ c_in(c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg),v_H,tc_Message_Omsg),
    inference('UR-RESOLVE',[status(thm)],[cls_Set_OUnCI_0,37]) ).

cnf(69,plain,
    c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg) = v_X,
    inference('REWRITE',[status(thm)],[67,68]) ).

cnf(71,plain,
    $false,
    inference('REWRITE',[status(thm)],[37,12,69,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWV261-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13  % Command  : run-snark %s %d
% 0.12/0.33  % Computer : n007.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % 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 : Wed Jun 15 02:48:25 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  /export/starexec/sandbox/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.46  SNARK-TPTP-OPTIONS
% 0.19/0.46  * 
% 0.19/0.46  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.46   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.46   (USE-FACTORING :POS)
% 0.19/0.46   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.46   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.46   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.46   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.46   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.46   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.46   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.46   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.46   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.46   (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.46  * 
% 0.19/0.46  "."
% 0.19/0.46  * 
% 0.19/0.47  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-15T02:48:25
% 0.19/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n007.cluster.edu at 2022-06-15T02:48:25
% 0.19/0.51  
% 0.19/0.51  
% 0.19/0.51  #||
% 0.19/0.51  % SZS status Unsatisfiable for /export/starexec/sandbox/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  ;       116 formulas have been input or derived (from 31 formulas).
% 0.19/0.51  ;        71 (61%) were retained.  Of these,
% 0.19/0.51  ;            6 ( 8%) were simplified or subsumed later,
% 0.19/0.51  ;           65 (92%) 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   5%   Read assertion file          (1 call)
% 0.19/0.51  ;     0.000   0%   Assert                       (10 calls)
% 0.19/0.51  ;     0.009  21%   Process new row              (105 calls)
% 0.19/0.51  ;     0.002   5%   Resolution                   (60 calls)
% 0.19/0.51  ;     0.000   0%   Paramodulation               (30 calls)
% 0.19/0.51  ;     0.000   0%   Factoring                    (2 calls)
% 0.19/0.51  ;     0.001   2%   Condensing                   (22 calls)
% 0.19/0.51  ;     0.000   0%   Forward subsumption          (22 calls)
% 0.19/0.51  ;     0.002   5%   Backward subsumption         (21 calls)
% 0.19/0.51  ;     0.000   0%   Clause clause subsumption    (44 calls)
% 0.19/0.51  ;     0.000   0%   Forward simplification       (105 calls)
% 0.19/0.51  ;     0.002   5%   Backward simplification      (71 calls)
% 0.19/0.51  ;     0.000   0%   Ordering                     (38 calls)
% 0.19/0.51  ;     0.001   2%   Sortal reasoning             (32 calls)
% 0.19/0.51  ;     0.000   0%   Purity testing               (1 call)
% 0.19/0.51  ;     0.024  56%   Other
% 0.19/0.51  ;     0.043        Total
% 0.19/0.51  ;     0.047        Real time
% 0.19/0.51  ; 
% 0.19/0.51  ; Term-hash-array has 181 terms in all.
% 0.19/0.51  ; Feature-vector-row-index has 20 entries (21 at peak, 21 added, 1 deleted).
% 0.19/0.51  ; Feature-vector-row-index has 131 nodes (154 at peak, 154 added, 23 deleted).
% 0.19/0.51  ;  Retrieved 44 possibly forward subsuming rows in 22 calls.
% 0.19/0.51  ;  Retrieved 3 possibly backward subsumed rows in 21 calls.
% 0.19/0.51  ; Path-index has 178 entries (184 at peak, 186 added, 8 deleted).
% 0.19/0.51  ; Path-index has 663 nodes (682 at peak, 693 added, 30 deleted).
% 0.19/0.51  ; Trie-index has 178 entries (184 at peak, 186 added, 8 deleted).
% 0.19/0.51  ; Trie-index has 882 nodes (923 at peak, 939 added, 57 deleted).
% 0.19/0.51  ; Retrieved 34 generalization terms in 129 calls.
% 0.19/0.51  ; Retrieved 49 instance terms in 49 calls.
% 0.19/0.51  ; Retrieved 399 unifiable terms in 301 calls.
% 0.19/0.51  ; 
% 0.19/0.51  ; The agenda of backward simplifiable rows to process has 3 entries:
% 0.19/0.51  ;     3 with value 0
% 0.19/0.51  ; The agenda of rows to process has 1 entry:
% 0.19/0.51  ;     1 with value 20
% 0.19/0.51  ; The agenda of rows to give has 36 entries:
% 0.19/0.51  ;     1 with value (4 12)          2 with value (4 26)           1 with value (4 33)
% 0.19/0.51  ;     1 with value (4 19)          3 with value (4 29)           2 with value (4 34)
% 0.19/0.51  ;     2 with value (4 23)          1 with value (4 30)           1 with value (4 38)
% 0.19/0.51  ;    20 with value (4 25)          1 with value (4 31)           1 with value (4 40)
% 0.19/0.51  Evaluation took:
% 0.19/0.51    0.047 seconds of real time
% 0.19/0.51    0.041467 seconds of user run time
% 0.19/0.51    0.006172 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    3,758,624 bytes consed.
% 0.19/0.51  :PROOF-FOUND
% 0.19/0.51  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-15T02:48:25
% 0.19/0.51  :PROOF-FOUND
% 0.19/0.51  * 
%------------------------------------------------------------------------------