↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : SET117-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:07:35 EDT 2022

% Result   : Unsatisfiable 0.13s 0.51s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    6
% Syntax   : Number of clauses     :    9 (   8 unt;   0 nHn;   5 RR)
%            Number of literals    :   11 (   2 equ;   4 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;   2 con; 0-2 aty)
%            Number of variables   :   11 (   6 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(unordered_pairs_in_universal,axiom,
    member(unordered_pair(X,Y),universal_class),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',unordered_pairs_in_universal) ).

cnf(ordered_pair,axiom,
    unordered_pair(singleton(X),unordered_pair(X,singleton(Y))) = ordered_pair(X,Y),
    file('/export/starexec/sandbox/benchmark/Axioms/SET004-0.ax',ordered_pair) ).

cnf(prove_corollary_1_to_ordered_pairs_are_sets_1,negated_conjecture,
    ordered_pair(first(x),second(x)) = x,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_1_to_ordered_pairs_are_sets_1) ).

cnf(prove_corollary_1_to_ordered_pairs_are_sets_2,negated_conjecture,
    ~ member(x,universal_class),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_corollary_1_to_ordered_pairs_are_sets_2) ).

cnf(133,plain,
    ~ member(x,X),
    inference('UR-RESOLVE',[status(thm)],[subclass_members,class_elements_are_sets,prove_corollary_1_to_ordered_pairs_are_sets_2]) ).

cnf(173,plain,
    member(ordered_pair(X,Y),universal_class),
    inference('PARAMODULATE',[status(thm)],[unordered_pairs_in_universal,ordered_pair,theory(equality)]) ).

cnf(445,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[173,prove_corollary_1_to_ordered_pairs_are_sets_1,theory(equality)]),133]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08  % Problem  : SET117-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.00/0.09  % Command  : run-snark %s %d
% 0.09/0.28  % Computer : n026.cluster.edu
% 0.09/0.28  % Model    : x86_64 x86_64
% 0.09/0.28  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28  % Memory   : 8042.1875MB
% 0.09/0.28  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28  % CPULimit : 300
% 0.09/0.28  % WCLimit  : 600
% 0.09/0.28  % DateTime : Mon Jul 11 10:54:27 EDT 2022
% 0.09/0.28  % CPUTime  : 
% 0.13/0.36  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.37  * 
% 0.13/0.37  * 
% 0.13/0.37  #<PACKAGE "SNARK-USER">
% 0.13/0.37  * 
% 0.13/0.38  SNARK-TPTP-OPTIONS
% 0.13/0.38  * 
% 0.13/0.38  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.13/0.38   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.13/0.38   (USE-FACTORING :POS)
% 0.13/0.38   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.13/0.38   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.13/0.38   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.13/0.38   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.13/0.38   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.13/0.38   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.13/0.38   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.13/0.38   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.13/0.38   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.13/0.38   (DECLARE-TPTP-SYMBOLS2))
% 0.13/0.38  * 
% 0.13/0.38  "."
% 0.13/0.38  * 
% 0.13/0.38  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-11T10:54:27
% 0.13/0.38  ; 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-11T10:54:27
% 0.13/0.51  
% 0.13/0.51  
% 0.13/0.51  #||
% 0.13/0.51  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.51  % SZS output start Refutation
% See solution above
% 0.13/0.51  ||#
% 0.13/0.51  
% 0.13/0.51  ; Summary of computation:
% 0.13/0.51  ;       918 formulas have been input or derived (from 108 formulas).
% 0.13/0.51  ;       445 (48%) were retained.  Of these,
% 0.13/0.51  ;           20 ( 4%) were simplified or subsumed later,
% 0.13/0.51  ;          425 (96%) are still being kept.
% 0.13/0.51  ; 
% 0.13/0.51  ; Run time in seconds excluding printing time:
% 0.13/0.51  ;     0.016  12%   Read assertion file          (1 call)
% 0.13/0.51  ;     0.002   2%   Assert                       (93 calls)
% 0.13/0.51  ;     0.035  27%   Process new row              (772 calls)
% 0.13/0.51  ;     0.023  18%   Resolution                   (214 calls)
% 0.13/0.51  ;     0.003   2%   Paramodulation               (107 calls)
% 0.13/0.51  ;     0.000   0%   Factoring                    (3 calls)
% 0.13/0.51  ;     0.004   3%   Condensing                   (206 calls)
% 0.13/0.51  ;     0.010   8%   Forward subsumption          (206 calls)
% 0.13/0.51  ;     0.004   3%   Backward subsumption         (193 calls)
% 0.13/0.51  ;     0.001   1%   Clause clause subsumption    (117 calls)
% 0.13/0.51  ;     0.008   6%   Forward simplification       (772 calls)
% 0.13/0.51  ;     0.004   3%   Backward simplification      (433 calls)
% 0.13/0.51  ;     0.002   2%   Ordering                     (400 calls)
% 0.13/0.51  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.13/0.51  ;     0.000   0%   Purity testing               (1 call)
% 0.13/0.51  ;     0.018  14%   Other
% 0.13/0.51  ;     0.130        Total
% 0.13/0.51  ;     0.132        Real time
% 0.13/0.51  ; 
% 0.13/0.51  ; Term-hash-array has 1,051 terms in all.
% 0.13/0.51  ; Feature-vector-row-index has 190 entries (190 at peak, 193 added, 3 deleted).
% 0.13/0.51  ; Feature-vector-row-index has 1,300 nodes (1,300 at peak, 1,342 added, 42 deleted).
% 0.13/0.51  ;  Retrieved 108 possibly forward subsuming rows in 206 calls.
% 0.13/0.51  ;  Retrieved 34 possibly backward subsumed rows in 193 calls.
% 0.13/0.51  ; Path-index has 1,049 entries (1,049 at peak, 1,060 added, 11 deleted).
% 0.13/0.51  ; Path-index has 2,943 nodes (2,943 at peak, 2,952 added, 9 deleted).
% 0.13/0.51  ; Trie-index has 1,049 entries (1,049 at peak, 1,060 added, 11 deleted).
% 0.13/0.51  ; Trie-index has 3,419 nodes (3,419 at peak, 3,441 added, 22 deleted).
% 0.13/0.51  ; Retrieved 611 generalization terms in 1,944 calls.
% 0.13/0.51  ; Retrieved 263 instance terms in 239 calls.
% 0.13/0.51  ; Retrieved 16,883 unifiable terms in 1,266 calls.
% 0.13/0.51  ; 
% 0.13/0.51  ; The agenda of rows to process has 63 entries:
% 0.13/0.51  ;     1 with value 9              12 with value 14               2 with value 19
% 0.13/0.51  ;     1 with value 10             16 with value 15               1 with value 21
% 0.13/0.51  ;     6 with value 11             21 with value 16               1 with value 25
% 0.13/0.51  ;     1 with value 12              1 with value 17
% 0.13/0.51  ; The agenda of rows to give has 318 entries:
% 0.13/0.51  ;     4 with value (4 8)           3 with value (4 20)           2 with value (4 34)
% 0.13/0.51  ;    10 with value (4 9)           5 with value (4 21)           2 with value (4 37)
% 0.13/0.51  ;    24 with value (4 10)          5 with value (4 22)           2 with value (4 39)
% 0.13/0.51  ;    22 with value (4 11)          7 with value (4 23)           1 with value (4 43)
% 0.13/0.51  ;    20 with value (4 12)          5 with value (4 24)           1 with value (4 44)
% 0.13/0.51  ;    27 with value (4 13)          1 with value (4 25)           1 with value (4 45)
% 0.13/0.51  ;    42 with value (4 14)          4 with value (4 26)           3 with value (4 46)
% 0.13/0.51  ;    45 with value (4 15)          3 with value (4 29)           1 with value (4 49)
% 0.13/0.51  ;    23 with value (4 16)          3 with value (4 30)           1 with value (4 51)
% 0.13/0.51  ;     6 with value (4 17)          1 with value (4 31)           1 with value (4 53)
% 0.13/0.51  ;    20 with value (4 18)          1 with value (4 32)           1 with value (4 59)
% 0.13/0.51  ;    18 with value (4 19)          2 with value (4 33)           1 with value (4 63)
% 0.13/0.51  Evaluation took:
% 0.13/0.51    0.132 seconds of real time
% 0.13/0.51    0.121646 seconds of user run time
% 0.13/0.51    0.010024 seconds of system run time
% 0.13/0.51    0 calls to %EVAL
% 0.13/0.51    0 page faults and
% 0.13/0.51    8,260,800 bytes consed.
% 0.13/0.51  :PROOF-FOUND
% 0.13/0.51  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-11T10:54:27
% 0.13/0.51  :PROOF-FOUND
% 0.13/0.51  * 
%------------------------------------------------------------------------------