↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : MSC006-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n015.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 : Sun Jul 17 22:57:58 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(p_transitivity,hypothesis,
    ( ~ p(X,Y)
    | ~ p(Y,Z)
    | p(X,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p_transitivity) ).

cnf(q_transitivity,hypothesis,
    ( ~ q(X,Y)
    | ~ q(Y,Z)
    | q(X,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',q_transitivity) ).

cnf(all_related,hypothesis,
    ( p(X,Y)
    | q(X,Y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',all_related) ).

cnf(p_is_not_total,hypothesis,
    ~ p(a,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p_is_not_total) ).

cnf(prove_q_is_total,negated_conjecture,
    ~ q(c,d),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_q_is_total) ).

cnf(6,plain,
    p(c,d),
    inference('HYPERRESOLVE',[status(thm)],[prove_q_is_total,all_related]) ).

cnf(7,plain,
    p(d,c),
    inference('HYPERRESOLVE',[status(thm)],[prove_q_is_total,all_related]) ).

cnf(10,plain,
    ( p(X,Y)
    | p(Z,Y)
    | q(X,Z) ),
    inference('HYPERRESOLVE',[status(thm)],[q_transitivity,all_related,all_related]) ).

cnf(58,plain,
    ( p(c,X)
    | p(d,X) ),
    inference('HYPERRESOLVE',[status(thm)],[prove_q_is_total,10]) ).

cnf(72,plain,
    p(c,X),
    inference('HYPERRESOLVE',[status(thm)],[p_transitivity,58,6]) ).

cnf(73,plain,
    p(d,X),
    inference('HYPERRESOLVE',[status(thm)],[p_transitivity,72,7]) ).

cnf(74,plain,
    ~ p(a,c),
    inference('UR-RESOLVE',[status(thm)],[p_transitivity,72,p_is_not_total]) ).

cnf(75,plain,
    ~ p(a,d),
    inference('UR-RESOLVE',[status(thm)],[p_transitivity,73,p_is_not_total]) ).

cnf(76,plain,
    q(a,c),
    inference('UR-RESOLVE',[status(thm)],[all_related,74]) ).

cnf(78,plain,
    q(a,d),
    inference('UR-RESOLVE',[status(thm)],[all_related,75]) ).

cnf(81,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[q_transitivity,76,prove_q_is_total]),78]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : MSC006-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % Command  : run-snark %s %d
% 0.13/0.35  % Computer : n015.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Fri Jul  1 16:28:43 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p 2022-07-01T16:28:43
% 0.20/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n015.cluster.edu at 2022-07-01T16:28:43
% 0.20/0.49  
% 0.20/0.49  ; Recognized commutativity assertion (OR (NOT (|q| ?X ?Y)) (|q| ?Y ?X)).
% 0.38/0.61  ; Declaring q to be commutative.
% 0.38/0.61  
% 0.38/0.61  #||
% 0.38/0.61  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.38/0.61  % SZS output start Refutation
% See solution above
% 0.38/0.61  ||#
% 0.38/0.61  
% 0.38/0.61  ; Summary of computation:
% 0.38/0.61  ;       559 formulas have been input or derived (from 29 formulas).
% 0.38/0.61  ;        81 (14%) were retained.  Of these,
% 0.38/0.61  ;            9 (11%) were simplified or subsumed later,
% 0.38/0.61  ;           72 (89%) are still being kept.
% 0.38/0.61  ; 
% 0.38/0.61  ; Run time in seconds excluding printing time:
% 0.38/0.61  ;     0.002   2%   Read assertion file          (1 call)
% 0.38/0.61  ;     0.000   0%   Assert                       (6 calls)
% 0.38/0.61  ;     0.007   5%   Process new row              (483 calls)
% 0.38/0.61  ;     0.011   8%   Resolution                   (56 calls)
% 0.38/0.61  ;     0.000   0%   Paramodulation               (28 calls)
% 0.38/0.61  ;     0.000   0%   Factoring                    (12 calls)
% 0.38/0.61  ;     0.009   7%   Condensing                   (283 calls)
% 0.38/0.61  ;     0.018  14%   Forward subsumption          (283 calls)
% 0.38/0.61  ;     0.003   2%   Backward subsumption         (62 calls)
% 0.38/0.61  ;     0.053  40%   Clause clause subsumption    (2,696 calls)
% 0.38/0.61  ;     0.001   1%   Forward simplification       (464 calls)
% 0.38/0.61  ;     0.000   0%   Backward simplification      (81 calls)
% 0.38/0.61  ;     0.001   1%   Ordering                     (608 calls)
% 0.38/0.61  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.38/0.61  ;     0.000   0%   Purity testing               (1 call)
% 0.38/0.61  ;     0.026  20%   Other
% 0.38/0.61  ;     0.131        Total
% 0.38/0.61  ;     0.136        Real time
% 0.38/0.61  ; 
% 0.38/0.61  ; Term-hash-array has 58 terms in all.
% 0.38/0.61  ; Feature-vector-row-index has 57 entries (62 at peak, 62 added, 5 deleted).
% 0.38/0.61  ; Feature-vector-row-index has 18 nodes (24 at peak, 24 added, 6 deleted).
% 0.38/0.61  ;  Retrieved 4,754 possibly forward subsuming rows in 283 calls.
% 0.38/0.61  ;  Retrieved 436 possibly backward subsumed rows in 62 calls.
% 0.38/0.61  ; Path-index has 55 entries (55 at peak, 62 added, 7 deleted).
% 0.38/0.61  ; Path-index has 24 nodes (24 at peak, 26 added, 2 deleted).
% 0.38/0.61  ; Trie-index has 55 entries (55 at peak, 62 added, 7 deleted).
% 0.38/0.61  ; Trie-index has 40 nodes (40 at peak, 46 added, 6 deleted).
% 0.38/0.61  ; Retrieved 186 generalization terms in 1,213 calls.
% 0.38/0.61  ; Retrieved 28 instance terms in 18 calls.
% 0.38/0.61  ; Retrieved 1,626 unifiable terms in 309 calls.
% 0.38/0.61  ; 
% 0.38/0.61  ; The agenda of rows to process has 50 entries:
% 0.38/0.61  ;     8 with value 10             26 with value 14              16 with value 18
% 0.38/0.61  ; The agenda of rows to give has 51 entries:
% 0.38/0.61  ;     1 with value (4 9)          12 with value (4 15)          24 with value (4 19)
% 0.38/0.61  ;     3 with value (4 10)          4 with value (4 18)           6 with value (4 22)
% 0.38/0.61  ;     1 with value (4 13)
% 0.38/0.61  Evaluation took:
% 0.38/0.61    0.136 seconds of real time
% 0.38/0.61    0.113866 seconds of user run time
% 0.38/0.61    0.022465 seconds of system run time
% 0.38/0.61    [Run times include 0.004 seconds GC run time.]
% 0.38/0.61    0 calls to %EVAL
% 0.38/0.61    0 page faults and
% 0.38/0.61    12,820,904 bytes consed.
% 0.38/0.61  :PROOF-FOUND
% 0.38/0.61  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-01T16:28:43
% 0.38/0.61  :PROOF-FOUND
% 0.38/0.61  * 
%------------------------------------------------------------------------------