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

View Problem - Process Solution

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

% Computer : n014.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:13:38 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    ( X != cartesian_product2(Y,Z)
    | ~ in(U,X)
    | in('SKOLEMAAAV1'(Y,Z,U),Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_zfmisc_1) ).

cnf(3,axiom,
    ( X != cartesian_product2(Y,Z)
    | ~ in(U,X)
    | in('SKOLEMAAAV2'(Y,Z,U),Z) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_zfmisc_1) ).

cnf(4,axiom,
    ( X != cartesian_product2(Y,Z)
    | ~ in(U,X)
    | U = ordered_pair('SKOLEMAAAV1'(Y,Z,U),'SKOLEMAAAV2'(Y,Z,U)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_zfmisc_1) ).

cnf(10,axiom,
    ( ~ subset(X,Y)
    | ~ in(Z,X)
    | in(Z,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).

cnf(18,negated_conjecture,
    subset('SKOLEMAAAV9',cartesian_product2('SKOLEMAAAV10','SKOLEMAAAV11')),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t103_zfmisc_1) ).

cnf(19,negated_conjecture,
    in('SKOLEMAAAV12','SKOLEMAAAV9'),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t103_zfmisc_1) ).

cnf(20,negated_conjecture,
    ( ~ in(X,'SKOLEMAAAV10')
    | ~ in(Y,'SKOLEMAAAV11')
    | 'SKOLEMAAAV12' != ordered_pair(X,Y) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t103_zfmisc_1) ).

cnf(22,plain,
    in('SKOLEMAAAV12',cartesian_product2('SKOLEMAAAV10','SKOLEMAAAV11')),
    inference('HYPERRESOLVE',[status(thm)],[10,18,19]) ).

cnf(58,plain,
    in('SKOLEMAAAV2'('SKOLEMAAAV10','SKOLEMAAAV11','SKOLEMAAAV12'),'SKOLEMAAAV11'),
    inference('HYPERRESOLVE',[status(thm)],[3,22,theory(equality)]) ).

cnf(59,plain,
    in('SKOLEMAAAV1'('SKOLEMAAAV10','SKOLEMAAAV11','SKOLEMAAAV12'),'SKOLEMAAAV10'),
    inference('HYPERRESOLVE',[status(thm)],[2,22,theory(equality)]) ).

cnf(62,plain,
    'SKOLEMAAAV12' = ordered_pair('SKOLEMAAAV1'('SKOLEMAAAV10','SKOLEMAAAV11','SKOLEMAAAV12'),'SKOLEMAAAV2'('SKOLEMAAAV10','SKOLEMAAAV11','SKOLEMAAAV12')),
    inference('HYPERRESOLVE',[status(thm)],[4,22,theory(equality)]) ).

cnf(105,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[20,59,58]),62,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SET950+1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.13  % Command  : run-snark %s %d
% 0.12/0.34  % Computer : n014.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jul 10 03:16:05 EDT 2022
% 0.12/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-10T03:16:05
% 0.19/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n014.cluster.edu at 2022-07-10T03:16:05
% 0.19/0.48  
% 0.19/0.48  ; Recognized commutativity assertion (= (|unordered_pair| ?X ?Y) (|unordered_pair| ?Y ?X)).
% 0.19/0.55  ; Declaring unordered_pair to be commutative.
% 0.19/0.55  
% 0.19/0.55  #||
% 0.19/0.55  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.55  % SZS output start Refutation
% See solution above
% 0.19/0.55  ||#
% 0.19/0.55  
% 0.19/0.55  ; Summary of computation:
% 0.19/0.55  ;       280 formulas have been input or derived (from 27 formulas).
% 0.19/0.55  ;       105 (38%) were retained.  Of these,
% 0.19/0.55  ;          105 (100%) are still being kept.
% 0.19/0.55  ; 
% 0.19/0.55  ; Run time in seconds excluding printing time:
% 0.19/0.55  ;     0.003   4%   Read assertion file          (1 call)
% 0.19/0.55  ;     0.001   1%   Assert                       (10 calls)
% 0.19/0.55  ;     0.013  16%   Process new row              (202 calls)
% 0.19/0.55  ;     0.015  19%   Resolution                   (52 calls)
% 0.19/0.55  ;     0.000   0%   Paramodulation               (26 calls)
% 0.19/0.55  ;     0.000   0%   Factoring                    (4 calls)
% 0.19/0.55  ;     0.006   8%   Condensing                   (103 calls)
% 0.19/0.55  ;     0.007   9%   Forward subsumption          (103 calls)
% 0.19/0.55  ;     0.001   1%   Backward subsumption         (65 calls)
% 0.19/0.55  ;     0.001   1%   Clause clause subsumption    (109 calls)
% 0.19/0.55  ;     0.005   6%   Forward simplification       (202 calls)
% 0.19/0.55  ;     0.002   3%   Backward simplification      (105 calls)
% 0.19/0.55  ;     0.002   3%   Ordering                     (316 calls)
% 0.19/0.55  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.19/0.55  ;     0.000   0%   Purity testing               (1 call)
% 0.19/0.55  ;     0.023  29%   Other
% 0.19/0.55  ;     0.079        Total
% 0.19/0.55  ;     0.081        Real time
% 0.19/0.55  ; 
% 0.19/0.55  ; Term-hash-array has 295 terms in all.
% 0.19/0.55  ; Feature-vector-row-index has 65 entries (65 at peak, 65 added, 0 deleted).
% 0.19/0.55  ; Feature-vector-row-index has 374 nodes (374 at peak, 374 added, 0 deleted).
% 0.19/0.55  ;  Retrieved 126 possibly forward subsuming rows in 103 calls.
% 0.19/0.55  ;  Retrieved 15 possibly backward subsumed rows in 65 calls.
% 0.19/0.55  ; Path-index has 301 entries (301 at peak, 301 added, 0 deleted).
% 0.19/0.55  ; Path-index has 956 nodes (956 at peak, 956 added, 0 deleted).
% 0.19/0.55  ; Trie-index has 301 entries (301 at peak, 301 added, 0 deleted).
% 0.19/0.55  ; Trie-index has 1,191 nodes (1,191 at peak, 1,191 added, 0 deleted).
% 0.19/0.55  ; Retrieved 117 generalization terms in 519 calls.
% 0.19/0.55  ; Retrieved 40 instance terms in 39 calls.
% 0.19/0.55  ; Retrieved 7,170 unifiable terms in 619 calls.
% 0.19/0.55  ; 
% 0.19/0.55  ; The agenda of rows to process has 45 entries:
% 0.19/0.55  ;     5 with value 18              1 with value 23               4 with value 34
% 0.19/0.55  ;     8 with value 19              1 with value 25               4 with value 41
% 0.19/0.55  ;     6 with value 20             10 with value 26               2 with value 43
% 0.19/0.55  ;     1 with value 22              1 with value 27               2 with value 50
% 0.19/0.55  ; The agenda of rows to give has 78 entries:
% 0.19/0.55  ;     3 with value (4 11)          1 with value (4 23)           1 with value (4 40)
% 0.19/0.55  ;     1 with value (4 12)          2 with value (4 26)           2 with value (4 41)
% 0.19/0.55  ;     2 with value (4 13)          4 with value (4 29)           4 with value (4 43)
% 0.19/0.55  ;     2 with value (4 14)          2 with value (4 31)           4 with value (4 47)
% 0.19/0.55  ;     8 with value (4 16)          4 with value (4 32)           2 with value (4 49)
% 0.19/0.55  ;     6 with value (4 18)          8 with value (4 34)           2 with value (4 53)
% 0.19/0.55  ;     2 with value (4 19)          1 with value (4 35)           4 with value (4 56)
% 0.19/0.55  ;     4 with value (4 20)          4 with value (4 37)           2 with value (4 65)
% 0.19/0.55  ;     1 with value (4 21)          2 with value (4 38)
% 0.19/0.55  Evaluation took:
% 0.19/0.55    0.081 seconds of real time
% 0.19/0.55    0.070388 seconds of user run time
% 0.19/0.55    0.011022 seconds of system run time
% 0.19/0.55    0 calls to %EVAL
% 0.19/0.55    0 page faults and
% 0.19/0.55    4,573,320 bytes consed.
% 0.19/0.55  :PROOF-FOUND
% 0.19/0.55  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-10T03:16:05
% 0.19/0.55  :PROOF-FOUND
% 0.19/0.55  * 
%------------------------------------------------------------------------------