↑ Up

SNARK---20120808r022.THM-Ref.s

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

% Computer : n029.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 : Mon Jul 18 16:48:44 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(6,axiom,
    ( ~ object(X)
    | ~ property(Y)
    | ~ object(Z)
    | ~ is_the(X,Y)
    | X != Z
    | exemplifies_property(Y,Z) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lemma_1) ).

cnf(7,negated_conjecture,
    property('SKOLEMAAAW1'),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_theorem_2) ).

cnf(10,negated_conjecture,
    object('SKOLEMAAAW3'),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_theorem_2) ).

cnf(11,negated_conjecture,
    is_the('SKOLEMAAAW3','SKOLEMAAAW1'),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_theorem_2) ).

cnf(12,negated_conjecture,
    ~ exemplifies_property('SKOLEMAAAW1','SKOLEMAAAW3'),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_theorem_2) ).

cnf(16,plain,
    $false,
    inference('UR-RESOLVE',[status(thm)],[6,10,7,10,11,12,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : PHI011+1 : TPTP v8.1.0. Released v7.2.0.
% 0.03/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n029.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 : Thu Jun  2 01:03:16 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.45  /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-06-02T01:03:16
% 0.20/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n029.cluster.edu at 2022-06-02T01:03:16
% 0.20/0.50  
% 0.20/0.50  
% 0.20/0.50  #||
% 0.20/0.50  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.50  % SZS output start Refutation
% See solution above
% 0.20/0.50  ||#
% 0.20/0.50  
% 0.20/0.50  ; Summary of computation:
% 0.20/0.50  ;        35 formulas have been input or derived (from 13 formulas).
% 0.20/0.50  ;        16 (46%) were retained.  Of these,
% 0.20/0.50  ;           16 (100%) are still being kept.
% 0.20/0.50  ; 
% 0.20/0.50  ; Run time in seconds excluding printing time:
% 0.20/0.50  ;     0.002   7%   Read assertion file          (1 call)
% 0.20/0.50  ;     0.001   4%   Assert                       (5 calls)
% 0.20/0.50  ;     0.001   4%   Process new row              (21 calls)
% 0.20/0.50  ;     0.001   4%   Resolution                   (24 calls)
% 0.20/0.50  ;     0.000   0%   Paramodulation               (12 calls)
% 0.20/0.50  ;     0.000   0%   Condensing                   (6 calls)
% 0.20/0.50  ;     0.000   0%   Forward subsumption          (6 calls)
% 0.20/0.50  ;     0.000   0%   Backward subsumption         (6 calls)
% 0.20/0.50  ;     0.000   0%   Clause clause subsumption    (1 call)
% 0.20/0.50  ;     0.000   0%   Forward simplification       (21 calls)
% 0.20/0.50  ;     0.000   0%   Backward simplification      (16 calls)
% 0.20/0.50  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.20/0.50  ;     0.000   0%   Purity testing               (1 call)
% 0.20/0.50  ;     0.022  81%   Other
% 0.20/0.50  ;     0.027        Total
% 0.20/0.50  ;     0.029        Real time
% 0.20/0.50  ; 
% 0.20/0.50  ; Term-hash-array has 18 terms in all.
% 0.20/0.50  ; Feature-vector-row-index has 6 entries (6 at peak, 6 added, 0 deleted).
% 0.20/0.50  ; Feature-vector-row-index has 13 nodes (13 at peak, 13 added, 0 deleted).
% 0.20/0.50  ;  Retrieved 1 possibly forward subsuming row in 6 calls.
% 0.20/0.50  ;  Retrieved 0 possibly backward subsumed rows in 6 calls.
% 0.20/0.50  ; Path-index has 21 entries (21 at peak, 21 added, 0 deleted).
% 0.20/0.50  ; Path-index has 31 nodes (31 at peak, 31 added, 0 deleted).
% 0.20/0.50  ; Trie-index has 21 entries (21 at peak, 21 added, 0 deleted).
% 0.20/0.50  ; Trie-index has 29 nodes (29 at peak, 29 added, 0 deleted).
% 0.20/0.50  ; Retrieved 5 generalization terms in 10 calls.
% 0.20/0.50  ; Retrieved 9 instance terms in 9 calls.
% 0.20/0.50  ; Retrieved 175 unifiable terms in 121 calls.
% 0.20/0.50  ; 
% 0.20/0.50  ; The agenda of rows to process has 10 entries:
% 0.20/0.50  ;     3 with value 4               7 with value 5
% 0.20/0.50  ; The agenda of rows to give has 3 entries:
% 0.20/0.50  ;     3 with value (4 4)
% 0.20/0.50  Evaluation took:
% 0.20/0.50    0.029 seconds of real time
% 0.20/0.50    0.026055 seconds of user run time
% 0.20/0.50    0.002852 seconds of system run time
% 0.20/0.50    0 calls to %EVAL
% 0.20/0.50    0 page faults and
% 0.20/0.50    1,551,424 bytes consed.
% 0.20/0.50  :PROOF-FOUND
% 0.20/0.50  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-02T01:03:16
% 0.20/0.50  :PROOF-FOUND
% 0.20/0.50  * 
%------------------------------------------------------------------------------