↑ Up

SNARK---20120808r022.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : SET167-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n026.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:08:00 EDT 2022

% Result   : Unsatisfiable 0.41s 0.59s
% Output   : Refutation 0.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   14 (  10 unt;   1 nHn;  11 RR)
%            Number of literals    :   20 (   1 equ;  10 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   14 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(subclass_members,axiom,
    ( ~ subclass(X,Y)
    | ~ member(Z,X)
    | member(Z,Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',subclass_members) ).

cnf(class_elements_are_sets,axiom,
    subclass(X,universal_class),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',class_elements_are_sets) ).

cnf(intersection1,axiom,
    ( ~ member(X,intersection(Y,Z))
    | member(X,Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',intersection1) ).

cnf(complement1,axiom,
    ( ~ member(X,complement(Y))
    | ~ member(X,Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement1) ).

cnf(complement2,axiom,
    ( ~ member(X,universal_class)
    | member(X,complement(Y))
    | member(X,Y) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',complement2) ).

cnf(union,axiom,
    complement(intersection(complement(X),complement(Y))) = union(X,Y),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',union) ).

cnf(prove_members_of_union2_1,negated_conjecture,
    member(x,y),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_members_of_union2_1) ).

cnf(prove_members_of_union2_2,negated_conjecture,
    ~ member(x,union(y,z)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_members_of_union2_2) ).

cnf(129,plain,
    ~ member(x,complement(intersection(complement(y),complement(z)))),
    inference('REWRITE',[status(thm)],[prove_members_of_union2_2,union,theory(equality)]) ).

cnf(134,plain,
    ~ member(x,complement(y)),
    inference('UR-RESOLVE',[status(thm)],[complement1,prove_members_of_union2_1]) ).

cnf(155,plain,
    member(x,universal_class),
    inference('HYPERRESOLVE',[status(thm)],[subclass_members,class_elements_are_sets,prove_members_of_union2_1]) ).

cnf(327,plain,
    member(x,intersection(complement(y),complement(z))),
    inference('UR-RESOLVE',[status(thm)],[complement2,155,129]) ).

cnf(395,plain,
    ~ member(x,intersection(complement(y),X)),
    inference('UR-RESOLVE',[status(thm)],[intersection1,134]) ).

cnf(396,plain,
    $false,
    inference('REWRITE',[status(thm)],[327,395]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11  % Problem  : SET167-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.04/0.12  % Command  : run-snark %s %d
% 0.12/0.33  % Computer : n026.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sun Jul 10 02:00:41 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.45  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.45  * 
% 0.19/0.46  * 
% 0.19/0.46  #<PACKAGE "SNARK-USER">
% 0.19/0.46  * 
% 0.19/0.46  SNARK-TPTP-OPTIONS
% 0.19/0.46  * 
% 0.19/0.46  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.46   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.46   (USE-FACTORING :POS)
% 0.19/0.46   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.46   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.46   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.46   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.46   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.46   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.46   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.46   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.46   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.46   (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.46  * 
% 0.19/0.46  "."
% 0.19/0.46  * 
% 0.19/0.46  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-10T02:00:41
% 0.19/0.46  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n026.cluster.edu at 2022-07-10T02:00:41
% 0.41/0.59  
% 0.41/0.59  
% 0.41/0.59  #||
% 0.41/0.59  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.59  % SZS output start Refutation
% See solution above
% 0.41/0.59  ||#
% 0.41/0.59  
% 0.41/0.59  ; Summary of computation:
% 0.41/0.59  ;       700 formulas have been input or derived (from 121 formulas).
% 0.41/0.59  ;       396 (57%) were retained.  Of these,
% 0.41/0.59  ;           18 ( 5%) were simplified or subsumed later,
% 0.41/0.59  ;          378 (95%) are still being kept.
% 0.41/0.59  ; 
% 0.41/0.59  ; Run time in seconds excluding printing time:
% 0.41/0.59  ;     0.021  16%   Read assertion file          (1 call)
% 0.41/0.59  ;     0.004   3%   Assert                       (114 calls)
% 0.41/0.59  ;     0.028  22%   Process new row              (637 calls)
% 0.41/0.59  ;     0.015  12%   Resolution                   (240 calls)
% 0.41/0.59  ;     0.006   5%   Paramodulation               (120 calls)
% 0.41/0.59  ;     0.000   0%   Factoring                    (3 calls)
% 0.41/0.59  ;     0.002   2%   Condensing                   (215 calls)
% 0.41/0.59  ;     0.005   4%   Forward subsumption          (215 calls)
% 0.41/0.59  ;     0.003   2%   Backward subsumption         (198 calls)
% 0.41/0.59  ;     0.001   1%   Clause clause subsumption    (111 calls)
% 0.41/0.59  ;     0.009   7%   Forward simplification       (637 calls)
% 0.41/0.59  ;     0.004   3%   Backward simplification      (380 calls)
% 0.41/0.59  ;     0.000   0%   Ordering                     (395 calls)
% 0.41/0.59  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.41/0.59  ;     0.000   0%   Purity testing               (1 call)
% 0.41/0.59  ;     0.030  23%   Other
% 0.41/0.59  ;     0.128        Total
% 0.41/0.59  ;     0.130        Real time
% 0.41/0.59  ; 
% 0.41/0.59  ; Term-hash-array has 986 terms in all.
% 0.41/0.59  ; Feature-vector-row-index has 198 entries (198 at peak, 198 added, 0 deleted).
% 0.41/0.59  ; Feature-vector-row-index has 1,353 nodes (1,353 at peak, 1,353 added, 0 deleted).
% 0.41/0.59  ;  Retrieved 113 possibly forward subsuming rows in 215 calls.
% 0.41/0.59  ;  Retrieved 29 possibly backward subsumed rows in 198 calls.
% 0.41/0.59  ; Path-index has 999 entries (1,000 at peak, 1,001 added, 2 deleted).
% 0.41/0.59  ; Path-index has 3,271 nodes (3,272 at peak, 3,273 added, 2 deleted).
% 0.41/0.59  ; Trie-index has 999 entries (1,000 at peak, 1,001 added, 2 deleted).
% 0.41/0.59  ; Trie-index has 3,392 nodes (3,394 at peak, 3,395 added, 3 deleted).
% 0.41/0.59  ; Retrieved 479 generalization terms in 1,694 calls.
% 0.41/0.59  ; Retrieved 206 instance terms in 181 calls.
% 0.41/0.59  ; Retrieved 11,372 unifiable terms in 1,129 calls.
% 0.41/0.59  ; 
% 0.41/0.59  ; The agenda of rows to process has 3 entries:
% 0.41/0.59  ;     1 with value 11              2 with value 13
% 0.41/0.59  ; The agenda of rows to give has 257 entries:
% 0.41/0.59  ;     3 with value (4 7)           5 with value (4 20)           3 with value (4 34)
% 0.41/0.59  ;    15 with value (4 8)           4 with value (4 21)           2 with value (4 37)
% 0.41/0.59  ;    14 with value (4 9)           4 with value (4 22)           1 with value (4 43)
% 0.41/0.59  ;    19 with value (4 10)          5 with value (4 23)           1 with value (4 44)
% 0.41/0.59  ;    21 with value (4 11)          5 with value (4 24)           1 with value (4 45)
% 0.41/0.59  ;    19 with value (4 12)          5 with value (4 26)           4 with value (4 46)
% 0.41/0.59  ;    27 with value (4 13)          1 with value (4 27)           2 with value (4 49)
% 0.41/0.59  ;    15 with value (4 14)          2 with value (4 28)           1 with value (4 51)
% 0.41/0.59  ;    14 with value (4 15)          3 with value (4 29)           1 with value (4 53)
% 0.41/0.59  ;    16 with value (4 16)          3 with value (4 30)           1 with value (4 55)
% 0.41/0.59  ;     9 with value (4 17)          1 with value (4 31)           1 with value (4 59)
% 0.41/0.59  ;    13 with value (4 18)          1 with value (4 32)           1 with value (4 63)
% 0.41/0.59  ;    12 with value (4 19)          2 with value (4 33)
% 0.41/0.59  Evaluation took:
% 0.41/0.59    0.131 seconds of real time
% 0.41/0.59    0.120479 seconds of user run time
% 0.41/0.59    0.010074 seconds of system run time
% 0.41/0.59    0 calls to %EVAL
% 0.41/0.59    0 page faults and
% 0.41/0.59    8,275,632 bytes consed.
% 0.41/0.59  :PROOF-FOUND
% 0.41/0.59  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-10T02:00:41
% 0.41/0.59  :PROOF-FOUND
% 0.41/0.59  * 
%------------------------------------------------------------------------------