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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : SWC014-1 : TPTP v8.1.0. Released v2.4.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 : Tue Jul 19 21:56:23 EDT 2022

% Result   : Unsatisfiable 3.76s 3.94s
% Output   : Refutation 3.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   28 (  15 unt;   2 nHn;  28 RR)
%            Number of literals    :   62 (  27 equ;  38 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   7 con; 0-2 aty)
%            Number of variables   :   16 (   0 sgn)

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

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

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

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

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

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,
    neq(sk2,nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

cnf(co1_14,negated_conjecture,
    ( ~ ssList(X)
    | sk2 != X
    | ~ ssList(Y)
    | tl(sk2) != Y
    | app(sk1,Y) != X
    | ~ neq(nil,sk2)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).

cnf(191,plain,
    ( ~ ssList(X)
    | sk2 != X
    | ~ ssList(Y)
    | tl(sk2) != Y
    | app(sk1,Y) != X
    | ~ neq(nil,sk2) ),
    inference('REWRITE',[status(thm)],[co1_14,co1_7,co1_5,theory(equality)]) ).

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

cnf(193,plain,
    ssItem(sk5),
    inference('REWRITE',[status(thm)],[co1_15,co1_7,co1_5,theory(equality)]) ).

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

cnf(195,plain,
    ssList(sk6),
    inference('REWRITE',[status(thm)],[co1_16,co1_7,co1_5,theory(equality)]) ).

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

cnf(197,plain,
    cons(sk5,nil) = sk1,
    inference('REWRITE',[status(thm)],[co1_17,co1_7,co1_5,co1_6,theory(equality)]) ).

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

cnf(199,plain,
    app(sk1,sk6) = sk2,
    inference('REWRITE',[status(thm)],[co1_18,co1_7,co1_5,197,theory(equality)]) ).

cnf(3350,plain,
    ( neq(nil,sk2)
    | nil = sk2 ),
    inference('HYPERRESOLVE',[status(thm)],[clause100,co1_2,clause8]) ).

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

cnf(4643,plain,
    neq(nil,sk2),
    inference('REWRITE',[status(thm)],[3350,4640]) ).

cnf(4644,plain,
    ( ~ ssList(X)
    | sk2 != X
    | ~ ssList(Y)
    | tl(sk2) != Y
    | app(sk1,Y) != X ),
    inference('REWRITE',[status(thm)],[191,4643]) ).

cnf(4694,plain,
    tl(cons(sk5,sk6)) = sk6,
    inference('HYPERRESOLVE',[status(thm)],[clause96,193,195]) ).

cnf(5871,plain,
    sk2 = cons(sk5,sk6),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[clause120,193,195]),199,197,theory(equality)]) ).

cnf(5875,plain,
    tl(sk2) = sk6,
    inference('REWRITE',[status(thm)],[4694,5871,theory(equality)]) ).

cnf(5876,plain,
    ( ~ ssList(X)
    | sk2 != X
    | ~ ssList(Y)
    | sk6 != Y
    | app(sk1,Y) != X ),
    inference('REWRITE',[status(thm)],[4644,5875,theory(equality)]) ).

cnf(10577,plain,
    $false,
    inference('HYPERRESOLVE',[status(thm)],[5876,co1_2,195,199,theory(equality),theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SWC014-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.14  % Command  : run-snark %s %d
% 0.14/0.35  % Computer : n026.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Sun Jun 12 12:48:05 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.20/0.48  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.49  * 
% 0.20/0.49  * 
% 0.20/0.49  #<PACKAGE "SNARK-USER">
% 0.20/0.49  * 
% 0.20/0.49  SNARK-TPTP-OPTIONS
% 0.20/0.49  * 
% 0.20/0.49  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.49   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.49   (USE-FACTORING :POS)
% 0.20/0.49   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.49   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.49   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.49   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.49   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.49   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.49   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.49   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.49   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.49   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.49  * 
% 0.20/0.49  "."
% 0.20/0.49  * 
% 0.20/0.49  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-12T12:48:05
% 0.20/0.49  ; 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-12T12:48:05
% 3.76/3.94  
% 3.76/3.94  
% 3.76/3.94  #||
% 3.76/3.94  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.76/3.94  % SZS output start Refutation
% See solution above
% 3.76/3.95  ||#
% 3.76/3.95  
% 3.76/3.95  ; Summary of computation:
% 3.76/3.95  ;     15169 formulas have been input or derived (from 158 formulas).
% 3.76/3.95  ;     10577 (70%) were retained.  Of these,
% 3.76/3.95  ;         2766 (26%) were simplified or subsumed later,
% 3.76/3.95  ;         7811 (74%) are still being kept.
% 3.76/3.95  ; 
% 3.76/3.95  ; Run time in seconds excluding printing time:
% 3.76/3.95  ;     0.038   1%   Read assertion file          (1 call)
% 3.76/3.95  ;     0.006   0%   Assert                       (203 calls)
% 3.76/3.95  ;     0.642  19%   Process new row              (15,148 calls)
% 3.76/3.95  ;     2.210  64%   Resolution                   (314 calls)
% 3.76/3.95  ;     0.002   0%   Paramodulation               (157 calls)
% 3.76/3.95  ;     0.018   1%   Condensing                   (2,522 calls)
% 3.76/3.95  ;     0.035   1%   Forward subsumption          (2,522 calls)
% 3.76/3.95  ;     0.059   2%   Backward subsumption         (2,492 calls)
% 3.76/3.95  ;     0.003   0%   Clause clause subsumption    (1,380 calls)
% 3.76/3.95  ;     0.183   5%   Forward simplification       (15,148 calls)
% 3.76/3.95  ;     0.154   4%   Backward simplification      (10,572 calls)
% 3.76/3.95  ;     0.018   1%   Ordering                     (6,157 calls)
% 3.76/3.95  ;     0.000   0%   Sortal reasoning             (32 calls)
% 3.76/3.95  ;     0.001   0%   Purity testing               (1 call)
% 3.76/3.95  ;     0.081   2%   Other
% 3.76/3.95  ;     3.450        Total
% 3.76/3.95  ;     3.458        Real time
% 3.76/3.95  ; 
% 3.76/3.95  ; Term-hash-array has 17,376 terms in all.
% 3.76/3.95  ; Feature-vector-row-index has 2,441 entries (2,441 at peak, 2,492 added, 51 deleted).
% 3.76/3.95  ; Feature-vector-row-index has 2,644 nodes (2,644 at peak, 3,010 added, 366 deleted).
% 3.76/3.95  ;  Retrieved 9,393 possibly forward subsuming rows in 2,522 calls.
% 3.76/3.95  ;  Retrieved 9,280 possibly backward subsumed rows in 2,492 calls.
% 3.76/3.95  ; Path-index has 13,486 entries (13,486 at peak, 17,479 added, 3,993 deleted).
% 3.76/3.95  ; Path-index has 5,919 nodes (5,919 at peak, 6,494 added, 575 deleted).
% 3.76/3.95  ; Trie-index has 13,486 entries (13,486 at peak, 17,479 added, 3,993 deleted).
% 3.76/3.95  ; Trie-index has 38,096 nodes (38,096 at peak, 49,661 added, 11,565 deleted).
% 3.76/3.95  ; Retrieved 6,001 generalization terms in 43,727 calls.
% 3.76/3.95  ; Retrieved 8,166 instance terms in 8,079 calls.
% 3.76/3.95  ; Retrieved 8,023,309 unifiable terms in 212,705 calls.
% 3.76/3.95  ; 
% 3.76/3.95  ; The agenda of rows to process has 7 entries:
% 3.76/3.95  ;     2 with value 4               1 with value 7                1 with value 19
% 3.76/3.95  ;     2 with value 5               1 with value 8
% 3.76/3.95  ; The agenda of input rows to give has 36 entries:
% 3.76/3.95  ;     5 with value 22              3 with value 26               1 with value 33
% 3.76/3.95  ;     2 with value 23              1 with value 27               1 with value 35
% 3.76/3.95  ;     2 with value 24              1 with value 29               2 with value 40
% 3.76/3.95  ;     8 with value 25              7 with value 32               3 with value 44
% 3.76/3.95  ; The agenda of rows to give has 7618 entries:
% 3.76/3.95  ;     8 with value (4 4)         836 with value (4 13)         153 with value (4 20)
% 3.76/3.95  ;    57 with value (4 5)         536 with value (4 14)         462 with value (4 21)
% 3.76/3.95  ;   108 with value (4 7)        1603 with value (4 15)         126 with value (4 22)
% 3.76/3.95  ;   195 with value (4 8)         249 with value (4 16)          18 with value (4 23)
% 3.76/3.95  ;   277 with value (4 9)        1017 with value (4 17)         147 with value (4 24)
% 3.76/3.95  ;   585 with value (4 10)        412 with value (4 18)          42 with value (4 25)
% 3.76/3.95  ;   407 with value (4 11)        138 with value (4 19)           6 with value (4 28)
% 3.76/3.95  ;   236 with value (4 12)
% 3.76/3.95  Evaluation took:
% 3.76/3.95    3.459 seconds of real time
% 3.76/3.95    3.321477 seconds of user run time
% 3.76/3.95    0.137777 seconds of system run time
% 3.76/3.95    [Run times include 0.335 seconds GC run time.]
% 3.76/3.95    0 calls to %EVAL
% 3.76/3.95    0 page faults and
% 3.76/3.95    315,187,440 bytes consed.
% 3.76/3.95  :PROOF-FOUND
% 3.76/3.95  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-12T12:48:08
% 3.76/3.95  :PROOF-FOUND
% 3.76/3.95  * 
%------------------------------------------------------------------------------