TSTP Solution File: SET638+3 by SNARK---20120808r022

View Problem - Process Solution

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

% Computer : n028.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 05:11:11 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    subset(intersection(X,Y),X),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_is_subset) ).

cnf(2,axiom,
    ( ~ subset(X,Y)
    | intersection(X,Y) = X ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_intersection) ).

cnf(3,axiom,
    union(X,empty_set) = X,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_empty_set) ).

cnf(4,axiom,
    intersection(X,union(Y,Z)) = union(intersection(X,Y),intersection(X,Z)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_distributes_over_union) ).

cnf(21,negated_conjecture,
    subset('SKOLEMAAAV4',union('SKOLEMAAAV5','SKOLEMAAAV6')),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th120) ).

cnf(22,negated_conjecture,
    intersection('SKOLEMAAAV4','SKOLEMAAAV6') = empty_set,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th120) ).

cnf(23,negated_conjecture,
    ~ subset('SKOLEMAAAV4','SKOLEMAAAV5'),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th120) ).

cnf(29,plain,
    intersection('SKOLEMAAAV4',union('SKOLEMAAAV5','SKOLEMAAAV6')) = 'SKOLEMAAAV4',
    inference('HYPERRESOLVE',[status(thm)],[2,21]) ).

cnf(45,plain,
    intersection('SKOLEMAAAV4',union('SKOLEMAAAV6',X)) = intersection('SKOLEMAAAV4',X),
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[4,22,theory(equality)]),3,theory(equality)]) ).

cnf(46,plain,
    intersection('SKOLEMAAAV4','SKOLEMAAAV5') = 'SKOLEMAAAV4',
    inference('REWRITE',[status(thm)],[29,45,theory(equality)]) ).

cnf(77,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[1,46,theory(equality)]),23]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET638+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n028.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jul 10 23:58:13 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  * 
% 0.19/0.46  * 
% 0.19/0.47  #<PACKAGE "SNARK-USER">
% 0.19/0.47  * 
% 0.19/0.47  SNARK-TPTP-OPTIONS
% 0.19/0.47  * 
% 0.19/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47   (USE-FACTORING :POS)
% 0.19/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47  * 
% 0.19/0.47  "."
% 0.19/0.47  * 
% 0.19/0.47  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-10T23:58:13
% 0.19/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n028.cluster.edu at 2022-07-10T23:58:13
% 0.19/0.48  
% 0.19/0.48  ; Recognized right identity assertion (= (|union| ?X |empty_set|) ?X).
% 0.19/0.48  ; Recognized commutativity assertion (= (|union| ?X ?Y) (|union| ?Y ?X)).
% 0.19/0.48  ; Recognized commutativity assertion (= (|intersection| ?X ?Y) (|intersection| ?Y ?X)).
% 0.19/0.48  ; Declaring intersection to be commutative.
% 0.19/0.53  ; Declaring union to be commutative.
% 0.19/0.53  
% 0.19/0.53  #||
% 0.19/0.53  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.53  % SZS output start Refutation
% See solution above
% 0.19/0.53  ||#
% 0.19/0.53  
% 0.19/0.53  ; Summary of computation:
% 0.19/0.53  ;       262 formulas have been input or derived (from 34 formulas).
% 0.19/0.53  ;        77 (29%) were retained.  Of these,
% 0.19/0.53  ;            5 ( 6%) were simplified or subsumed later,
% 0.19/0.53  ;           72 (94%) are still being kept.
% 0.19/0.53  ; 
% 0.19/0.53  ; Run time in seconds excluding printing time:
% 0.19/0.53  ;     0.003   5%   Read assertion file          (1 call)
% 0.19/0.53  ;     0.002   3%   Assert                       (15 calls)
% 0.19/0.53  ;     0.010  17%   Process new row              (218 calls)
% 0.19/0.53  ;     0.008  14%   Resolution                   (66 calls)
% 0.19/0.53  ;     0.000   0%   Paramodulation               (33 calls)
% 0.19/0.53  ;     0.000   0%   Factoring                    (3 calls)
% 0.19/0.53  ;     0.002   3%   Condensing                   (88 calls)
% 0.19/0.53  ;     0.003   5%   Forward subsumption          (88 calls)
% 0.19/0.53  ;     0.000   0%   Backward subsumption         (39 calls)
% 0.19/0.53  ;     0.000   0%   Clause clause subsumption    (102 calls)
% 0.19/0.53  ;     0.003   5%   Forward simplification       (218 calls)
% 0.19/0.53  ;     0.002   3%   Backward simplification      (77 calls)
% 0.19/0.53  ;     0.002   3%   Ordering                     (218 calls)
% 0.19/0.53  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.19/0.53  ;     0.000   0%   Purity testing               (1 call)
% 0.19/0.53  ;     0.023  40%   Other
% 0.19/0.53  ;     0.058        Total
% 0.19/0.53  ;     0.060        Real time
% 0.19/0.53  ; 
% 0.19/0.53  ; Term-hash-array has 156 terms in all.
% 0.19/0.53  ; Feature-vector-row-index has 38 entries (38 at peak, 39 added, 1 deleted).
% 0.19/0.53  ; Feature-vector-row-index has 113 nodes (117 at peak, 124 added, 11 deleted).
% 0.19/0.53  ;  Retrieved 104 possibly forward subsuming rows in 88 calls.
% 0.19/0.53  ;  Retrieved 7 possibly backward subsumed rows in 39 calls.
% 0.19/0.53  ; Path-index has 154 entries (154 at peak, 162 added, 8 deleted).
% 0.19/0.53  ; Path-index has 165 nodes (165 at peak, 172 added, 7 deleted).
% 0.19/0.53  ; Trie-index has 154 entries (154 at peak, 162 added, 8 deleted).
% 0.19/0.53  ; Trie-index has 312 nodes (312 at peak, 326 added, 14 deleted).
% 0.19/0.53  ; Retrieved 298 generalization terms in 578 calls.
% 0.19/0.53  ; Retrieved 57 instance terms in 38 calls.
% 0.19/0.53  ; Retrieved 2,108 unifiable terms in 303 calls.
% 0.19/0.53  ; 
% 0.19/0.53  ; The agenda of rows to process has 17 entries:
% 0.19/0.53  ;     4 with value 9               1 with value 13               2 with value 22
% 0.19/0.53  ;     2 with value 10              4 with value 16               2 with value 29
% 0.19/0.53  ;     1 with value 11              1 with value 17
% 0.19/0.53  ; The agenda of rows to give has 38 entries:
% 0.19/0.53  ;     3 with value (4 9)           3 with value (4 16)           4 with value (4 21)
% 0.19/0.53  ;     3 with value (4 10)          1 with value (4 17)           2 with value (4 25)
% 0.19/0.53  ;     4 with value (4 11)          1 with value (4 18)           2 with value (4 26)
% 0.19/0.53  ;     3 with value (4 12)          1 with value (4 19)           2 with value (4 28)
% 0.19/0.53  ;     4 with value (4 13)          1 with value (4 20)           2 with value (4 38)
% 0.19/0.53  ;     2 with value (4 15)
% 0.19/0.53  Evaluation took:
% 0.19/0.53    0.061 seconds of real time
% 0.19/0.53    0.050089 seconds of user run time
% 0.19/0.53    0.010635 seconds of system run time
% 0.19/0.53    0 calls to %EVAL
% 0.19/0.53    0 page faults and
% 0.19/0.53    3,295,576 bytes consed.
% 0.19/0.53  :PROOF-FOUND
% 0.19/0.53  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-10T23:58:13
% 0.19/0.53  :PROOF-FOUND
% 0.19/0.53  * 
%------------------------------------------------------------------------------