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

View Problem - Process Solution

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

% Computer : n032.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:19:11 EDT 2022

% Result   : Theorem 2.48s 2.74s
% Output   : Refutation 2.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   21 (  13 unt;   1 nHn;  16 RR)
%            Number of literals    :   35 (   3 equ;  16 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :   22 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(5,axiom,
    ( ~ finite(X)
    | ~ element(Y,powerset(X))
    | finite(Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cc2_finset_1) ).

cnf(9,axiom,
    ( X = Y
    | ~ subset(X,Y)
    | ~ subset(Y,X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).

cnf(11,axiom,
    ( subset(X,Y)
    | in('SKOLEMAAAQ1'(X,Y),X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).

cnf(12,axiom,
    ( subset(X,Y)
    | ~ in('SKOLEMAAAQ1'(X,Y),Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).

cnf(15,axiom,
    ( ~ preboolean(X)
    | X != finite_subsets(Y)
    | in(Z,X)
    | ~ subset(Z,Y)
    | ~ finite(Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_finsub_1) ).

cnf(19,axiom,
    preboolean(finite_subsets(X)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k5_finsub_1) ).

cnf(50,axiom,
    subset(X,X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).

cnf(53,axiom,
    subset(finite_subsets(X),powerset(X)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t26_finsub_1) ).

cnf(54,negated_conjecture,
    finite('SKOLEMAAAQ13'),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t27_finsub_1) ).

cnf(55,negated_conjecture,
    finite_subsets('SKOLEMAAAQ13') != powerset('SKOLEMAAAQ13'),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t27_finsub_1) ).

cnf(57,axiom,
    ( ~ element(X,powerset(Y))
    | subset(X,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset) ).

cnf(58,axiom,
    ( element(X,powerset(Y))
    | ~ subset(X,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_subset) ).

cnf(59,axiom,
    ( ~ in(X,Y)
    | ~ element(Y,powerset(Z))
    | element(X,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_subset) ).

cnf(118,plain,
    element(X,powerset(X)),
    inference('HYPERRESOLVE',[status(thm)],[58,50]) ).

cnf(143,plain,
    ~ subset(powerset('SKOLEMAAAQ13'),finite_subsets('SKOLEMAAAQ13')),
    inference('UR-RESOLVE',[status(thm)],[9,55,53]) ).

cnf(427,plain,
    in('SKOLEMAAAQ1'(powerset('SKOLEMAAAQ13'),finite_subsets('SKOLEMAAAQ13')),powerset('SKOLEMAAAQ13')),
    inference('HYPERRESOLVE',[status(thm)],[143,11]) ).

cnf(428,plain,
    ~ in('SKOLEMAAAQ1'(powerset('SKOLEMAAAQ13'),finite_subsets('SKOLEMAAAQ13')),finite_subsets('SKOLEMAAAQ13')),
    inference('UR-RESOLVE',[status(thm)],[12,143]) ).

cnf(5799,plain,
    element('SKOLEMAAAQ1'(powerset('SKOLEMAAAQ13'),finite_subsets('SKOLEMAAAQ13')),powerset('SKOLEMAAAQ13')),
    inference('HYPERRESOLVE',[status(thm)],[59,427,118]) ).

cnf(14405,plain,
    finite('SKOLEMAAAQ1'(powerset('SKOLEMAAAQ13'),finite_subsets('SKOLEMAAAQ13'))),
    inference('HYPERRESOLVE',[status(thm)],[5,5799,54]) ).

cnf(14406,plain,
    subset('SKOLEMAAAQ1'(powerset('SKOLEMAAAQ13'),finite_subsets('SKOLEMAAAQ13')),'SKOLEMAAAQ13'),
    inference('HYPERRESOLVE',[status(thm)],[57,5799]) ).

cnf(14410,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[15,14405,19,428,theory(equality)]),14406]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09  % Problem  : SEU114+1 : TPTP v8.1.0. Released v3.2.0.
% 0.05/0.10  % Command  : run-snark %s %d
% 0.10/0.29  % Computer : n032.cluster.edu
% 0.10/0.29  % Model    : x86_64 x86_64
% 0.10/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29  % Memory   : 8042.1875MB
% 0.10/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29  % CPULimit : 300
% 0.10/0.30  % WCLimit  : 600
% 0.10/0.30  % DateTime : Mon Jun 20 07:22:48 EDT 2022
% 0.10/0.30  % CPUTime  : 
% 0.15/0.38  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.15/0.39  * 
% 0.15/0.39  * 
% 0.15/0.40  #<PACKAGE "SNARK-USER">
% 0.15/0.40  * 
% 0.15/0.40  SNARK-TPTP-OPTIONS
% 0.15/0.40  * 
% 0.15/0.40  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.15/0.40   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.15/0.40   (USE-FACTORING :POS)
% 0.15/0.40   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.15/0.40   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.15/0.40   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.15/0.40   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.15/0.40   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.15/0.40   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.15/0.40   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.15/0.40   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.15/0.40   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.15/0.40   (DECLARE-TPTP-SYMBOLS2))
% 0.15/0.40  * 
% 0.15/0.40  "."
% 0.15/0.40  * 
% 0.15/0.40  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-20T07:22:48
% 0.15/0.40  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n032.cluster.edu at 2022-06-20T07:22:48
% 0.15/0.41  WARNING:
% 0.15/0.41     |cap_closed| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.15/0.41  WARNING:
% 0.15/0.41     |relation| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.15/0.41  WARNING:
% 0.15/0.41     |function| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.15/0.41  WARNING:
% 0.15/0.41     |one_to_one| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.15/0.41  WARNING:
% 0.15/0.41     |epsilon_transitive| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.15/0.41  WARNING:
% 0.15/0.41     |epsilon_connected| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.15/0.41  WARNING:
% 0.15/0.41     |ordinal| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.15/0.41  WARNING:
% 0.15/0.41     |natural| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 2.48/2.74  
% 2.48/2.74  
% 2.48/2.74  #||
% 2.48/2.74  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.48/2.74  % SZS output start Refutation
% See solution above
% 2.48/2.74  ||#
% 2.48/2.74  
% 2.48/2.74  ; Summary of computation:
% 2.48/2.74  ;     32090 formulas have been input or derived (from 1619 formulas).
% 2.48/2.74  ;     14410 (45%) were retained.  Of these,
% 2.48/2.74  ;          384 ( 3%) were simplified or subsumed later,
% 2.48/2.74  ;        14026 (97%) are still being kept.
% 2.48/2.74  ; 
% 2.48/2.74  ; Run time in seconds excluding printing time:
% 2.48/2.74  ;     0.005   0%   Read assertion file          (1 call)
% 2.48/2.74  ;     0.002   0%   Assert                       (36 calls)
% 2.48/2.74  ;     0.877  37%   Process new row              (28,197 calls)
% 2.48/2.74  ;     0.598  26%   Resolution                   (3,236 calls)
% 2.48/2.74  ;     0.122   5%   Paramodulation               (1,618 calls)
% 2.48/2.74  ;     0.000   0%   Factoring                    (46 calls)
% 2.48/2.74  ;     0.012   1%   Condensing                   (2,775 calls)
% 2.48/2.74  ;     0.209   9%   Forward subsumption          (2,775 calls)
% 2.48/2.74  ;     0.061   3%   Backward subsumption         (2,294 calls)
% 2.48/2.74  ;     0.006   0%   Clause clause subsumption    (2,674 calls)
% 2.48/2.74  ;     0.214   9%   Forward simplification       (28,186 calls)
% 2.48/2.74  ;     0.083   4%   Backward simplification      (14,410 calls)
% 2.48/2.74  ;     0.009   0%   Ordering                     (3,996 calls)
% 2.48/2.74  ;     0.001   0%   Sortal reasoning             (32 calls)
% 2.48/2.74  ;     0.000   0%   Purity testing               (1 call)
% 2.48/2.74  ;     0.141   6%   Other
% 2.48/2.74  ;     2.340        Total
% 2.48/2.74  ;     2.341        Real time
% 2.48/2.74  ; 
% 2.58/2.74  ; Term-hash-array has 21,654 terms in all.
% 2.58/2.74  ; Feature-vector-row-index has 2,007 entries (2,222 at peak, 2,294 added, 287 deleted).
% 2.58/2.74  ; Feature-vector-row-index has 11,638 nodes (12,852 at peak, 13,382 added, 1,744 deleted).
% 2.58/2.74  ;  Retrieved 3,501 possibly forward subsuming rows in 2,775 calls.
% 2.58/2.74  ;  Retrieved 300 possibly backward subsumed rows in 2,294 calls.
% 2.58/2.74  ; Path-index has 21,539 entries (21,539 at peak, 21,717 added, 178 deleted).
% 2.58/2.74  ; Path-index has 24,206 nodes (24,206 at peak, 24,281 added, 75 deleted).
% 2.58/2.74  ; Trie-index has 21,539 entries (21,539 at peak, 21,717 added, 178 deleted).
% 2.58/2.74  ; Trie-index has 58,946 nodes (58,946 at peak, 59,350 added, 404 deleted).
% 2.58/2.74  ; Retrieved 21,237 generalization terms in 44,344 calls.
% 2.58/2.74  ; Retrieved 12,351 instance terms in 12,115 calls.
% 2.58/2.74  ; Retrieved 404,276 unifiable terms in 45,124 calls.
% 2.58/2.74  ; 
% 2.58/2.74  ; The agenda of rows to process has 35 entries:
% 2.58/2.74  ;     6 with value 18              2 with value 21               1 with value 31
% 2.58/2.74  ;     4 with value 19              6 with value 25               1 with value 33
% 2.58/2.74  ;    12 with value 20              3 with value 30
% 2.58/2.74  ; The agenda of rows to give has 12416 entries:
% 2.58/2.74  ;   328 with value (4 14)        776 with value (4 22)         211 with value (4 29)
% 2.58/2.74  ;  1306 with value (4 15)        679 with value (4 23)          27 with value (4 30)
% 2.58/2.74  ;   951 with value (4 16)        229 with value (4 24)          94 with value (4 31)
% 2.58/2.74  ;  1240 with value (4 17)        329 with value (4 25)          34 with value (4 32)
% 2.58/2.74  ;   971 with value (4 18)         54 with value (4 26)         155 with value (4 33)
% 2.58/2.74  ;  2058 with value (4 19)         58 with value (4 27)           7 with value (4 35)
% 2.58/2.74  ;  1790 with value (4 20)        117 with value (4 28)          77 with value (4 36)
% 2.58/2.74  ;   925 with value (4 21)
% 2.58/2.74  Evaluation took:
% 2.58/2.74    2.344 seconds of real time
% 2.58/2.74    2.104919 seconds of user run time
% 2.58/2.74    0.238245 seconds of system run time
% 2.58/2.74    [Run times include 0.375 seconds GC run time.]
% 2.58/2.74    0 calls to %EVAL
% 2.58/2.74    0 page faults and
% 2.58/2.74    187,853,336 bytes consed.
% 2.58/2.74  :PROOF-FOUND
% 2.58/2.74  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-20T07:22:51
% 2.58/2.74  :PROOF-FOUND
% 2.58/2.74  * 
%------------------------------------------------------------------------------