TSTP Solution File: SWC256-1 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : SWC256-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n017.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:57:48 EDT 2022

% Result   : Unsatisfiable 1.31s 1.49s
% Output   : Refutation 1.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   17 (  11 unt;   4 nHn;  17 RR)
%            Number of literals    :   27 (  12 equ;   9 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :    4 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause8,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).

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

cnf(clause116,axiom,
    ( cons(X,nil) != Y
    | ~ ssItem(X)
    | ~ ssList(Y)
    | singletonP(Y) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause116) ).

cnf(co1_1,negated_conjecture,
    ssList(sk1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).

cnf(co1_2,negated_conjecture,
    ssList(sk2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).

cnf(co1_5,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).

cnf(co1_6,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).

cnf(co1_7,negated_conjecture,
    neq(sk2,nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

cnf(co1_8,negated_conjecture,
    ~ singletonP(sk1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).

cnf(co1_9,negated_conjecture,
    ( ssItem(sk5)
    | nil = sk4 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).

cnf(192,plain,
    ( ssItem(sk5)
    | nil = sk2 ),
    inference('REWRITE',[status(thm)],[co1_9,co1_5,theory(equality)]) ).

cnf(co1_11,negated_conjecture,
    ( cons(sk5,nil) = sk3
    | nil = sk4 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).

cnf(196,plain,
    ( cons(sk5,nil) = sk1
    | nil = sk2 ),
    inference('REWRITE',[status(thm)],[co1_11,co1_5,co1_6,theory(equality)]) ).

cnf(4472,plain,
    nil != sk2,
    inference('UR-RESOLVE',[status(thm)],[clause115,co1_7,clause8,co1_2]) ).

cnf(4473,plain,
    ssItem(sk5),
    inference('REWRITE',[status(thm)],[192,4472]) ).

cnf(4474,plain,
    cons(sk5,nil) = sk1,
    inference('REWRITE',[status(thm)],[196,4472]) ).

cnf(5752,plain,
    $false,
    inference('UR-RESOLVE',[status(thm)],[clause116,4474,4473,co1_1,co1_8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : SWC256-1 : TPTP v8.1.0. Released v2.4.0.
% 0.00/0.09  % Command  : run-snark %s %d
% 0.08/0.29  % Computer : n017.cluster.edu
% 0.08/0.29  % Model    : x86_64 x86_64
% 0.08/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29  % Memory   : 8042.1875MB
% 0.08/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29  % CPULimit : 300
% 0.08/0.29  % WCLimit  : 600
% 0.08/0.29  % DateTime : Sun Jun 12 14:55:37 EDT 2022
% 0.08/0.29  % CPUTime  : 
% 0.14/0.37  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/0.38  * 
% 0.14/0.38  * 
% 0.14/0.39  #<PACKAGE "SNARK-USER">
% 0.14/0.39  * 
% 0.14/0.39  SNARK-TPTP-OPTIONS
% 0.14/0.39  * 
% 0.14/0.39  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.14/0.39   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.14/0.39   (USE-FACTORING :POS)
% 0.14/0.39   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.14/0.39   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.14/0.39   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.14/0.39   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.14/0.39   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.14/0.39   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.14/0.39   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.14/0.39   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.14/0.39   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.14/0.39   (DECLARE-TPTP-SYMBOLS2))
% 0.14/0.39  * 
% 0.14/0.39  "."
% 0.14/0.39  * 
% 0.14/0.39  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-12T14:55:37
% 0.14/0.39  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n017.cluster.edu at 2022-06-12T14:55:37
% 1.31/1.49  
% 1.31/1.49  
% 1.31/1.49  #||
% 1.31/1.49  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.31/1.49  % SZS output start Refutation
% See solution above
% 1.31/1.49  ||#
% 1.31/1.49  
% 1.31/1.49  ; Summary of computation:
% 1.31/1.49  ;      9059 formulas have been input or derived (from 129 formulas).
% 1.31/1.49  ;      5752 (63%) were retained.  Of these,
% 1.31/1.49  ;          180 ( 3%) were simplified or subsumed later,
% 1.31/1.49  ;         5572 (97%) are still being kept.
% 1.31/1.49  ; 
% 1.31/1.49  ; Run time in seconds excluding printing time:
% 1.31/1.49  ;     0.035   3%   Read assertion file          (1 call)
% 1.31/1.49  ;     0.006   1%   Assert                       (199 calls)
% 1.31/1.49  ;     0.417  38%   Process new row              (9,005 calls)
% 1.31/1.49  ;     0.271  25%   Resolution                   (256 calls)
% 1.31/1.49  ;     0.001   0%   Paramodulation               (128 calls)
% 1.31/1.49  ;     0.000   0%   Factoring                    (6 calls)
% 1.31/1.49  ;     0.015   1%   Condensing                   (1,719 calls)
% 1.31/1.49  ;     0.023   2%   Forward subsumption          (1,719 calls)
% 1.31/1.49  ;     0.056   5%   Backward subsumption         (1,648 calls)
% 1.31/1.49  ;     0.001   0%   Clause clause subsumption    (1,460 calls)
% 1.31/1.49  ;     0.139  13%   Forward simplification       (9,005 calls)
% 1.31/1.49  ;     0.057   5%   Backward simplification      (5,746 calls)
% 1.31/1.49  ;     0.007   1%   Ordering                     (3,014 calls)
% 1.31/1.49  ;     0.000   0%   Sortal reasoning             (32 calls)
% 1.31/1.49  ;     0.001   0%   Purity testing               (1 call)
% 1.31/1.49  ;     0.074   7%   Other
% 1.31/1.49  ;     1.103        Total
% 1.31/1.49  ;     1.106        Real time
% 1.31/1.49  ; 
% 1.31/1.49  ; Term-hash-array has 9,559 terms in all.
% 1.31/1.49  ; Feature-vector-row-index has 1,478 entries (1,607 at peak, 1,648 added, 170 deleted).
% 1.31/1.49  ; Feature-vector-row-index has 1,127 nodes (1,494 at peak, 1,550 added, 423 deleted).
% 1.31/1.49  ;  Retrieved 7,440 possibly forward subsuming rows in 1,719 calls.
% 1.31/1.49  ;  Retrieved 7,043 possibly backward subsumed rows in 1,648 calls.
% 1.31/1.49  ; Path-index has 9,551 entries (9,551 at peak, 9,629 added, 78 deleted).
% 1.31/1.49  ; Path-index has 4,114 nodes (4,114 at peak, 4,142 added, 28 deleted).
% 1.31/1.49  ; Trie-index has 9,551 entries (9,551 at peak, 9,629 added, 78 deleted).
% 1.31/1.49  ; Trie-index has 23,601 nodes (23,601 at peak, 23,707 added, 106 deleted).
% 1.31/1.49  ; Retrieved 3,327 generalization terms in 16,611 calls.
% 1.31/1.49  ; Retrieved 4,139 instance terms in 4,097 calls.
% 1.31/1.49  ; Retrieved 425,347 unifiable terms in 11,010 calls.
% 1.31/1.49  ; 
% 1.31/1.49  ; The agenda of rows to process has 41 entries:
% 1.31/1.49  ;     4 with value 4              30 with value 10               1 with value 14
% 1.31/1.49  ;     6 with value 8
% 1.31/1.49  ; The agenda of input rows to give has 69 entries:
% 1.31/1.49  ;     4 with value 17              2 with value 23               1 with value 32
% 1.31/1.49  ;     7 with value 18              3 with value 24               1 with value 33
% 1.31/1.49  ;     2 with value 19              8 with value 25               1 with value 35
% 1.31/1.49  ;    11 with value 20              3 with value 26               2 with value 40
% 1.31/1.49  ;     9 with value 21              6 with value 27               3 with value 44
% 1.31/1.49  ;     5 with value 22              1 with value 29
% 1.31/1.49  ; The agenda of rows to give has 5380 entries:
% 1.31/1.49  ;     7 with value (4 4)         324 with value (4 9)          762 with value (4 14)
% 1.31/1.49  ;    43 with value (4 5)         982 with value (4 10)         810 with value (4 15)
% 1.31/1.49  ;     2 with value (4 6)         782 with value (4 11)         144 with value (4 16)
% 1.31/1.49  ;   107 with value (4 7)         549 with value (4 12)         252 with value (4 17)
% 1.31/1.49  ;   196 with value (4 8)         372 with value (4 13)          48 with value (4 19)
% 1.31/1.49  Evaluation took:
% 1.31/1.49    1.107 seconds of real time
% 1.31/1.49    1.015335 seconds of user run time
% 1.31/1.49    0.091105 seconds of system run time
% 1.31/1.49    [Run times include 0.087 seconds GC run time.]
% 1.31/1.49    0 calls to %EVAL
% 1.31/1.49    0 page faults and
% 1.31/1.49    60,551,664 bytes consed.
% 1.31/1.49  :PROOF-FOUND
% 1.31/1.49  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-12T14:55:38
% 1.31/1.49  :PROOF-FOUND
% 1.31/1.49  * 
%------------------------------------------------------------------------------