↑ Up

SNARK---20120808r022.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : SEU327+1 : TPTP v8.1.0. Released v3.3.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:21:20 EDT 2022

% Result   : Theorem 0.17s 0.55s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   20 (  14 unt;   2 nHn;  17 RR)
%            Number of literals    :   29 (  15 equ;  11 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   3 con; 0-3 aty)
%            Number of variables   :   16 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(26,axiom,
    cast_to_subset(X) = X,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_subset_1) ).

cnf(27,axiom,
    ( ~ element(X,powerset(Y))
    | subset_complement(Y,X) = set_difference(Y,X) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_subset_1) ).

cnf(28,axiom,
    element(cast_to_subset(X),powerset(X)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k2_subset_1) ).

cnf(29,plain,
    element(X,powerset(X)),
    inference('REWRITE',[status(thm)],[28,26,theory(equality)]) ).

cnf(31,axiom,
    ( ~ element(X,powerset(powerset(Y)))
    | element(union_of_subsets(Y,X),powerset(Y)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k5_setfam_1) ).

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

cnf(72,axiom,
    ( ~ element(X,powerset(Y))
    | ~ element(Z,powerset(Y))
    | subset_difference(Y,X,Z) = set_difference(X,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_k6_subset_1) ).

cnf(74,negated_conjecture,
    element('SKOLEMAAAU6',powerset(powerset('SKOLEMAAAU5'))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t11_tops_2) ).

cnf(75,negated_conjecture,
    'SKOLEMAAAU6' != empty_set,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t11_tops_2) ).

cnf(76,negated_conjecture,
    meet_of_subsets('SKOLEMAAAU5',complements_of_subsets('SKOLEMAAAU5','SKOLEMAAAU6')) != subset_complement('SKOLEMAAAU5',union_of_subsets('SKOLEMAAAU5','SKOLEMAAAU6')),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t11_tops_2) ).

cnf(82,axiom,
    ( ~ element(X,powerset(powerset(Y)))
    | X = empty_set
    | subset_difference(Y,cast_to_subset(Y),union_of_subsets(Y,X)) = meet_of_subsets(Y,complements_of_subsets(Y,X)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',t47_setfam_1) ).

cnf(83,plain,
    ( ~ element(X,powerset(powerset(Y)))
    | X = empty_set
    | subset_difference(Y,Y,union_of_subsets(Y,X)) = meet_of_subsets(Y,complements_of_subsets(Y,X)) ),
    inference('REWRITE',[status(thm)],[82,26,theory(equality)]) ).

cnf(148,plain,
    element(union_of_subsets('SKOLEMAAAU5','SKOLEMAAAU6'),powerset('SKOLEMAAAU5')),
    inference('HYPERRESOLVE',[status(thm)],[31,74]) ).

cnf(164,plain,
    union_of_subsets('SKOLEMAAAU5','SKOLEMAAAU6') = union('SKOLEMAAAU6'),
    inference('HYPERRESOLVE',[status(thm)],[70,74]) ).

cnf(165,plain,
    meet_of_subsets('SKOLEMAAAU5',complements_of_subsets('SKOLEMAAAU5','SKOLEMAAAU6')) != subset_complement('SKOLEMAAAU5',union('SKOLEMAAAU6')),
    inference('REWRITE',[status(thm)],[76,164,theory(equality)]) ).

cnf(166,plain,
    element(union('SKOLEMAAAU6'),powerset('SKOLEMAAAU5')),
    inference('REWRITE',[status(thm)],[148,164,theory(equality)]) ).

cnf(251,plain,
    subset_difference('SKOLEMAAAU5','SKOLEMAAAU5',union('SKOLEMAAAU6')) = meet_of_subsets('SKOLEMAAAU5',complements_of_subsets('SKOLEMAAAU5','SKOLEMAAAU6')),
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[83,74,75]),164,theory(equality)]) ).

cnf(362,plain,
    subset_complement('SKOLEMAAAU5',union('SKOLEMAAAU6')) = set_difference('SKOLEMAAAU5',union('SKOLEMAAAU6')),
    inference('HYPERRESOLVE',[status(thm)],[27,166]) ).

cnf(363,plain,
    meet_of_subsets('SKOLEMAAAU5',complements_of_subsets('SKOLEMAAAU5','SKOLEMAAAU6')) != set_difference('SKOLEMAAAU5',union('SKOLEMAAAU6')),
    inference('REWRITE',[status(thm)],[165,362,theory(equality)]) ).

cnf(369,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[72,166,29]),363,251,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10  % Problem  : SEU327+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.11  % Command  : run-snark %s %d
% 0.11/0.32  % Computer : n025.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Sun Jun 19 10:53:29 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.17/0.41  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.42  * 
% 0.17/0.42  * 
% 0.17/0.43  #<PACKAGE "SNARK-USER">
% 0.17/0.43  * 
% 0.17/0.43  SNARK-TPTP-OPTIONS
% 0.17/0.43  * 
% 0.17/0.43  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.17/0.43   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.17/0.43   (USE-FACTORING :POS)
% 0.17/0.43   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.17/0.43   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.17/0.43   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.17/0.43   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.17/0.43   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.17/0.43   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.17/0.43   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.17/0.43   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.17/0.43   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.17/0.43   (DECLARE-TPTP-SYMBOLS2))
% 0.17/0.43  * 
% 0.17/0.43  "."
% 0.17/0.43  * 
% 0.17/0.43  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-19T10:53:29
% 0.17/0.43  ; 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-19T10:53:29
% 0.17/0.46  
% 0.17/0.46  WARNING:
% 0.17/0.46     |v1_xcmplx_0| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.17/0.46  WARNING:
% 0.17/0.46     |v1_xreal_0| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.17/0.46  WARNING:
% 0.17/0.46     |v1_rat_1| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.17/0.46  WARNING:
% 0.17/0.46     |v1_int_1| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.17/0.46  WARNING:
% 0.17/0.46     |natural| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.17/0.55  ; Recognized right identity assertion (= (|set_difference| ?X |empty_set|) ?X).
% 0.17/0.55  
% 0.17/0.55  #||
% 0.17/0.55  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.55  % SZS output start Refutation
% See solution above
% 0.17/0.55  ||#
% 0.17/0.55  
% 0.17/0.55  ; Summary of computation:
% 0.17/0.55  ;      1431 formulas have been input or derived (from 126 formulas).
% 0.17/0.55  ;       369 (26%) were retained.  Of these,
% 0.17/0.55  ;           57 (15%) were simplified or subsumed later,
% 0.17/0.55  ;          312 (85%) are still being kept.
% 0.17/0.55  ; 
% 0.17/0.55  ; Run time in seconds excluding printing time:
% 0.17/0.55  ;     0.012  10%   Read assertion file          (1 call)
% 0.17/0.55  ;     0.003   2%   Assert                       (59 calls)
% 0.17/0.55  ;     0.032  27%   Process new row              (1,263 calls)
% 0.17/0.55  ;     0.017  14%   Resolution                   (250 calls)
% 0.17/0.55  ;     0.000   0%   Paramodulation               (125 calls)
% 0.17/0.55  ;     0.000   0%   Factoring                    (1 call)
% 0.17/0.55  ;     0.001   1%   Condensing                   (131 calls)
% 0.17/0.55  ;     0.004   3%   Forward subsumption          (131 calls)
% 0.17/0.55  ;     0.003   2%   Backward subsumption         (101 calls)
% 0.17/0.55  ;     0.000   0%   Clause clause subsumption    (64 calls)
% 0.17/0.55  ;     0.009   8%   Forward simplification       (1,248 calls)
% 0.17/0.55  ;     0.007   6%   Backward simplification      (367 calls)
% 0.17/0.55  ;     0.000   0%   Ordering                     (147 calls)
% 0.17/0.55  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.17/0.55  ;     0.001   1%   Purity testing               (1 call)
% 0.17/0.55  ;     0.031  26%   Other
% 0.17/0.55  ;     0.120        Total
% 0.17/0.55  ;     0.121        Real time
% 0.17/0.55  ; 
% 0.17/0.55  ; Term-hash-array has 525 terms in all.
% 0.17/0.55  ; Feature-vector-row-index has 101 entries (101 at peak, 101 added, 0 deleted).
% 0.17/0.55  ; Feature-vector-row-index has 414 nodes (414 at peak, 414 added, 0 deleted).
% 0.17/0.55  ;  Retrieved 55 possibly forward subsuming rows in 131 calls.
% 0.17/0.55  ;  Retrieved 9 possibly backward subsumed rows in 101 calls.
% 0.17/0.55  ; Path-index has 472 entries (472 at peak, 532 added, 60 deleted).
% 0.17/0.55  ; Path-index has 1,145 nodes (1,145 at peak, 1,207 added, 62 deleted).
% 0.17/0.55  ; Trie-index has 472 entries (472 at peak, 532 added, 60 deleted).
% 0.17/0.55  ; Trie-index has 1,475 nodes (1,475 at peak, 1,720 added, 245 deleted).
% 0.17/0.55  ; Retrieved 1,370 generalization terms in 1,753 calls.
% 0.17/0.55  ; Retrieved 334 instance terms in 265 calls.
% 0.17/0.55  ; Retrieved 9,102 unifiable terms in 1,682 calls.
% 0.17/0.55  ; 
% 0.17/0.55  ; The agenda of rows to process has 21 entries:
% 0.17/0.55  ;     6 with value 15              5 with value 17               6 with value 20
% 0.17/0.55  ;     4 with value 16
% 0.17/0.55  ; The agenda of input rows to give has 1 entry:
% 0.17/0.55  ;     1 with value 13
% 0.17/0.55  ; The agenda of rows to give has 189 entries:
% 0.17/0.55  ;     9 with value (4 8)          13 with value (4 14)           2 with value (4 21)
% 0.17/0.55  ;    21 with value (4 9)          21 with value (4 15)           2 with value (4 22)
% 0.17/0.55  ;    11 with value (4 10)         11 with value (4 16)           1 with value (4 24)
% 0.17/0.55  ;    21 with value (4 11)          7 with value (4 17)           1 with value (4 29)
% 0.17/0.55  ;    29 with value (4 12)         16 with value (4 18)           1 with value (4 34)
% 0.17/0.55  ;    20 with value (4 13)          3 with value (4 20)
% 0.17/0.55  Evaluation took:
% 0.17/0.55    0.121 seconds of real time
% 0.17/0.55    0.100696 seconds of user run time
% 0.17/0.55    0.020168 seconds of system run time
% 0.17/0.55    0 calls to %EVAL
% 0.17/0.55    0 page faults and
% 0.17/0.55    6,961,120 bytes consed.
% 0.17/0.55  :PROOF-FOUND
% 0.17/0.55  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-19T10:53:29
% 0.17/0.55  :PROOF-FOUND
% 0.17/0.55  * 
%------------------------------------------------------------------------------