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

View Problem - Process Solution

%------------------------------------------------------------------------------
% 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 : n014.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   : Unsatisfiable 67.75s 67.94s
% Output   : Refutation 67.75s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   27 (  15 unt;   2 nHn;  27 RR)
%            Number of literals    :   69 (  29 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(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(clause97,axiom,
    ( ~ ssItem(X)
    | ~ ssList(Y)
    | hd(cons(X,Y)) = X ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause97) ).

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_1,negated_conjecture,
    ssList(sk1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).

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_12,negated_conjecture,
    ( ~ ssList(X)
    | sk2 != X
    | ~ ssList(Y)
    | app(Y,sk1) != X
    | ~ ssItem(Z)
    | cons(Z,nil) != Y
    | hd(sk2) != Z
    | ~ neq(nil,sk2)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).

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

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

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

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

cnf(195,plain,
    app(cons(sk5,nil),sk1) = sk2,
    inference('REWRITE',[status(thm)],[co1_14,co1_7,co1_5,co1_6,theory(equality)]) ).

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

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

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

cnf(4456,plain,
    neq(nil,sk2),
    inference('REWRITE',[status(thm)],[3219,4453]) ).

cnf(4457,plain,
    ( ~ ssList(X)
    | sk2 != X
    | ~ ssList(Y)
    | app(Y,sk1) != X
    | ~ ssItem(Z)
    | cons(Z,nil) != Y
    | hd(sk2) != Z ),
    inference('REWRITE',[status(thm)],[191,4456]) ).

cnf(5047,plain,
    hd(cons(sk5,sk1)) = sk5,
    inference('HYPERRESOLVE',[status(thm)],[clause97,193,co1_1]) ).

cnf(5650,plain,
    sk2 = cons(sk5,sk1),
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[clause120,193,co1_1]),195,theory(equality)]) ).

cnf(5656,plain,
    hd(sk2) = sk5,
    inference('REWRITE',[status(thm)],[5047,5650,theory(equality)]) ).

cnf(5657,plain,
    ( ~ ssList(X)
    | sk2 != X
    | ~ ssList(Y)
    | app(Y,sk1) != X
    | ~ ssItem(Z)
    | cons(Z,nil) != Y
    | sk5 != Z ),
    inference('REWRITE',[status(thm)],[4457,5656,theory(equality)]) ).

cnf(55554,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[5657,co1_2,195,193,theory(equality),theory(equality),theory(equality)]),1560]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : SWC416-1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/0.12  % Command  : run-snark %s %d
% 0.12/0.33  % Computer : n014.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sun Jun 12 02:29:53 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.43  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.44  * 
% 0.19/0.44  * 
% 0.19/0.45  #<PACKAGE "SNARK-USER">
% 0.19/0.45  * 
% 0.19/0.45  SNARK-TPTP-OPTIONS
% 0.19/0.45  * 
% 0.19/0.45  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.45   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.45   (USE-FACTORING :POS)
% 0.19/0.45   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.45   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.45   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.45   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.45   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.45   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.45   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.45   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.45   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.45   (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.45  * 
% 0.19/0.45  "."
% 0.19/0.45  * 
% 0.19/0.45  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-12T02:29:53
% 0.19/0.45  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n014.cluster.edu at 2022-06-12T02:29:53
% 67.75/67.94  
% 67.75/67.94  
% 67.75/67.94  #||
% 67.75/67.94  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 67.75/67.94  % SZS output start Refutation
% See solution above
% 67.75/67.95  ||#
% 67.75/67.95  
% 67.75/67.95  ; Summary of computation:
% 67.75/67.95  ;    111260 formulas have been input or derived (from 178 formulas).
% 67.75/67.95  ;     55554 (50%) were retained.  Of these,
% 67.75/67.95  ;         2669 ( 5%) were simplified or subsumed later,
% 67.75/67.95  ;        52885 (95%) are still being kept.
% 67.75/67.95  ; 
% 67.75/67.95  ; Run time in seconds excluding printing time:
% 67.75/67.95  ;     0.037   0%   Read assertion file          (1 call)
% 67.75/67.95  ;     0.006   0%   Assert                       (199 calls)
% 67.75/67.95  ;     5.850   9%   Process new row              (106,727 calls)
% 67.75/67.95  ;    53.397  79%   Resolution                   (354 calls)
% 67.75/67.95  ;     0.047   0%   Paramodulation               (177 calls)
% 67.75/67.95  ;     0.028   0%   Condensing                   (3,308 calls)
% 67.75/67.95  ;     0.077   0%   Forward subsumption          (3,308 calls)
% 67.75/67.95  ;     0.161   0%   Backward subsumption         (3,276 calls)
% 67.75/67.95  ;     0.003   0%   Clause clause subsumption    (1,329 calls)
% 67.75/67.95  ;     2.770   4%   Forward simplification       (106,727 calls)
% 67.75/67.95  ;     4.013   6%   Backward simplification      (55,551 calls)
% 67.75/67.95  ;     0.683   1%   Ordering                     (112,823 calls)
% 67.75/67.95  ;     0.000   0%   Sortal reasoning             (32 calls)
% 67.75/67.95  ;     0.001   0%   Purity testing               (1 call)
% 67.75/67.95  ;     0.414   1%   Other
% 67.75/67.95  ;    67.487        Total
% 67.75/67.95  ;    67.497        Real time
% 67.75/67.95  ; 
% 67.75/67.95  ; Term-hash-array has 147,172 terms in all.
% 67.75/67.95  ; Feature-vector-row-index has 3,227 entries (3,227 at peak, 3,276 added, 49 deleted).
% 67.75/67.95  ; Feature-vector-row-index has 4,529 nodes (4,529 at peak, 4,894 added, 365 deleted).
% 67.75/67.95  ;  Retrieved 12,055 possibly forward subsuming rows in 3,308 calls.
% 67.75/67.95  ;  Retrieved 11,423 possibly backward subsumed rows in 3,276 calls.
% 67.75/67.95  ; Path-index has 143,411 entries (143,411 at peak, 147,272 added, 3,861 deleted).
% 67.75/67.95  ; Path-index has 8,725 nodes (8,725 at peak, 9,278 added, 553 deleted).
% 67.75/67.95  ; Trie-index has 143,411 entries (143,411 at peak, 147,272 added, 3,861 deleted).
% 67.75/67.95  ; Trie-index has 698,206 nodes (698,206 at peak, 709,556 added, 11,350 deleted).
% 67.75/67.95  ; Retrieved 98,270 generalization terms in 551,470 calls.
% 67.75/67.95  ; Retrieved 95,860 instance terms in 94,556 calls.
% 67.75/67.95  ; Retrieved 178,036,206 unifiable terms in 3,932,865 calls.
% 67.75/67.95  ; 
% 67.75/67.95  ; The agenda of rows to process has 1 entry:
% 67.75/67.95  ;     1 with value 34
% 67.75/67.95  ; The agenda of input rows to give has 14 entries:
% 67.75/67.95  ;     7 with value 32              1 with value 35               3 with value 44
% 67.75/67.95  ;     1 with value 33              2 with value 40
% 67.75/67.95  ; The agenda of rows to give has 52694 entries:
% 67.75/67.95  ;    44 with value (4 5)        1696 with value (4 15)        9498 with value (4 24)
% 67.75/67.95  ;   110 with value (4 7)         660 with value (4 16)        7121 with value (4 25)
% 67.75/67.95  ;   189 with value (4 8)        2432 with value (4 17)        2502 with value (4 26)
% 67.75/67.95  ;   231 with value (4 9)        2374 with value (4 18)        3906 with value (4 27)
% 67.75/67.95  ;   528 with value (4 10)        247 with value (4 19)         222 with value (4 28)
% 67.75/67.95  ;   391 with value (4 11)       3690 with value (4 20)         576 with value (4 29)
% 67.75/67.95  ;   249 with value (4 12)        552 with value (4 21)          21 with value (4 33)
% 67.75/67.95  ;   763 with value (4 13)      12426 with value (4 22)           6 with value (4 39)
% 67.75/67.95  ;   667 with value (4 14)       1593 with value (4 23)
% 67.75/67.95  Evaluation took:
% 67.75/67.95    67.5 seconds of real time
% 67.75/67.95    66.13459 seconds of user run time
% 67.75/67.95    1.358034 seconds of system run time
% 67.75/67.95    [Run times include 9.458 seconds GC run time.]
% 67.75/67.95    0 calls to %EVAL
% 67.75/67.95    0 page faults and
% 67.75/67.95    5,059,279,024 bytes consed.
% 67.75/67.95  :PROOF-FOUND
% 67.75/67.95  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-06-12T02:31:00
% 67.75/67.95  :PROOF-FOUND
% 67.75/67.95  * 
%------------------------------------------------------------------------------