↑ Up

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

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

% Computer : n013.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 : Thu Jul 21 19:44:55 EDT 2022

% Result   : Unsatisfiable 0.14s 0.48s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   50 (   6 unt;  38 nHn;  35 RR)
%            Number of literals    :  180 (   0 equ;  64 neg)
%            Maximal clause size   :   17 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-1 aty)
%            Number of variables   :   42 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause_193,axiom,
    ( ~ 'E'(s('0'),f(suc(X)))
    | ~ 'E'(s('0'),f(suc(Y)))
    | ~ iLEQ(suc(Z),suc(U))
    | ~ 'E'(s('0'),f(V))
    | ~ 'E'(s('0'),f(suc(W)))
    | ~ 'E'(s('0'),f(suc(V)))
    | ~ 'E'(s('0'),f(Y))
    | ~ 'E'(s('0'),f(X))
    | ~ 'E'(s('0'),f(U))
    | ~ iLEQ(suc(W),suc(V))
    | ~ iLEQ(suc(V),suc(Z))
    | ~ 'E'(s('0'),f(suc(U)))
    | ~ 'E'(s('0'),f(Z))
    | ~ 'E'(s('0'),f(suc(Z)))
    | ~ iLEQ(suc(Y),suc(X))
    | ~ 'E'(s('0'),f(W))
    | ~ iLEQ(suc(U),suc(Y)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_193) ).

cnf(clause_298,axiom,
    ( ~ 'LE'(f(X),s(s('0')))
    | 'E'(s('0'),f(X))
    | 'LE'(f(X),s('0')) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_298) ).

cnf(clause_281,axiom,
    ( ~ 'E'('0',f(X))
    | ~ 'E'('0',f(suc(X)))
    | iLEQ(suc(X),suc(X)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_281) ).

cnf(clause_176,axiom,
    ( ~ 'LE'(f(X),s('0'))
    | 'E'('0',f(X))
    | 'LE'(f(X),'0') ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_176) ).

cnf(clause_139,axiom,
    ( ~ 'LE'(f(X),s(s(s('0'))))
    | 'E'(s(s('0')),f(X))
    | 'LE'(f(X),s(s('0'))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_139) ).

cnf(clause_126,axiom,
    ( ~ 'E'(s(s('0')),f(X))
    | ~ 'E'(s(s('0')),f(suc(X)))
    | iLEQ(suc(X),suc(X)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_126) ).

cnf(clause_498,axiom,
    'LE'(f(X),s(s(s('0')))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_498) ).

cnf(clause_204,axiom,
    ~ 'LE'(f(z),'0'),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_204) ).

cnf(clause_129,axiom,
    ( ~ 'LE'(f(suc(X)),s(s(s('0'))))
    | 'E'(s(s('0')),f(suc(X)))
    | 'LE'(f(X),s(s('0'))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_129) ).

cnf(10,plain,
    ( 'E'(s(s('0')),f(suc(X)))
    | 'LE'(f(X),s(s('0'))) ),
    inference('REWRITE',[status(thm)],[clause_129,clause_498]) ).

cnf(clause_431,axiom,
    ( ~ 'E'(s(s('0')),f(X))
    | ~ 'E'(s(s('0')),f(suc(Y)))
    | ~ 'E'(s(s('0')),f(Z))
    | ~ iLEQ(suc(U),suc(V))
    | ~ 'E'(s(s('0')),f(suc(X)))
    | ~ 'E'(s(s('0')),f(W))
    | ~ 'E'(s(s('0')),f(Y))
    | ~ iLEQ(suc(Z),suc(U))
    | ~ 'E'(s(s('0')),f(suc(V)))
    | ~ 'E'(s(s('0')),f(suc(U)))
    | ~ 'E'(s(s('0')),f(suc(W)))
    | ~ 'E'(s(s('0')),f(U))
    | ~ iLEQ(suc(V),suc(W))
    | ~ 'E'(s(s('0')),f(V))
    | ~ 'E'(s(s('0')),f(suc(Z)))
    | ~ iLEQ(suc(W),suc(Y))
    | ~ iLEQ(suc(X),suc(Z)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_431) ).

cnf(clause_50,axiom,
    ( ~ 'LE'(f(suc(X)),s('0'))
    | 'E'('0',f(suc(X)))
    | 'LE'(f(X),'0') ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_50) ).

cnf(clause_84,axiom,
    ( ~ 'LE'(f(suc(X)),s(s('0')))
    | 'E'(s('0'),f(suc(X)))
    | 'LE'(f(X),s('0')) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_84) ).

cnf(clause_493,axiom,
    ( ~ 'E'(s('0'),f(X))
    | ~ 'E'(s('0'),f(suc(X)))
    | iLEQ(suc(X),suc(X)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_493) ).

cnf(clause_453,axiom,
    ( ~ iLEQ(suc(X),suc(Y))
    | ~ 'E'('0',f(Y))
    | ~ 'E'('0',f(suc(Z)))
    | ~ iLEQ(suc(U),suc(V))
    | ~ 'E'('0',f(W))
    | ~ iLEQ(suc(V),suc(Z))
    | ~ 'E'('0',f(X))
    | ~ 'E'('0',f(U))
    | ~ 'E'('0',f(suc(Y)))
    | ~ iLEQ(suc(Y),suc(U))
    | ~ 'E'('0',f(suc(X)))
    | ~ 'E'('0',f(suc(V)))
    | ~ iLEQ(suc(Z),suc(W))
    | ~ 'E'('0',f(suc(U)))
    | ~ 'E'('0',f(suc(W)))
    | ~ 'E'('0',f(V))
    | ~ 'E'('0',f(Z)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_453) ).

cnf(16,plain,
    ( 'E'(s(s('0')),f(X))
    | 'LE'(f(X),s(s('0'))) ),
    inference('REWRITE',[status(thm)],[clause_139,clause_498]) ).

cnf(17,plain,
    ( 'E'(s(s('0')),f(X))
    | 'E'(s('0'),f(X))
    | 'LE'(f(X),s('0')) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_298,16]) ).

cnf(18,plain,
    ( 'E'(s(s('0')),f(suc(X)))
    | 'E'(s('0'),f(X))
    | 'LE'(f(X),s('0')) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_298,10]) ).

cnf(19,plain,
    ( 'E'(s(s('0')),f(suc(X)))
    | 'E'(s('0'),f(suc(X)))
    | 'LE'(f(X),s('0')) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_84,16]) ).

cnf(20,plain,
    ( 'E'(s(s('0')),f(suc(suc(X))))
    | 'E'(s('0'),f(suc(X)))
    | 'LE'(f(X),s('0')) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_84,10]) ).

cnf(21,plain,
    ( 'E'(s(s('0')),f(X))
    | 'E'(s('0'),f(X))
    | 'E'('0',f(X))
    | 'LE'(f(X),'0') ),
    inference('HYPERRESOLVE',[status(thm)],[clause_176,17]) ).

cnf(22,plain,
    ( 'E'(s(s('0')),f(suc(X)))
    | 'E'(s('0'),f(suc(X)))
    | 'E'('0',f(suc(X)))
    | 'LE'(f(X),'0') ),
    inference('HYPERRESOLVE',[status(thm)],[clause_50,17]) ).

cnf(23,plain,
    ( 'E'(s(s('0')),f(suc(X)))
    | 'E'(s('0'),f(X))
    | 'E'('0',f(X))
    | 'LE'(f(X),'0') ),
    inference('HYPERRESOLVE',[status(thm)],[clause_176,18]) ).

cnf(24,plain,
    ( 'E'(s(s('0')),f(suc(suc(X))))
    | 'E'(s('0'),f(suc(X)))
    | 'E'('0',f(suc(X)))
    | 'LE'(f(X),'0') ),
    inference('HYPERRESOLVE',[status(thm)],[clause_50,18]) ).

cnf(25,plain,
    ( 'E'(s(s('0')),f(suc(X)))
    | 'E'(s('0'),f(suc(X)))
    | 'E'('0',f(X))
    | 'LE'(f(X),'0') ),
    inference('HYPERRESOLVE',[status(thm)],[clause_176,19]) ).

cnf(26,plain,
    ( 'E'(s(s('0')),f(suc(suc(X))))
    | 'E'(s('0'),f(suc(suc(X))))
    | 'E'('0',f(suc(X)))
    | 'LE'(f(X),'0') ),
    inference('HYPERRESOLVE',[status(thm)],[clause_50,19]) ).

cnf(27,plain,
    ( 'E'(s(s('0')),f(suc(suc(X))))
    | 'E'(s('0'),f(suc(X)))
    | 'E'('0',f(X))
    | 'LE'(f(X),'0') ),
    inference('HYPERRESOLVE',[status(thm)],[clause_176,20]) ).

cnf(28,plain,
    ( 'E'(s(s('0')),f(suc(suc(suc(X)))))
    | 'E'(s('0'),f(suc(suc(X))))
    | 'E'('0',f(suc(X)))
    | 'LE'(f(X),'0') ),
    inference('HYPERRESOLVE',[status(thm)],[clause_50,20]) ).

cnf(29,plain,
    ( 'E'(s(s('0')),f(z))
    | 'E'(s('0'),f(z))
    | 'E'('0',f(z)) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_204,21]) ).

cnf(30,plain,
    ( 'E'(s(s('0')),f(suc(z)))
    | 'E'(s('0'),f(z))
    | 'E'('0',f(z)) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_204,23]) ).

cnf(31,plain,
    ( 'E'(s('0'),f(z))
    | 'E'('0',f(z))
    | iLEQ(suc(z),suc(z)) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_126,30,29]) ).

cnf(32,plain,
    ( 'E'(s('0'),f(z))
    | 'E'('0',f(z)) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_431,31,29,30,29,31,30,29,29,30,30,30,29,31,29,30,31,31]) ).

cnf(33,plain,
    ( 'E'(s(s('0')),f(suc(z)))
    | 'E'(s('0'),f(suc(z)))
    | 'E'('0',f(z)) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_204,25]) ).

cnf(34,plain,
    ( 'E'(s(s('0')),f(suc(z)))
    | 'E'(s('0'),f(suc(z)))
    | 'E'('0',f(suc(z))) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_204,22]) ).

cnf(35,plain,
    ( 'E'(s(s('0')),f(suc(suc(z))))
    | 'E'(s('0'),f(suc(z)))
    | 'E'('0',f(z)) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_204,27]) ).

cnf(36,plain,
    ( 'E'(s('0'),f(suc(z)))
    | 'E'('0',f(z))
    | iLEQ(suc(suc(z)),suc(suc(z))) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_126,35,33]) ).

cnf(37,plain,
    ( 'E'(s('0'),f(suc(z)))
    | 'E'('0',f(z)) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_431,36,33,35,33,36,35,33,33,35,35,35,33,36,33,35,36,36]) ).

cnf(38,plain,
    ( 'E'('0',f(z))
    | iLEQ(suc(z),suc(z)) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_493,37,32]) ).

cnf(39,plain,
    'E'('0',f(z)),
    inference('HYPERRESOLVE',[status(thm)],[clause_193,38,37,37,32,37,37,32,32,32,38,38,37,32,37,38,32,38]) ).

cnf(40,plain,
    ( 'E'(s(s('0')),f(suc(suc(z))))
    | 'E'(s('0'),f(suc(z)))
    | 'E'('0',f(suc(z))) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_204,24]) ).

cnf(41,plain,
    ( 'E'(s('0'),f(suc(z)))
    | 'E'('0',f(suc(z)))
    | iLEQ(suc(suc(z)),suc(suc(z))) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_126,40,34]) ).

cnf(42,plain,
    ( 'E'(s('0'),f(suc(z)))
    | 'E'('0',f(suc(z))) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_431,41,34,40,34,41,40,34,34,40,40,40,34,41,34,40,41,41]) ).

cnf(43,plain,
    ( 'E'(s(s('0')),f(suc(suc(z))))
    | 'E'(s('0'),f(suc(suc(z))))
    | 'E'('0',f(suc(z))) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_204,26]) ).

cnf(44,plain,
    ( 'E'(s(s('0')),f(suc(suc(suc(z)))))
    | 'E'(s('0'),f(suc(suc(z))))
    | 'E'('0',f(suc(z))) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_204,28]) ).

cnf(45,plain,
    ( 'E'(s('0'),f(suc(suc(z))))
    | 'E'('0',f(suc(z)))
    | iLEQ(suc(suc(suc(z))),suc(suc(suc(z)))) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_126,44,43]) ).

cnf(46,plain,
    ( 'E'(s('0'),f(suc(suc(z))))
    | 'E'('0',f(suc(z))) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_431,45,43,44,43,45,44,43,43,44,44,44,43,45,43,44,45,45]) ).

cnf(47,plain,
    ( 'E'('0',f(suc(z)))
    | iLEQ(suc(suc(z)),suc(suc(z))) ),
    inference('HYPERRESOLVE',[status(thm)],[clause_493,46,42]) ).

cnf(48,plain,
    'E'('0',f(suc(z))),
    inference('HYPERRESOLVE',[status(thm)],[clause_193,47,46,46,42,46,46,42,42,42,47,47,46,42,46,47,42,47]) ).

cnf(49,plain,
    iLEQ(suc(z),suc(z)),
    inference('HYPERRESOLVE',[status(thm)],[clause_281,48,39]) ).

cnf(50,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[clause_453,48,39,48,39,39,39,48,48,48,48,39,39]),49]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.08  % Problem  : SYO674-1 : TPTP v8.1.0. Released v7.3.0.
% 0.02/0.09  % Command  : run-snark %s %d
% 0.09/0.29  % Computer : n013.cluster.edu
% 0.09/0.29  % Model    : x86_64 x86_64
% 0.09/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29  % Memory   : 8042.1875MB
% 0.09/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29  % CPULimit : 300
% 0.09/0.29  % WCLimit  : 600
% 0.09/0.29  % DateTime : Sat Jul  9 05:35:29 EDT 2022
% 0.09/0.29  % CPUTime  : 
% 0.14/0.37  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38  * 
% 0.14/0.38  * 
% 0.14/0.38  #<PACKAGE "SNARK-USER">
% 0.14/0.38  * 
% 0.14/0.38  SNARK-TPTP-OPTIONS
% 0.14/0.38  * 
% 0.14/0.38  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.14/0.38   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.14/0.38   (USE-FACTORING :POS)
% 0.14/0.38   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.14/0.38   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.14/0.38   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.14/0.38   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.14/0.38   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.14/0.38   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.14/0.38   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.14/0.38   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.14/0.38   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.14/0.38   (DECLARE-TPTP-SYMBOLS2))
% 0.14/0.38  * 
% 0.14/0.38  "."
% 0.14/0.38  * 
% 0.14/0.38  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-09T05:35:29
% 0.14/0.38  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n013.cluster.edu at 2022-07-09T05:35:29
% 0.14/0.48  
% 0.14/0.48  
% 0.14/0.48  #||
% 0.14/0.48  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.48  % SZS output start Refutation
% See solution above
% 0.14/0.50  ||#
% 0.14/0.50  
% 0.14/0.50  ; Summary of computation:
% 0.14/0.50  ;       396 formulas have been input or derived (from 47 formulas).
% 0.14/0.50  ;        50 (13%) were retained.  Of these,
% 0.14/0.50  ;           20 (40%) were simplified or subsumed later,
% 0.14/0.50  ;           30 (60%) are still being kept.
% 0.14/0.50  ; 
% 0.14/0.50  ; Run time in seconds excluding printing time:
% 0.14/0.50  ;     0.006   6%   Read assertion file          (1 call)
% 0.14/0.50  ;     0.002   2%   Assert                       (14 calls)
% 0.14/0.50  ;     0.004   4%   Process new row              (51 calls)
% 0.14/0.50  ;     0.058  58%   Resolution                   (92 calls)
% 0.14/0.50  ;     0.002   2%   Paramodulation               (46 calls)
% 0.14/0.50  ;     0.000   0%   Factoring                    (32 calls)
% 0.14/0.50  ;     0.004   4%   Condensing                   (44 calls)
% 0.14/0.50  ;     0.002   2%   Forward subsumption          (44 calls)
% 0.14/0.50  ;     0.001   1%   Backward subsumption         (43 calls)
% 0.14/0.50  ;     0.000   0%   Clause clause subsumption    (70 calls)
% 0.14/0.50  ;     0.001   1%   Forward simplification       (50 calls)
% 0.14/0.50  ;     0.002   2%   Backward simplification      (49 calls)
% 0.14/0.50  ;     0.000   0%   Ordering                     (84 calls)
% 0.14/0.50  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.14/0.50  ;     0.000   0%   Purity testing               (1 call)
% 0.14/0.50  ;     0.018  18%   Other
% 0.14/0.50  ;     0.100        Total
% 0.14/0.50  ;     0.114        Real time
% 0.14/0.50  ; 
% 0.14/0.50  ; Term-hash-array has 103 terms in all.
% 0.14/0.50  ; Feature-vector-row-index has 24 entries (29 at peak, 43 added, 19 deleted).
% 0.14/0.50  ; Feature-vector-row-index has 147 nodes (213 at peak, 388 added, 241 deleted).
% 0.14/0.50  ;  Retrieved 53 possibly forward subsuming rows in 44 calls.
% 0.14/0.50  ;  Retrieved 18 possibly backward subsumed rows in 43 calls.
% 0.14/0.50  ; Path-index has 92 entries (100 at peak, 127 added, 35 deleted).
% 0.14/0.50  ; Path-index has 72 nodes (78 at peak, 106 added, 34 deleted).
% 0.14/0.50  ; Trie-index has 92 entries (100 at peak, 127 added, 35 deleted).
% 0.14/0.50  ; Trie-index has 78 nodes (90 at peak, 135 added, 57 deleted).
% 0.14/0.50  ; Retrieved 2 generalization terms in 40 calls.
% 0.14/0.50  ; Retrieved 5 instance terms in 5 calls.
% 0.14/0.50  ; Retrieved 13,792 unifiable terms in 4,620 calls.
% 0.14/0.50  ; 
% 0.14/0.50  ; The agenda of rows to process has 2 entries:
% 0.14/0.50  ;     2 with value 15
% 0.14/0.50  ; The agenda of rows to give has 1 entry:
% 0.14/0.50  ;     1 with value (4 15)
% 0.14/0.50  Evaluation took:
% 0.14/0.50    0.114 seconds of real time
% 0.14/0.50    0.108413 seconds of user run time
% 0.14/0.50    0.005956 seconds of system run time
% 0.14/0.50    [Run times include 0.005 seconds GC run time.]
% 0.14/0.50    0 calls to %EVAL
% 0.14/0.50    0 page faults and
% 0.14/0.50    13,852,984 bytes consed.
% 0.14/0.50  :PROOF-FOUND
% 0.14/0.50  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-07-09T05:35:30
% 0.14/0.50  :PROOF-FOUND
% 0.14/0.50  * 
%------------------------------------------------------------------------------