↑ Up

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

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

% Computer : n007.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:06:04 EDT 2022

% Result   : Unsatisfiable 0.40s 0.62s
% Output   : Refutation 0.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    5
% Syntax   : Number of clauses     :    8 (   7 unt;   0 nHn;   4 RR)
%            Number of literals    :   10 (   1 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    :    6 (   6 usr;   3 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/sandbox2/benchmark/Axioms/SET004-0.ax',subclass_members) ).

cnf(class_elements_are_sets,axiom,
    subclass(X,universal_class),
    file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/SET004-0.ax',ordered_pair) ).

cnf(prove_ordered_pair_is_set_1,negated_conjecture,
    ~ member(ordered_pair(x,y),universal_class),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_ordered_pair_is_set_1) ).

cnf(131,plain,
    ~ member(ordered_pair(x,y),X),
    inference('UR-RESOLVE',[status(thm)],[subclass_members,class_elements_are_sets,prove_ordered_pair_is_set_1]) ).

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

cnf(437,plain,
    $false,
    inference('HYPERRESOLVE',[status(thm)],[131,171]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SET025-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.06/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n007.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 05:44:32 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.46  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.47  * 
% 0.20/0.47  * 
% 0.20/0.47  #<PACKAGE "SNARK-USER">
% 0.20/0.47  * 
% 0.20/0.47  SNARK-TPTP-OPTIONS
% 0.20/0.47  * 
% 0.20/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47   (USE-FACTORING :POS)
% 0.20/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47  * 
% 0.20/0.47  "."
% 0.20/0.47  * 
% 0.20/0.47  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-10T05:44:32
% 0.20/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n007.cluster.edu at 2022-07-10T05:44:32
% 0.40/0.62  
% 0.40/0.62  
% 0.40/0.62  #||
% 0.40/0.62  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.40/0.62  % SZS output start Refutation
% See solution above
% 0.40/0.62  ||#
% 0.40/0.62  
% 0.40/0.62  ; Summary of computation:
% 0.40/0.62  ;       911 formulas have been input or derived (from 107 formulas).
% 0.40/0.62  ;       437 (48%) were retained.  Of these,
% 0.40/0.62  ;           17 ( 4%) were simplified or subsumed later,
% 0.40/0.62  ;          420 (96%) are still being kept.
% 0.40/0.62  ; 
% 0.40/0.62  ; Run time in seconds excluding printing time:
% 0.40/0.62  ;     0.017  12%   Read assertion file          (1 call)
% 0.40/0.62  ;     0.003   2%   Assert                       (92 calls)
% 0.40/0.62  ;     0.035  25%   Process new row              (751 calls)
% 0.40/0.62  ;     0.020  14%   Resolution                   (212 calls)
% 0.40/0.62  ;     0.006   4%   Paramodulation               (106 calls)
% 0.40/0.62  ;     0.000   0%   Factoring                    (3 calls)
% 0.40/0.62  ;     0.003   2%   Condensing                   (199 calls)
% 0.40/0.62  ;     0.009   6%   Forward subsumption          (199 calls)
% 0.40/0.62  ;     0.008   6%   Backward subsumption         (186 calls)
% 0.40/0.62  ;     0.001   1%   Clause clause subsumption    (109 calls)
% 0.40/0.62  ;     0.009   6%   Forward simplification       (751 calls)
% 0.40/0.62  ;     0.004   3%   Backward simplification      (425 calls)
% 0.40/0.62  ;     0.001   1%   Ordering                     (379 calls)
% 0.40/0.62  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.40/0.62  ;     0.000   0%   Purity testing               (1 call)
% 0.40/0.62  ;     0.026  18%   Other
% 0.40/0.62  ;     0.142        Total
% 0.40/0.62  ;     0.143        Real time
% 0.40/0.62  ; 
% 0.40/0.62  ; Term-hash-array has 1,028 terms in all.
% 0.40/0.62  ; Feature-vector-row-index has 186 entries (186 at peak, 186 added, 0 deleted).
% 0.40/0.62  ; Feature-vector-row-index has 1,225 nodes (1,225 at peak, 1,225 added, 0 deleted).
% 0.40/0.62  ;  Retrieved 100 possibly forward subsuming rows in 199 calls.
% 0.40/0.62  ;  Retrieved 34 possibly backward subsumed rows in 186 calls.
% 0.40/0.62  ; Path-index has 1,030 entries (1,030 at peak, 1,038 added, 8 deleted).
% 0.40/0.62  ; Path-index has 2,932 nodes (2,932 at peak, 2,939 added, 7 deleted).
% 0.40/0.62  ; Trie-index has 1,030 entries (1,030 at peak, 1,038 added, 8 deleted).
% 0.40/0.62  ; Trie-index has 3,368 nodes (3,368 at peak, 3,381 added, 13 deleted).
% 0.40/0.62  ; Retrieved 587 generalization terms in 1,873 calls.
% 0.40/0.62  ; Retrieved 260 instance terms in 238 calls.
% 0.40/0.62  ; Retrieved 16,632 unifiable terms in 1,272 calls.
% 0.40/0.62  ; 
% 0.40/0.62  ; The agenda of rows to process has 70 entries:
% 0.40/0.62  ;     1 with value 6               1 with value 12               2 with value 17
% 0.40/0.62  ;     5 with value 9              12 with value 14               2 with value 19
% 0.40/0.62  ;     2 with value 10             16 with value 15               1 with value 21
% 0.40/0.62  ;     6 with value 11             21 with value 16               1 with value 25
% 0.40/0.62  ; The agenda of rows to give has 314 entries:
% 0.40/0.62  ;     4 with value (4 8)           3 with value (4 20)           2 with value (4 34)
% 0.40/0.62  ;     9 with value (4 9)           5 with value (4 21)           2 with value (4 37)
% 0.40/0.62  ;    24 with value (4 10)          3 with value (4 22)           1 with value (4 43)
% 0.40/0.62  ;    19 with value (4 11)          7 with value (4 23)           1 with value (4 44)
% 0.40/0.62  ;    21 with value (4 12)          5 with value (4 24)           1 with value (4 45)
% 0.40/0.62  ;    27 with value (4 13)          1 with value (4 25)           3 with value (4 46)
% 0.40/0.62  ;    45 with value (4 14)          4 with value (4 26)           1 with value (4 49)
% 0.40/0.62  ;    45 with value (4 15)          3 with value (4 29)           1 with value (4 51)
% 0.40/0.62  ;    23 with value (4 16)          3 with value (4 30)           1 with value (4 53)
% 0.40/0.62  ;     6 with value (4 17)          1 with value (4 31)           1 with value (4 59)
% 0.40/0.62  ;    20 with value (4 18)          1 with value (4 32)           1 with value (4 63)
% 0.40/0.62  ;    18 with value (4 19)          2 with value (4 33)
% 0.40/0.62  Evaluation took:
% 0.40/0.62    0.144 seconds of real time
% 0.40/0.62    0.127491 seconds of user run time
% 0.40/0.62    0.016175 seconds of system run time
% 0.40/0.62    0 calls to %EVAL
% 0.40/0.62    0 page faults and
% 0.40/0.62    8,000,656 bytes consed.
% 0.40/0.62  :PROOF-FOUND
% 0.40/0.62  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-10T05:44:32
% 0.40/0.62  :PROOF-FOUND
% 0.40/0.62  * 
%------------------------------------------------------------------------------