↑ Up

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

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

% Computer : n025.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 21:58:44 EDT 2022

% Result   : Theorem 0.55s 0.73s
% Output   : Refutation 0.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   26 (  15 unt;   1 nHn;  26 RR)
%            Number of literals    :   67 (  28 equ;  46 neg)
%            Maximal clause size   :    9 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :   22 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(81,axiom,
    ( ~ ssList(X)
    | ~ ssList(Y)
    | ~ neq(X,Y)
    | X != Y ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).

cnf(82,axiom,
    ( ~ ssList(X)
    | ~ ssList(Y)
    | neq(X,Y)
    | X = Y ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).

cnf(83,axiom,
    ( ~ ssList(X)
    | ~ ssItem(Y)
    | ssList(cons(Y,X)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).

cnf(84,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).

cnf(93,axiom,
    ( ~ ssList(X)
    | ~ ssItem(Y)
    | hd(cons(Y,X)) = Y ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax23) ).

cnf(170,axiom,
    ( ~ ssList(X)
    | ~ ssItem(Y)
    | cons(Y,X) = app(cons(Y,nil),X) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).

cnf(188,negated_conjecture,
    ssList('SKOLEMAAAV48'),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

cnf(189,negated_conjecture,
    ssList('SKOLEMAAAV49'),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

cnf(192,negated_conjecture,
    'SKOLEMAAAV49' = 'SKOLEMAAAV51',
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

cnf(193,negated_conjecture,
    'SKOLEMAAAV48' = 'SKOLEMAAAV50',
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

cnf(194,negated_conjecture,
    neq('SKOLEMAAAV49',nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

cnf(195,negated_conjecture,
    ( ~ ssList(X)
    | 'SKOLEMAAAV49' != X
    | ~ ssList(Y)
    | app(Y,'SKOLEMAAAV48') != X
    | ~ ssItem(Z)
    | cons(Z,nil) != Y
    | hd('SKOLEMAAAV49') != Z
    | ~ neq(nil,'SKOLEMAAAV49')
    | ~ neq('SKOLEMAAAV51',nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

cnf(196,plain,
    ( ~ ssList(X)
    | 'SKOLEMAAAV49' != X
    | ~ ssList(Y)
    | app(Y,'SKOLEMAAAV48') != X
    | ~ ssItem(Z)
    | cons(Z,nil) != Y
    | hd('SKOLEMAAAV49') != Z
    | ~ neq(nil,'SKOLEMAAAV49') ),
    inference('REWRITE',[status(thm)],[195,194,192,theory(equality)]) ).

cnf(197,negated_conjecture,
    ( ssItem('SKOLEMAAAV52')
    | ~ neq('SKOLEMAAAV51',nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

cnf(198,plain,
    ssItem('SKOLEMAAAV52'),
    inference('REWRITE',[status(thm)],[197,194,192,theory(equality)]) ).

cnf(199,negated_conjecture,
    ( app(cons('SKOLEMAAAV52',nil),'SKOLEMAAAV50') = 'SKOLEMAAAV51'
    | ~ neq('SKOLEMAAAV51',nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

cnf(200,plain,
    app(cons('SKOLEMAAAV52',nil),'SKOLEMAAAV48') = 'SKOLEMAAAV49',
    inference('REWRITE',[status(thm)],[199,194,192,193,theory(equality)]) ).

cnf(328,plain,
    ssList(cons('SKOLEMAAAV52',nil)),
    inference('HYPERRESOLVE',[status(thm)],[83,84,198]) ).

cnf(378,plain,
    nil != 'SKOLEMAAAV49',
    inference('UR-RESOLVE',[status(thm)],[81,189,84,194]) ).

cnf(390,plain,
    neq(nil,'SKOLEMAAAV49'),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[82,84,189]),378]) ).

cnf(391,plain,
    ( ~ ssList(X)
    | 'SKOLEMAAAV49' != X
    | ~ ssList(Y)
    | app(Y,'SKOLEMAAAV48') != X
    | ~ ssItem(Z)
    | cons(Z,nil) != Y
    | hd('SKOLEMAAAV49') != Z ),
    inference('REWRITE',[status(thm)],[196,390]) ).

cnf(403,plain,
    hd(cons('SKOLEMAAAV52','SKOLEMAAAV48')) = 'SKOLEMAAAV52',
    inference('HYPERRESOLVE',[status(thm)],[93,188,198]) ).

cnf(440,plain,
    cons('SKOLEMAAAV52','SKOLEMAAAV48') = 'SKOLEMAAAV49',
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[170,188,198]),200,theory(equality)]) ).

cnf(444,plain,
    hd('SKOLEMAAAV49') = 'SKOLEMAAAV52',
    inference('REWRITE',[status(thm)],[403,440,theory(equality)]) ).

cnf(445,plain,
    ( ~ ssList(X)
    | 'SKOLEMAAAV49' != X
    | ~ ssList(Y)
    | app(Y,'SKOLEMAAAV48') != X
    | ~ ssItem(Z)
    | cons(Z,nil) != Y
    | 'SKOLEMAAAV52' != Z ),
    inference('REWRITE',[status(thm)],[391,444,theory(equality)]) ).

cnf(563,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[445,189,200,198,theory(equality),theory(equality),theory(equality)]),328]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWC416+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n025.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 Jun 12 23:20:38 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.48  #<PACKAGE "SNARK-USER">
% 0.20/0.48  * 
% 0.20/0.48  SNARK-TPTP-OPTIONS
% 0.20/0.48  * 
% 0.20/0.48  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.48   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.48   (USE-FACTORING :POS)
% 0.20/0.48   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.48   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.48   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.48   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.48   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.48   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.48   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.48   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.48   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.48   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.48  * 
% 0.20/0.48  "."
% 0.20/0.48  * 
% 0.20/0.48  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-12T23:20:38
% 0.20/0.48  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n025.cluster.edu at 2022-06-12T23:20:38
% 0.55/0.73  
% 0.55/0.73  
% 0.55/0.73  #||
% 0.55/0.73  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.55/0.73  % SZS output start Refutation
% See solution above
% 0.55/0.73  ||#
% 0.55/0.73  
% 0.55/0.73  ; Summary of computation:
% 0.55/0.73  ;       958 formulas have been input or derived (from 188 formulas).
% 0.55/0.73  ;       563 (59%) were retained.  Of these,
% 0.55/0.73  ;           53 ( 9%) were simplified or subsumed later,
% 0.55/0.73  ;          510 (91%) are still being kept.
% 0.55/0.73  ; 
% 0.55/0.73  ; Run time in seconds excluding printing time:
% 0.55/0.73  ;     0.027  11%   Read assertion file          (1 call)
% 0.55/0.73  ;     0.008   3%   Assert                       (96 calls)
% 0.55/0.73  ;     0.036  14%   Process new row              (911 calls)
% 0.55/0.73  ;     0.113  45%   Resolution                   (374 calls)
% 0.55/0.73  ;     0.001   0%   Paramodulation               (187 calls)
% 0.55/0.73  ;     0.002   1%   Condensing                   (304 calls)
% 0.55/0.73  ;     0.008   3%   Forward subsumption          (304 calls)
% 0.55/0.73  ;     0.005   2%   Backward subsumption         (301 calls)
% 0.55/0.73  ;     0.000   0%   Clause clause subsumption    (82 calls)
% 0.55/0.73  ;     0.021   8%   Forward simplification       (911 calls)
% 0.55/0.73  ;     0.002   1%   Backward simplification      (560 calls)
% 0.55/0.73  ;     0.001   0%   Ordering                     (323 calls)
% 0.55/0.73  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.55/0.73  ;     0.000   0%   Purity testing               (1 call)
% 0.55/0.73  ;     0.025  10%   Other
% 0.55/0.73  ;     0.249        Total
% 0.55/0.73  ;     0.252        Real time
% 0.55/0.73  ; 
% 0.55/0.73  ; Term-hash-array has 974 terms in all.
% 0.55/0.73  ; Feature-vector-row-index has 291 entries (291 at peak, 301 added, 10 deleted).
% 0.55/0.73  ; Feature-vector-row-index has 1,168 nodes (1,168 at peak, 1,202 added, 34 deleted).
% 0.55/0.73  ;  Retrieved 143 possibly forward subsuming rows in 304 calls.
% 0.55/0.73  ;  Retrieved 96 possibly backward subsumed rows in 301 calls.
% 0.55/0.73  ; Path-index has 927 entries (927 at peak, 1,008 added, 81 deleted).
% 0.55/0.73  ; Path-index has 1,618 nodes (1,618 at peak, 1,656 added, 38 deleted).
% 0.55/0.73  ; Trie-index has 927 entries (927 at peak, 1,008 added, 81 deleted).
% 0.55/0.73  ; Trie-index has 2,481 nodes (2,481 at peak, 2,586 added, 105 deleted).
% 0.55/0.73  ; Retrieved 564 generalization terms in 2,406 calls.
% 0.55/0.73  ; Retrieved 261 instance terms in 258 calls.
% 0.55/0.73  ; Retrieved 257,089 unifiable terms in 9,802 calls.
% 0.55/0.73  ; 
% 0.55/0.73  ; The agenda of rows to process has 1 entry:
% 0.55/0.73  ;     1 with value 34
% 0.55/0.73  ; The agenda of input rows to give has 8 entries:
% 0.55/0.73  ;     1 with value 32              3 with value 40               3 with value 44
% 0.55/0.73  ;     1 with value 35
% 0.55/0.73  ; The agenda of rows to give has 314 entries:
% 0.55/0.73  ;    44 with value (4 5)          22 with value (4 10)           2 with value (4 17)
% 0.55/0.73  ;     2 with value (4 6)          22 with value (4 11)          18 with value (4 18)
% 0.55/0.73  ;    32 with value (4 7)           5 with value (4 12)           1 with value (4 19)
% 0.55/0.73  ;    12 with value (4 8)          40 with value (4 13)           2 with value (4 22)
% 0.55/0.73  ;    74 with value (4 9)          26 with value (4 15)          12 with value (4 25)
% 0.55/0.73  Evaluation took:
% 0.55/0.73    0.252 seconds of real time
% 0.55/0.73    0.230036 seconds of user run time
% 0.55/0.73    0.022052 seconds of system run time
% 0.55/0.73    [Run times include 0.009 seconds GC run time.]
% 0.55/0.73    0 calls to %EVAL
% 0.55/0.73    0 page faults and
% 0.55/0.73    19,314,496 bytes consed.
% 0.55/0.73  :PROOF-FOUND
% 0.55/0.73  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-12T23:20:38
% 0.55/0.73  :PROOF-FOUND
% 0.55/0.73  * 
%------------------------------------------------------------------------------