TSTP Solution File: SEU417+1 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : SEU417+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n025.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 14:22:31 EDT 2022

% Result   : Theorem 0.91s 1.11s
% Output   : Refutation 0.91s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   27 (  19 unt;   0 nHn;  26 RR)
%            Number of literals    :   45 (  10 equ;  21 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   3 con; 0-3 aty)
%            Number of variables   :   27 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,negated_conjecture,
    m1_subset_1('SKOLEMAAAV2',k1_zfmisc_1(k1_zfmisc_1('SKOLEMAAAV1'))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_relset_2) ).

cnf(2,negated_conjecture,
    m1_subset_1('SKOLEMAAAV3',k1_zfmisc_1(k1_zfmisc_1('SKOLEMAAAV1'))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_relset_2) ).

cnf(3,negated_conjecture,
    ~ r1_tarski(k5_subset_1('SKOLEMAAAV1',k8_setfam_1('SKOLEMAAAV1','SKOLEMAAAV2'),k8_setfam_1('SKOLEMAAAV1','SKOLEMAAAV3')),k8_setfam_1('SKOLEMAAAV1',k1_relset_2('SKOLEMAAAV1','SKOLEMAAAV2','SKOLEMAAAV3'))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_relset_2) ).

cnf(10,axiom,
    ( ~ m1_subset_1(X,k1_zfmisc_1(Y))
    | ~ m1_subset_1(Z,k1_zfmisc_1(Y))
    | m1_subset_1(k4_subset_1(Y,X,Z),k1_zfmisc_1(Y)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k4_subset_1) ).

cnf(11,axiom,
    ( ~ m1_subset_1(X,k1_zfmisc_1(Y))
    | ~ m1_subset_1(Z,k1_zfmisc_1(Y))
    | m1_subset_1(k5_subset_1(Y,X,Z),k1_zfmisc_1(Y)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k5_subset_1) ).

cnf(12,axiom,
    ( ~ m1_subset_1(X,k1_zfmisc_1(k1_zfmisc_1(Y)))
    | m1_subset_1(k8_setfam_1(Y,X),k1_zfmisc_1(Y)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k8_setfam_1) ).

cnf(36,axiom,
    ( ~ m1_subset_1(X,k1_zfmisc_1(k1_zfmisc_1(Y)))
    | ~ m1_subset_1(Z,k1_zfmisc_1(k1_zfmisc_1(Y)))
    | k1_relset_2(Y,X,Z) = k3_xboole_0(X,Z) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k1_relset_2) ).

cnf(37,axiom,
    ( ~ m1_subset_1(X,k1_zfmisc_1(Y))
    | ~ m1_subset_1(Z,k1_zfmisc_1(Y))
    | k4_subset_1(Y,X,Z) = k2_xboole_0(X,Z) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k4_subset_1) ).

cnf(38,axiom,
    ( ~ m1_subset_1(X,k1_zfmisc_1(Y))
    | ~ m1_subset_1(Z,k1_zfmisc_1(Y))
    | k5_subset_1(Y,X,Z) = k3_xboole_0(X,Z) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k5_subset_1) ).

cnf(42,axiom,
    r1_tarski(k3_xboole_0(X,Y),k2_xboole_0(X,Z)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t29_xboole_1) ).

cnf(48,axiom,
    ( ~ m1_subset_1(X,k1_zfmisc_1(k1_zfmisc_1(Y)))
    | ~ m1_subset_1(Z,k1_zfmisc_1(k1_zfmisc_1(Y)))
    | ~ r1_tarski(X,Z)
    | r1_tarski(k8_setfam_1(Y,Z),k8_setfam_1(Y,X)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t59_setfam_1) ).

cnf(53,axiom,
    ( ~ m1_subset_1(X,k1_zfmisc_1(k1_zfmisc_1(Y)))
    | ~ m1_subset_1(Z,k1_zfmisc_1(k1_zfmisc_1(Y)))
    | ~ m1_subset_1(U,k1_zfmisc_1(k1_zfmisc_1(Y)))
    | X != k4_subset_1(k1_zfmisc_1(Y),Z,U)
    | k8_setfam_1(Y,X) = k5_subset_1(Y,k8_setfam_1(Y,Z),k8_setfam_1(Y,U)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_mssubfam) ).

cnf(93,plain,
    m1_subset_1(k8_setfam_1('SKOLEMAAAV1','SKOLEMAAAV2'),k1_zfmisc_1('SKOLEMAAAV1')),
    inference('HYPERRESOLVE',[status(thm)],[12,1]) ).

cnf(94,plain,
    m1_subset_1(k8_setfam_1('SKOLEMAAAV1','SKOLEMAAAV3'),k1_zfmisc_1('SKOLEMAAAV1')),
    inference('HYPERRESOLVE',[status(thm)],[12,2]) ).

cnf(106,plain,
    m1_subset_1(k4_subset_1(k1_zfmisc_1('SKOLEMAAAV1'),'SKOLEMAAAV2','SKOLEMAAAV3'),k1_zfmisc_1(k1_zfmisc_1('SKOLEMAAAV1'))),
    inference('HYPERRESOLVE',[status(thm)],[10,1,2]) ).

cnf(127,plain,
    m1_subset_1(k5_subset_1(k1_zfmisc_1('SKOLEMAAAV1'),'SKOLEMAAAV2','SKOLEMAAAV3'),k1_zfmisc_1(k1_zfmisc_1('SKOLEMAAAV1'))),
    inference('HYPERRESOLVE',[status(thm)],[11,1,2]) ).

cnf(148,plain,
    k4_subset_1(k1_zfmisc_1('SKOLEMAAAV1'),'SKOLEMAAAV2','SKOLEMAAAV3') = k2_xboole_0('SKOLEMAAAV2','SKOLEMAAAV3'),
    inference('HYPERRESOLVE',[status(thm)],[37,1,2]) ).

cnf(149,plain,
    m1_subset_1(k2_xboole_0('SKOLEMAAAV2','SKOLEMAAAV3'),k1_zfmisc_1(k1_zfmisc_1('SKOLEMAAAV1'))),
    inference('REWRITE',[status(thm)],[106,148,theory(equality)]) ).

cnf(173,plain,
    k5_subset_1(k1_zfmisc_1('SKOLEMAAAV1'),'SKOLEMAAAV2','SKOLEMAAAV3') = k3_xboole_0('SKOLEMAAAV2','SKOLEMAAAV3'),
    inference('HYPERRESOLVE',[status(thm)],[38,1,2]) ).

cnf(174,plain,
    m1_subset_1(k3_xboole_0('SKOLEMAAAV2','SKOLEMAAAV3'),k1_zfmisc_1(k1_zfmisc_1('SKOLEMAAAV1'))),
    inference('REWRITE',[status(thm)],[127,173,theory(equality)]) ).

cnf(200,plain,
    k1_relset_2('SKOLEMAAAV1','SKOLEMAAAV2','SKOLEMAAAV3') = k3_xboole_0('SKOLEMAAAV2','SKOLEMAAAV3'),
    inference('HYPERRESOLVE',[status(thm)],[36,1,2]) ).

cnf(201,plain,
    ~ r1_tarski(k5_subset_1('SKOLEMAAAV1',k8_setfam_1('SKOLEMAAAV1','SKOLEMAAAV2'),k8_setfam_1('SKOLEMAAAV1','SKOLEMAAAV3')),k8_setfam_1('SKOLEMAAAV1',k3_xboole_0('SKOLEMAAAV2','SKOLEMAAAV3'))),
    inference('REWRITE',[status(thm)],[3,200,theory(equality)]) ).

cnf(449,plain,
    k5_subset_1('SKOLEMAAAV1',k8_setfam_1('SKOLEMAAAV1','SKOLEMAAAV2'),k8_setfam_1('SKOLEMAAAV1','SKOLEMAAAV3')) = k3_xboole_0(k8_setfam_1('SKOLEMAAAV1','SKOLEMAAAV3'),k8_setfam_1('SKOLEMAAAV1','SKOLEMAAAV2')),
    inference('HYPERRESOLVE',[status(thm)],[38,94,93]) ).

cnf(450,plain,
    ~ r1_tarski(k3_xboole_0(k8_setfam_1('SKOLEMAAAV1','SKOLEMAAAV3'),k8_setfam_1('SKOLEMAAAV1','SKOLEMAAAV2')),k8_setfam_1('SKOLEMAAAV1',k3_xboole_0('SKOLEMAAAV2','SKOLEMAAAV3'))),
    inference('REWRITE',[status(thm)],[201,449,theory(equality)]) ).

cnf(977,plain,
    r1_tarski(k8_setfam_1('SKOLEMAAAV1',k2_xboole_0('SKOLEMAAAV2','SKOLEMAAAV3')),k8_setfam_1('SKOLEMAAAV1',k3_xboole_0('SKOLEMAAAV2','SKOLEMAAAV3'))),
    inference('HYPERRESOLVE',[status(thm)],[48,174,149,42]) ).

cnf(2304,plain,
    k8_setfam_1('SKOLEMAAAV1',k2_xboole_0('SKOLEMAAAV2','SKOLEMAAAV3')) = k3_xboole_0(k8_setfam_1('SKOLEMAAAV1','SKOLEMAAAV3'),k8_setfam_1('SKOLEMAAAV1','SKOLEMAAAV2')),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[53,148,149,1,2]),449,theory(equality)]) ).

cnf(2310,plain,
    $false,
    inference('REWRITE',[status(thm)],[977,450,2304,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SEU417+1 : TPTP v8.1.0. Released v3.4.0.
% 0.12/0.12  % Command  : run-snark %s %d
% 0.12/0.33  % Computer : n025.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.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sun Jun 19 21:37:14 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.18/0.44  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.45  * 
% 0.18/0.45  * 
% 0.18/0.46  #<PACKAGE "SNARK-USER">
% 0.18/0.46  * 
% 0.18/0.46  SNARK-TPTP-OPTIONS
% 0.18/0.46  * 
% 0.18/0.46  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.18/0.46   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.18/0.46   (USE-FACTORING :POS)
% 0.18/0.46   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.18/0.46   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.18/0.46   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.18/0.46   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.18/0.46   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.18/0.46   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.18/0.46   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.18/0.46   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.18/0.46   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.18/0.46   (DECLARE-TPTP-SYMBOLS2))
% 0.18/0.46  * 
% 0.18/0.46  "."
% 0.18/0.46  * 
% 0.18/0.46  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-19T21:37:14
% 0.18/0.46  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n025.cluster.edu at 2022-06-19T21:37:14
% 0.18/0.48  
% 0.18/0.48  ; Recognized commutativity assertion (= (|k2_xboole_0| ?X ?Y) (|k2_xboole_0| ?Y ?X)).
% 0.18/0.48  ; Recognized commutativity assertion (= (|k3_xboole_0| ?X ?Y) (|k3_xboole_0| ?Y ?X)).
% 0.18/0.48  ; Recognized right identity assertion (= (|k2_xboole_0| ?X |k1_xboole_0|) ?X).
% 0.18/0.48  ; Declaring k2_xboole_0 to be commutative.
% 0.18/0.48  WARNING:
% 0.18/0.48     |v3_relat_1| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.91/1.11  ; Declaring k3_xboole_0 to be commutative.
% 0.91/1.11  
% 0.91/1.11  #||
% 0.91/1.11  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.91/1.11  % SZS output start Refutation
% See solution above
% 0.91/1.11  ||#
% 0.91/1.11  
% 0.91/1.11  ; Summary of computation:
% 0.91/1.11  ;      7381 formulas have been input or derived (from 211 formulas).
% 0.91/1.11  ;      2310 (31%) were retained.  Of these,
% 0.91/1.11  ;          654 (28%) were simplified or subsumed later,
% 0.91/1.11  ;         1656 (72%) are still being kept.
% 0.91/1.11  ; 
% 0.91/1.11  ; Run time in seconds excluding printing time:
% 0.91/1.11  ;     0.011   2%   Read assertion file          (1 call)
% 0.91/1.11  ;     0.002   0%   Assert                       (50 calls)
% 0.91/1.11  ;     0.147  22%   Process new row              (7,056 calls)
% 0.91/1.11  ;     0.213  33%   Resolution                   (420 calls)
% 0.91/1.11  ;     0.006   1%   Paramodulation               (210 calls)
% 0.91/1.11  ;     0.000   0%   Factoring                    (8 calls)
% 0.91/1.11  ;     0.005   1%   Condensing                   (476 calls)
% 0.91/1.11  ;     0.026   4%   Forward subsumption          (476 calls)
% 0.91/1.11  ;     0.008   1%   Backward subsumption         (390 calls)
% 0.91/1.11  ;     0.002   0%   Clause clause subsumption    (898 calls)
% 0.91/1.11  ;     0.116  18%   Forward simplification       (6,994 calls)
% 0.91/1.11  ;     0.057   9%   Backward simplification      (2,307 calls)
% 0.91/1.11  ;     0.006   1%   Ordering                     (1,696 calls)
% 0.91/1.11  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.91/1.11  ;     0.000   0%   Purity testing               (1 call)
% 0.91/1.11  ;     0.055   8%   Other
% 0.91/1.11  ;     0.654        Total
% 0.91/1.11  ;     0.657        Real time
% 0.91/1.11  ; 
% 0.91/1.11  ; Term-hash-array has 3,759 terms in all.
% 0.91/1.11  ; Feature-vector-row-index has 390 entries (390 at peak, 390 added, 0 deleted).
% 0.91/1.11  ; Feature-vector-row-index has 1,492 nodes (1,492 at peak, 1,492 added, 0 deleted).
% 0.91/1.11  ;  Retrieved 797 possibly forward subsuming rows in 476 calls.
% 0.91/1.11  ;  Retrieved 165 possibly backward subsumed rows in 390 calls.
% 0.91/1.11  ; Path-index has 3,108 entries (3,114 at peak, 3,776 added, 668 deleted).
% 0.91/1.11  ; Path-index has 2,946 nodes (2,996 at peak, 3,725 added, 779 deleted).
% 0.91/1.11  ; Trie-index has 3,108 entries (3,114 at peak, 3,776 added, 668 deleted).
% 0.91/1.11  ; Trie-index has 15,132 nodes (15,154 at peak, 19,736 added, 4,604 deleted).
% 0.91/1.11  ; Retrieved 20,647 generalization terms in 24,256 calls.
% 0.91/1.11  ; Retrieved 2,374 instance terms in 1,916 calls.
% 0.91/1.11  ; Retrieved 206,321 unifiable terms in 15,391 calls.
% 0.91/1.11  ; 
% 0.91/1.11  ; The agenda of rows to process has 1 entry:
% 0.91/1.11  ;     1 with value 48
% 0.91/1.11  ; The agenda of rows to give has 1457 entries:
% 0.91/1.11  ;    57 with value (4 13)         85 with value (4 22)          16 with value (4 31)
% 0.91/1.11  ;    62 with value (4 14)         99 with value (4 23)          22 with value (4 32)
% 0.91/1.11  ;    94 with value (4 15)         50 with value (4 24)          12 with value (4 33)
% 0.91/1.11  ;    94 with value (4 16)         81 with value (4 25)           8 with value (4 34)
% 0.91/1.11  ;   133 with value (4 17)         54 with value (4 26)           8 with value (4 35)
% 0.91/1.11  ;   114 with value (4 18)         49 with value (4 27)           4 with value (4 36)
% 0.91/1.11  ;   165 with value (4 19)         25 with value (4 28)           4 with value (4 38)
% 0.91/1.11  ;    79 with value (4 20)         32 with value (4 29)           2 with value (4 39)
% 0.91/1.11  ;    88 with value (4 21)         20 with value (4 30)
% 0.91/1.11  Evaluation took:
% 0.91/1.11    0.658 seconds of real time
% 0.91/1.11    0.609629 seconds of user run time
% 0.91/1.11    0.048066 seconds of system run time
% 0.91/1.11    [Run times include 0.036 seconds GC run time.]
% 0.91/1.11    0 calls to %EVAL
% 0.91/1.11    0 page faults and
% 0.91/1.11    54,751,856 bytes consed.
% 0.91/1.11  :PROOF-FOUND
% 0.91/1.11  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-19T21:37:15
% 0.91/1.11  :PROOF-FOUND
% 0.91/1.11  * 
%------------------------------------------------------------------------------