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

View Problem - Process Solution

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

% Computer : n013.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:21:19 EDT 2022

% Result   : Theorem 0.21s 0.56s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   24 (  17 unt;   1 nHn;  18 RR)
%            Number of literals    :   35 (  11 equ;  13 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   3 con; 0-2 aty)
%            Number of variables   :   17 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(26,axiom,
    ( ~ one_sorted_str(X)
    | cast_as_carrier_subset(X) = the_carrier(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_pre_topc) ).

cnf(32,axiom,
    ( X = union(Y)
    | in('SKOLEMAAAV2'(X,Y),X)
    | in('SKOLEMAAAV3'(X,Y),Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_tarski) ).

cnf(33,axiom,
    ( ~ one_sorted_str(X)
    | ~ element(Y,powerset(powerset(the_carrier(X))))
    | ~ is_a_cover_of_carrier(X,Y)
    | cast_as_carrier_subset(X) = union_of_subsets(the_carrier(X),Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_pre_topc) ).

cnf(39,axiom,
    ( empty_carrier(X)
    | ~ one_sorted_str(X)
    | ~ empty(the_carrier(X)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_struct_0) ).

cnf(42,axiom,
    empty(empty_set),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc6_membered) ).

cnf(56,axiom,
    element('SKOLEMAAAV8'(X),powerset(X)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc2_subset_1) ).

cnf(57,axiom,
    empty('SKOLEMAAAV8'(X)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc2_subset_1) ).

cnf(62,axiom,
    ( ~ element(X,powerset(powerset(Y)))
    | union_of_subsets(Y,X) = union(X) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k5_setfam_1) ).

cnf(70,negated_conjecture,
    ~ empty_carrier('SKOLEMAAAV11'),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_tops_2) ).

cnf(71,negated_conjecture,
    one_sorted_str('SKOLEMAAAV11'),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_tops_2) ).

cnf(73,negated_conjecture,
    is_a_cover_of_carrier('SKOLEMAAAV11','SKOLEMAAAV12'),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_tops_2) ).

cnf(74,negated_conjecture,
    'SKOLEMAAAV12' = empty_set,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_tops_2) ).

cnf(75,axiom,
    ( ~ empty(X)
    | X = empty_set ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).

cnf(76,axiom,
    ( ~ in(X,Y)
    | ~ empty(Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_boole) ).

cnf(79,plain,
    is_a_cover_of_carrier('SKOLEMAAAV11',empty_set),
    inference('REWRITE',[status(thm)],[73,74,theory(equality)]) ).

cnf(85,plain,
    'SKOLEMAAAV8'(X) = empty_set,
    inference('HYPERRESOLVE',[status(thm)],[75,57]) ).

cnf(86,plain,
    element(empty_set,powerset(X)),
    inference('REWRITE',[status(thm)],[56,85,theory(equality)]) ).

cnf(87,plain,
    ~ in(X,empty_set),
    inference('UR-RESOLVE',[status(thm)],[76,42]) ).

cnf(90,plain,
    cast_as_carrier_subset('SKOLEMAAAV11') = the_carrier('SKOLEMAAAV11'),
    inference('HYPERRESOLVE',[status(thm)],[26,71]) ).

cnf(99,plain,
    ~ empty(cast_as_carrier_subset('SKOLEMAAAV11')),
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[39,70,71]),90,theory(equality)]) ).

cnf(130,plain,
    union_of_subsets(X,empty_set) = union(empty_set),
    inference('HYPERRESOLVE',[status(thm)],[62,86]) ).

cnf(147,plain,
    cast_as_carrier_subset('SKOLEMAAAV11') = union(empty_set),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[33,71,86,79]),130,90,theory(equality)]) ).

cnf(152,plain,
    empty_set = cast_as_carrier_subset('SKOLEMAAAV11'),
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[32,87,87]),147,theory(equality)]) ).

cnf(154,plain,
    $false,
    inference('REWRITE',[status(thm)],[99,42,152,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14  % Problem  : SEU325+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.15  % Command  : run-snark %s %d
% 0.14/0.36  % Computer : n013.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Sun Jun 19 09:55:44 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.21/0.48  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.49  * 
% 0.21/0.49  * 
% 0.21/0.50  #<PACKAGE "SNARK-USER">
% 0.21/0.50  * 
% 0.21/0.50  SNARK-TPTP-OPTIONS
% 0.21/0.50  * 
% 0.21/0.50  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.50   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.50   (USE-FACTORING :POS)
% 0.21/0.50   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.50   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.50   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.50   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.50   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.50   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.50   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.50   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.50   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.50   (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.50  * 
% 0.21/0.50  "."
% 0.21/0.50  * 
% 0.21/0.50  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-19T09:55:44
% 0.21/0.50  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n013.cluster.edu at 2022-06-19T09:55:44
% 0.21/0.52  WARNING:
% 0.21/0.52     |v1_xcmplx_0| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.21/0.52  WARNING:
% 0.21/0.52     |v1_xreal_0| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.21/0.52  WARNING:
% 0.21/0.52     |v1_rat_1| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.21/0.52  WARNING:
% 0.21/0.52     |v1_int_1| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.21/0.52  WARNING:
% 0.21/0.52     |natural| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.21/0.56  
% 0.21/0.56  
% 0.21/0.56  #||
% 0.21/0.56  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.56  % SZS output start Refutation
% See solution above
% 0.21/0.57  ||#
% 0.21/0.57  
% 0.21/0.57  ; Summary of computation:
% 0.21/0.57  ;       383 formulas have been input or derived (from 79 formulas).
% 0.21/0.57  ;       154 (40%) were retained.  Of these,
% 0.21/0.57  ;           24 (16%) were simplified or subsumed later,
% 0.21/0.57  ;          130 (84%) are still being kept.
% 0.21/0.57  ; 
% 0.21/0.57  ; Run time in seconds excluding printing time:
% 0.21/0.57  ;     0.009  14%   Read assertion file          (1 call)
% 0.21/0.57  ;     0.002   3%   Assert                       (49 calls)
% 0.21/0.57  ;     0.013  20%   Process new row              (308 calls)
% 0.21/0.57  ;     0.004   6%   Resolution                   (156 calls)
% 0.21/0.57  ;     0.000   0%   Paramodulation               (78 calls)
% 0.21/0.57  ;     0.000   0%   Factoring                    (3 calls)
% 0.21/0.57  ;     0.003   5%   Condensing                   (70 calls)
% 0.21/0.57  ;     0.001   2%   Forward subsumption          (70 calls)
% 0.21/0.57  ;     0.002   3%   Backward subsumption         (68 calls)
% 0.21/0.57  ;     0.000   0%   Clause clause subsumption    (24 calls)
% 0.21/0.57  ;     0.002   3%   Forward simplification       (293 calls)
% 0.21/0.57  ;     0.003   5%   Backward simplification      (154 calls)
% 0.21/0.57  ;     0.000   0%   Ordering                     (86 calls)
% 0.21/0.57  ;     0.001   2%   Sortal reasoning             (32 calls)
% 0.21/0.57  ;     0.001   2%   Purity testing               (1 call)
% 0.21/0.57  ;     0.024  37%   Other
% 0.21/0.57  ;     0.065        Total
% 0.21/0.57  ;     0.068        Real time
% 0.21/0.57  ; 
% 0.21/0.57  ; Term-hash-array has 240 terms in all.
% 0.21/0.57  ; Feature-vector-row-index has 66 entries (67 at peak, 68 added, 2 deleted).
% 0.21/0.57  ; Feature-vector-row-index has 244 nodes (250 at peak, 254 added, 10 deleted).
% 0.39/0.57  ;  Retrieved 20 possibly forward subsuming rows in 70 calls.
% 0.39/0.57  ;  Retrieved 10 possibly backward subsumed rows in 68 calls.
% 0.39/0.57  ; Path-index has 215 entries (227 at peak, 254 added, 39 deleted).
% 0.39/0.57  ; Path-index has 468 nodes (480 at peak, 508 added, 40 deleted).
% 0.39/0.57  ; Trie-index has 215 entries (227 at peak, 254 added, 39 deleted).
% 0.39/0.57  ; Trie-index has 455 nodes (479 at peak, 539 added, 84 deleted).
% 0.39/0.57  ; Retrieved 196 generalization terms in 330 calls.
% 0.39/0.57  ; Retrieved 98 instance terms in 85 calls.
% 0.39/0.57  ; Retrieved 2,821 unifiable terms in 697 calls.
% 0.39/0.57  ; 
% 0.39/0.57  ; The agenda of backward simplifiable rows to process has 6 entries:
% 0.39/0.57  ;     6 with value 0
% 0.39/0.57  ; The agenda of rows to process has 1 entry:
% 0.39/0.57  ;     1 with value 15
% 0.39/0.57  ; The agenda of rows to give has 53 entries:
% 0.39/0.57  ;     1 with value (4 5)           1 with value (4 12)           2 with value (4 22)
% 0.39/0.57  ;     9 with value (4 6)           1 with value (4 13)           1 with value (4 23)
% 0.39/0.57  ;     5 with value (4 7)           1 with value (4 14)           2 with value (4 30)
% 0.39/0.57  ;    15 with value (4 8)           1 with value (4 15)           2 with value (4 33)
% 0.39/0.57  ;     2 with value (4 9)           1 with value (4 18)           1 with value (4 44)
% 0.39/0.57  ;     4 with value (4 10)          1 with value (4 21)           1 with value (4 46)
% 0.39/0.57  ;     2 with value (4 11)
% 0.39/0.57  Evaluation took:
% 0.39/0.57    0.068 seconds of real time
% 0.39/0.57    0.059541 seconds of user run time
% 0.39/0.57    0.009147 seconds of system run time
% 0.39/0.57    0 calls to %EVAL
% 0.39/0.57    0 page faults and
% 0.39/0.57    4,421,840 bytes consed.
% 0.39/0.57  :PROOF-FOUND
% 0.39/0.57  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-19T09:55:44
% 0.39/0.57  :PROOF-FOUND
% 0.39/0.57  * 
%------------------------------------------------------------------------------