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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : SWC029-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:56:28 EDT 2022

% Result   : Unsatisfiable 1.09s 1.31s
% Output   : Refutation 1.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   15
% Syntax   : Number of clauses     :   31 (  15 unt;   2 nHn;  31 RR)
%            Number of literals    :   55 (  25 equ;  26 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :   10 (   0 sgn)

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

cnf(clause86,axiom,
    ( ~ ssItem(X)
    | ~ ssList(Y)
    | ssList(cons(X,Y)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).

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

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

cnf(clause118,axiom,
    ( app(X,Y) != nil
    | ~ ssList(Y)
    | ~ ssList(X)
    | nil = X ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).

cnf(clause119,axiom,
    ( app(X,Y) != nil
    | ~ ssList(Y)
    | ~ ssList(X)
    | nil = Y ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause119) ).

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

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

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

cnf(co1_7,negated_conjecture,
    ( nil = sk3
    | nil != sk4 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

cnf(190,plain,
    ( nil = sk1
    | nil != sk2 ),
    inference('REWRITE',[status(thm)],[co1_7,co1_5,co1_6,theory(equality)]) ).

cnf(co1_8,negated_conjecture,
    ( ssItem(sk5)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

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

cnf(co1_9,negated_conjecture,
    ( ssList(sk6)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).

cnf(194,plain,
    ( ssList(sk6)
    | ~ neq(sk2,nil) ),
    inference('REWRITE',[status(thm)],[co1_9,co1_5,theory(equality)]) ).

cnf(co1_11,negated_conjecture,
    ( app(sk6,cons(sk5,nil)) = sk3
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).

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

cnf(co1_12,negated_conjecture,
    ( nil = sk2
    | nil = sk1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).

cnf(co1_15,negated_conjecture,
    ( nil != sk1
    | nil != sk2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).

cnf(446,plain,
    nil = sk1,
    inference('HYPERRESOLVE',[status(thm)],[190,co1_12]) ).

cnf(448,plain,
    ( app(sk6,cons(sk5,nil)) = nil
    | ~ neq(sk2,nil) ),
    inference('REWRITE',[status(thm)],[198,446,theory(equality)]) ).

cnf(449,plain,
    nil != sk2,
    inference('REWRITE',[status(thm)],[co1_15,446,theory(equality)]) ).

cnf(3016,plain,
    neq(sk2,nil),
    inference('UR-RESOLVE',[status(thm)],[clause100,clause8,co1_2,449]) ).

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

cnf(3018,plain,
    ssList(sk6),
    inference('REWRITE',[status(thm)],[194,3016]) ).

cnf(3020,plain,
    app(sk6,cons(sk5,nil)) = nil,
    inference('REWRITE',[status(thm)],[448,3016]) ).

cnf(3863,plain,
    ssList(cons(sk5,nil)),
    inference('HYPERRESOLVE',[status(thm)],[clause86,3017,clause8]) ).

cnf(3872,plain,
    cons(sk5,nil) != nil,
    inference('UR-RESOLVE',[status(thm)],[clause99,3017,clause8]) ).

cnf(5693,plain,
    nil = sk6,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[clause118,3020,theory(equality)]),3018,3863,theory(equality)]) ).

cnf(5695,plain,
    app(nil,cons(sk5,nil)) = nil,
    inference('REWRITE',[status(thm)],[3020,5693,theory(equality)]) ).

cnf(5723,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('PARAMODULATE',[status(thm)],[clause119,5695,theory(equality)]),3872,clause8,3863,theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWC029-1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n017.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.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sat Jun 11 23:13:06 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.21/0.46  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.47  * 
% 0.21/0.47  * 
% 0.21/0.48  #<PACKAGE "SNARK-USER">
% 0.21/0.48  * 
% 0.21/0.48  SNARK-TPTP-OPTIONS
% 0.21/0.48  * 
% 0.21/0.48  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.21/0.48   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.21/0.48   (USE-FACTORING :POS)
% 0.21/0.48   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.21/0.48   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.21/0.48   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.21/0.48   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.21/0.48   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.21/0.48   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.21/0.48   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.21/0.48   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.21/0.48   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.21/0.48   (DECLARE-TPTP-SYMBOLS2))
% 0.21/0.48  * 
% 0.21/0.48  "."
% 0.21/0.48  * 
% 0.21/0.48  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-11T23:13:06
% 0.21/0.48  ; 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-11T23:13:06
% 1.09/1.31  
% 1.09/1.31  
% 1.09/1.31  #||
% 1.09/1.31  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.09/1.31  % SZS output start Refutation
% See solution above
% 1.20/1.35  ||#
% 1.20/1.35  
% 1.20/1.35  ; Summary of computation:
% 1.20/1.35  ;      9144 formulas have been input or derived (from 134 formulas).
% 1.20/1.35  ;      5723 (63%) were retained.  Of these,
% 1.20/1.35  ;          250 ( 4%) were simplified or subsumed later,
% 1.20/1.35  ;         5473 (96%) are still being kept.
% 1.20/1.35  ; 
% 1.20/1.35  ; Run time in seconds excluding printing time:
% 1.20/1.35  ;     0.038   5%   Read assertion file          (1 call)
% 1.20/1.35  ;     0.006   1%   Assert                       (200 calls)
% 1.20/1.35  ;     0.253  31%   Process new row              (9,128 calls)
% 1.20/1.35  ;     0.248  30%   Resolution                   (266 calls)
% 1.20/1.35  ;     0.004   0%   Paramodulation               (133 calls)
% 1.20/1.35  ;     0.000   0%   Factoring                    (1 call)
% 1.20/1.35  ;     0.017   2%   Condensing                   (1,605 calls)
% 1.20/1.35  ;     0.012   1%   Forward subsumption          (1,605 calls)
% 1.20/1.35  ;     0.053   6%   Backward subsumption         (1,549 calls)
% 1.20/1.35  ;     0.003   0%   Clause clause subsumption    (1,370 calls)
% 1.20/1.35  ;     0.077   9%   Forward simplification       (9,122 calls)
% 1.20/1.35  ;     0.041   5%   Backward simplification      (5,718 calls)
% 1.20/1.35  ;     0.005   1%   Ordering                     (2,658 calls)
% 1.20/1.35  ;     0.000   0%   Sortal reasoning             (32 calls)
% 1.20/1.35  ;     0.001   0%   Purity testing               (1 call)
% 1.20/1.35  ;     0.067   8%   Other
% 1.20/1.35  ;     0.825        Total
% 1.20/1.35  ;     0.870        Real time
% 1.20/1.35  ; 
% 1.20/1.35  ; Term-hash-array has 9,807 terms in all.
% 1.20/1.35  ; Feature-vector-row-index has 1,476 entries (1,541 at peak, 1,549 added, 73 deleted).
% 1.20/1.35  ; Feature-vector-row-index has 1,249 nodes (1,320 at peak, 1,387 added, 138 deleted).
% 1.20/1.35  ;  Retrieved 7,265 possibly forward subsuming rows in 1,605 calls.
% 1.20/1.35  ;  Retrieved 6,897 possibly backward subsumed rows in 1,549 calls.
% 1.20/1.35  ; Path-index has 9,426 entries (9,772 at peak, 9,828 added, 402 deleted).
% 1.20/1.35  ; Path-index has 4,824 nodes (4,868 at peak, 4,908 added, 84 deleted).
% 1.20/1.35  ; Trie-index has 9,426 entries (9,772 at peak, 9,828 added, 402 deleted).
% 1.20/1.35  ; Trie-index has 24,078 nodes (24,589 at peak, 24,707 added, 629 deleted).
% 1.20/1.35  ; Retrieved 3,520 generalization terms in 14,650 calls.
% 1.20/1.35  ; Retrieved 4,210 instance terms in 4,168 calls.
% 1.20/1.35  ; Retrieved 568,773 unifiable terms in 13,141 calls.
% 1.20/1.35  ; 
% 1.20/1.35  ; The agenda of input rows to give has 65 entries:
% 1.20/1.35  ;     7 with value 18              3 with value 24               1 with value 32
% 1.20/1.35  ;     2 with value 19              8 with value 25               1 with value 33
% 1.20/1.35  ;    11 with value 20              3 with value 26               1 with value 35
% 1.20/1.35  ;     9 with value 21              6 with value 27               2 with value 40
% 1.20/1.35  ;     5 with value 22              1 with value 29               3 with value 44
% 1.20/1.35  ;     2 with value 23
% 1.20/1.35  ; The agenda of rows to give has 5283 entries:
% 1.20/1.35  ;    38 with value (4 5)         796 with value (4 11)         144 with value (4 16)
% 1.20/1.35  ;     2 with value (4 6)         534 with value (4 12)         252 with value (4 17)
% 1.20/1.35  ;   107 with value (4 7)         315 with value (4 13)          48 with value (4 19)
% 1.20/1.35  ;   190 with value (4 8)         762 with value (4 14)          42 with value (4 21)
% 1.20/1.35  ;   265 with value (4 9)         798 with value (4 15)          12 with value (4 25)
% 1.20/1.35  ;   978 with value (4 10)
% 1.20/1.35  Evaluation took:
% 1.20/1.35    0.871 seconds of real time
% 1.20/1.35    0.815057 seconds of user run time
% 1.20/1.35    0.055959 seconds of system run time
% 1.20/1.35    [Run times include 0.111 seconds GC run time.]
% 1.20/1.35    0 calls to %EVAL
% 1.20/1.35    0 page faults and
% 1.20/1.35    63,747,616 bytes consed.
% 1.20/1.35  :PROOF-FOUND
% 1.20/1.35  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-11T23:13:07
% 1.20/1.35  :PROOF-FOUND
% 1.20/1.35  * 
%------------------------------------------------------------------------------