↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : SWV069+1 : TPTP v8.1.0. Bugfixed v3.3.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 : Wed Jul 20 21:31:42 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(4,axiom,
    leq(X,X),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',reflexivity_leq) ).

cnf(10,axiom,
    ( ~ gt(X,Y)
    | leq(Y,X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).

cnf(236,axiom,
    minus(X,n1) = pred(X),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).

cnf(237,axiom,
    pred(succ(X)) = X,
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_succ) ).

cnf(256,negated_conjecture,
    leq(n0,pv10),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_array_0010) ).

cnf(257,negated_conjecture,
    leq(pv10,minus(n135300,n1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_array_0010) ).

cnf(258,plain,
    leq(pv10,pred(n135300)),
    inference('REWRITE',[status(thm)],[257,236,theory(equality)]) ).

cnf(259,negated_conjecture,
    ( ~ leq(n0,n0)
    | ~ leq(n0,pv10)
    | ~ leq(n0,minus(n5,n1))
    | ~ leq(pv10,minus(n135300,n1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_array_0010) ).

cnf(260,plain,
    ~ leq(n0,pred(n5)),
    inference('REWRITE',[status(thm)],[259,258,236,256,4,theory(equality)]) ).

cnf(271,axiom,
    gt(n4,n0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gt_4_0) ).

cnf(295,axiom,
    succ(succ(succ(succ(n0)))) = n4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_4) ).

cnf(296,axiom,
    succ(succ(succ(succ(succ(n0))))) = n5,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_5) ).

cnf(297,plain,
    succ(n4) = n5,
    inference('REWRITE',[status(thm)],[296,295,theory(equality)]) ).

cnf(360,plain,
    leq(n0,n4),
    inference('HYPERRESOLVE',[status(thm)],[10,271]) ).

cnf(368,plain,
    pred(n5) = n4,
    inference('PARAMODULATE',[status(thm)],[237,297,theory(equality)]) ).

cnf(369,plain,
    $false,
    inference('REWRITE',[status(thm)],[260,360,368,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.12  % Problem  : SWV069+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.12/0.13  % Command  : run-snark %s %d
% 0.12/0.34  % Computer : n026.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Wed Jun 15 19:56:22 EDT 2022
% 0.19/0.34  % CPUTime  : 
% 0.19/0.46  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47  * 
% 0.19/0.47  * 
% 0.19/0.47  #<PACKAGE "SNARK-USER">
% 0.19/0.47  * 
% 0.19/0.47  SNARK-TPTP-OPTIONS
% 0.19/0.47  * 
% 0.19/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47   (USE-FACTORING :POS)
% 0.19/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47  * 
% 0.19/0.47  "."
% 0.19/0.47  * 
% 0.19/0.47  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-15T19:56:22
% 0.19/0.47  ; 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-06-15T19:56:22
% 0.19/0.52  WARNING:
% 0.19/0.52     #:|true| is a proposition that occurs only positively; disabling rows that contain it.
% 0.47/0.69  
% 0.47/0.69  
% 0.47/0.69  #||
% 0.47/0.69  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.69  % SZS output start Refutation
% See solution above
% 0.47/0.69  ||#
% 0.47/0.69  
% 0.47/0.69  ; Summary of computation:
% 0.47/0.69  ;       457 formulas have been input or derived (from 53 formulas).
% 0.47/0.69  ;       369 (81%) were retained.  Of these,
% 0.47/0.69  ;           10 ( 3%) were simplified or subsumed later,
% 0.47/0.69  ;          359 (97%) are still being kept.
% 0.47/0.69  ; 
% 0.47/0.69  ; Run time in seconds excluding printing time:
% 0.47/0.69  ;     0.021  10%   Read assertion file          (1 call)
% 0.47/0.69  ;     0.011   5%   Assert                       (92 calls)
% 0.47/0.69  ;     0.049  22%   Process new row              (442 calls)
% 0.47/0.69  ;     0.005   2%   Resolution                   (104 calls)
% 0.47/0.69  ;     0.000   0%   Paramodulation               (52 calls)
% 0.47/0.69  ;     0.026  12%   Condensing                   (238 calls)
% 0.47/0.69  ;     0.048  22%   Forward subsumption          (238 calls)
% 0.47/0.69  ;     0.010   5%   Backward subsumption         (238 calls)
% 0.47/0.69  ;     0.010   5%   Clause clause subsumption    (783 calls)
% 0.47/0.69  ;     0.015   7%   Forward simplification       (441 calls)
% 0.47/0.69  ;     0.000   0%   Backward simplification      (363 calls)
% 0.47/0.69  ;     0.002   1%   Ordering                     (564 calls)
% 0.47/0.69  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.47/0.69  ;     0.001   0%   Purity testing               (1 call)
% 0.47/0.69  ;     0.020   9%   Other
% 0.47/0.69  ;     0.218        Total
% 0.47/0.69  ;     0.219        Real time
% 0.47/0.69  ; 
% 0.47/0.69  ; Term-hash-array has 507 terms in all.
% 0.47/0.69  ; Feature-vector-row-index has 238 entries (238 at peak, 238 added, 0 deleted).
% 0.47/0.69  ; Feature-vector-row-index has 1,679 nodes (1,679 at peak, 1,679 added, 0 deleted).
% 0.47/0.69  ;  Retrieved 682 possibly forward subsuming rows in 238 calls.
% 0.47/0.69  ;  Retrieved 505 possibly backward subsumed rows in 238 calls.
% 0.47/0.69  ; Path-index has 512 entries (515 at peak, 519 added, 7 deleted).
% 0.47/0.69  ; Path-index has 1,568 nodes (1,571 at peak, 1,575 added, 7 deleted).
% 0.47/0.69  ; Trie-index has 512 entries (515 at peak, 519 added, 7 deleted).
% 0.47/0.69  ; Trie-index has 1,285 nodes (1,292 at peak, 1,300 added, 15 deleted).
% 0.47/0.69  ; Retrieved 1,477 generalization terms in 1,582 calls.
% 0.47/0.69  ; Retrieved 138 instance terms in 124 calls.
% 0.47/0.69  ; Retrieved 1,941 unifiable terms in 276 calls.
% 0.47/0.69  ; 
% 0.47/0.69  ; The agenda of backward simplifiable rows to process has 2 entries:
% 0.47/0.69  ;     2 with value 0
% 0.47/0.69  ; The agenda of rows to process has 5 entries:
% 0.47/0.69  ;     5 with value 7
% 0.47/0.69  ; The agenda of input rows to give has 244 entries:
% 0.47/0.69  ;     1 with value 8               2 with value 27               2 with value 50
% 0.47/0.69  ;     8 with value 10              1 with value 28               4 with value 51
% 0.47/0.69  ;     6 with value 11              1 with value 29              16 with value 59
% 0.47/0.69  ;     7 with value 12              1 with value 30               2 with value 60
% 0.47/0.69  ;     1 with value 13              1 with value 32               1 with value 64
% 0.47/0.69  ;     2 with value 14              1 with value 33               2 with value 72
% 0.47/0.69  ;     3 with value 16              8 with value 37              64 with value 93
% 0.47/0.69  ;     1 with value 20              4 with value 38              48 with value 106
% 0.47/0.69  ;     1 with value 21             33 with value 46              12 with value 119
% 0.47/0.69  ;     1 with value 22              8 with value 47               1 with value 132
% 0.47/0.69  ;     1 with value 24
% 0.47/0.69  ; The agenda of rows to give has 63 entries:
% 0.47/0.69  ;    59 with value (4 5)           4 with value (4 7)
% 0.47/0.69  Evaluation took:
% 0.47/0.69    0.22 seconds of real time
% 0.47/0.69    0.20872 seconds of user run time
% 0.47/0.69    0.011123 seconds of system run time
% 0.47/0.69    [Run times include 0.006 seconds GC run time.]
% 0.47/0.69    0 calls to %EVAL
% 0.47/0.69    0 page faults and
% 0.47/0.69    17,076,936 bytes consed.
% 0.47/0.69  :PROOF-FOUND
% 0.47/0.69  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-15T19:56:23
% 0.47/0.69  :PROOF-FOUND
% 0.47/0.69  * 
%------------------------------------------------------------------------------