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 : 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:56:23 EDT 2022

% Result   : Theorem 0.48s 0.65s
% Output   : Refutation 0.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   27 (  15 unt;   1 nHn;  27 RR)
%            Number of literals    :   60 (  26 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(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(84,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).

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

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(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)
    | tl('SKOLEMAAAV49') != Y
    | app('SKOLEMAAAV48',Y) != X
    | ~ neq(nil,'SKOLEMAAAV49')
    | ~ neq('SKOLEMAAAV51',nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

cnf(196,plain,
    ( ~ ssList(X)
    | 'SKOLEMAAAV49' != X
    | ~ ssList(Y)
    | tl('SKOLEMAAAV49') != Y
    | app('SKOLEMAAAV48',Y) != X
    | ~ 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,
    ( ssList('SKOLEMAAAV53')
    | ~ neq('SKOLEMAAAV51',nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

cnf(200,plain,
    ssList('SKOLEMAAAV53'),
    inference('REWRITE',[status(thm)],[199,194,192,theory(equality)]) ).

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

cnf(202,plain,
    cons('SKOLEMAAAV52',nil) = 'SKOLEMAAAV48',
    inference('REWRITE',[status(thm)],[201,194,192,193,theory(equality)]) ).

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

cnf(204,plain,
    app('SKOLEMAAAV48','SKOLEMAAAV53') = 'SKOLEMAAAV49',
    inference('REWRITE',[status(thm)],[203,194,192,202,theory(equality)]) ).

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

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

cnf(434,plain,
    ( ~ ssList(X)
    | 'SKOLEMAAAV49' != X
    | ~ ssList(Y)
    | tl('SKOLEMAAAV49') != Y
    | app('SKOLEMAAAV48',Y) != X ),
    inference('REWRITE',[status(thm)],[196,433]) ).

cnf(458,plain,
    tl(cons('SKOLEMAAAV52','SKOLEMAAAV53')) = 'SKOLEMAAAV53',
    inference('HYPERRESOLVE',[status(thm)],[95,200,198]) ).

cnf(478,plain,
    cons('SKOLEMAAAV52','SKOLEMAAAV53') = 'SKOLEMAAAV49',
    inference('REWRITE',[status(thm)],[inference('HYPERRESOLVE',[status(thm)],[170,200,198]),204,202,theory(equality)]) ).

cnf(485,plain,
    tl('SKOLEMAAAV49') = 'SKOLEMAAAV53',
    inference('REWRITE',[status(thm)],[458,478,theory(equality)]) ).

cnf(486,plain,
    ( ~ ssList(X)
    | 'SKOLEMAAAV49' != X
    | ~ ssList(Y)
    | 'SKOLEMAAAV53' != Y
    | app('SKOLEMAAAV48',Y) != X ),
    inference('REWRITE',[status(thm)],[434,485,theory(equality)]) ).

cnf(558,plain,
    $false,
    inference('HYPERRESOLVE',[status(thm)],[486,189,200,204,theory(equality),theory(equality)]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWC014+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.13  % Command  : run-snark %s %d
% 0.13/0.33  % Computer : n025.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sun Jun 12 22:00:38 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.46  * 
% 0.19/0.46  * 
% 0.19/0.47  #<PACKAGE "SNARK-USER">
% 0.19/0.47  * 
% 0.19/0.47  SNARK-TPTP-OPTIONS
% 0.19/0.47  * 
% 0.19/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.19/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.19/0.47   (USE-FACTORING :POS)
% 0.19/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.19/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.19/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.19/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.19/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.19/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.19/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.19/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.19/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.19/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.19/0.47  * 
% 0.19/0.47  "."
% 0.19/0.47  * 
% 0.19/0.47  ; Begin refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-12T22:00:38
% 0.19/0.47  ; 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-12T22:00:38
% 0.48/0.65  
% 0.48/0.65  
% 0.48/0.65  #||
% 0.48/0.65  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.48/0.65  % SZS output start Refutation
% See solution above
% 0.48/0.66  ||#
% 0.48/0.66  
% 0.48/0.66  ; Summary of computation:
% 0.48/0.66  ;       886 formulas have been input or derived (from 162 formulas).
% 0.48/0.66  ;       558 (63%) were retained.  Of these,
% 0.48/0.66  ;           82 (15%) were simplified or subsumed later,
% 0.48/0.66  ;          476 (85%) are still being kept.
% 0.48/0.66  ; 
% 0.48/0.66  ; Run time in seconds excluding printing time:
% 0.48/0.66  ;     0.027  14%   Read assertion file          (1 call)
% 0.48/0.66  ;     0.009   5%   Assert                       (96 calls)
% 0.48/0.66  ;     0.029  16%   Process new row              (866 calls)
% 0.48/0.66  ;     0.060  32%   Resolution                   (322 calls)
% 0.48/0.66  ;     0.001   1%   Paramodulation               (161 calls)
% 0.48/0.66  ;     0.007   4%   Condensing                   (293 calls)
% 0.48/0.66  ;     0.004   2%   Forward subsumption          (293 calls)
% 0.48/0.66  ;     0.005   3%   Backward subsumption         (292 calls)
% 0.48/0.66  ;     0.001   1%   Clause clause subsumption    (77 calls)
% 0.48/0.66  ;     0.010   5%   Forward simplification       (866 calls)
% 0.48/0.66  ;     0.008   4%   Backward simplification      (553 calls)
% 0.48/0.66  ;     0.000   0%   Ordering                     (302 calls)
% 0.48/0.66  ;     0.000   0%   Sortal reasoning             (32 calls)
% 0.48/0.66  ;     0.001   1%   Purity testing               (1 call)
% 0.48/0.66  ;     0.025  13%   Other
% 0.48/0.66  ;     0.187        Total
% 0.48/0.66  ;     0.197        Real time
% 0.48/0.66  ; 
% 0.48/0.66  ; Term-hash-array has 869 terms in all.
% 0.48/0.66  ; Feature-vector-row-index has 276 entries (276 at peak, 292 added, 16 deleted).
% 0.48/0.66  ; Feature-vector-row-index has 864 nodes (864 at peak, 909 added, 45 deleted).
% 0.48/0.66  ;  Retrieved 129 possibly forward subsuming rows in 293 calls.
% 0.48/0.66  ;  Retrieved 97 possibly backward subsumed rows in 292 calls.
% 0.48/0.66  ; Path-index has 796 entries (796 at peak, 914 added, 118 deleted).
% 0.48/0.66  ; Path-index has 1,350 nodes (1,350 at peak, 1,418 added, 68 deleted).
% 0.48/0.66  ; Trie-index has 796 entries (796 at peak, 914 added, 118 deleted).
% 0.48/0.66  ; Trie-index has 1,630 nodes (1,630 at peak, 1,789 added, 159 deleted).
% 0.48/0.66  ; Retrieved 437 generalization terms in 1,837 calls.
% 0.48/0.66  ; Retrieved 260 instance terms in 260 calls.
% 0.48/0.66  ; Retrieved 143,931 unifiable terms in 6,763 calls.
% 0.48/0.66  ; 
% 0.48/0.66  ; The agenda of rows to process has 7 entries:
% 0.48/0.66  ;     2 with value 4               1 with value 7                1 with value 19
% 0.48/0.66  ;     2 with value 5               1 with value 8
% 0.48/0.66  ; The agenda of input rows to give has 36 entries:
% 0.48/0.66  ;     5 with value 22              3 with value 26               1 with value 35
% 0.48/0.66  ;     2 with value 23              6 with value 27               3 with value 40
% 0.48/0.66  ;     3 with value 24              1 with value 29               3 with value 44
% 0.48/0.66  ;     8 with value 25              1 with value 32
% 0.48/0.66  ; The agenda of rows to give has 278 entries:
% 0.48/0.66  ;     8 with value (4 4)          18 with value (4 8)            4 with value (4 12)
% 0.48/0.66  ;    57 with value (4 5)          78 with value (4 9)           20 with value (4 13)
% 0.48/0.66  ;     4 with value (4 6)          25 with value (4 10)           5 with value (4 15)
% 0.48/0.66  ;    32 with value (4 7)          27 with value (4 11)
% 0.48/0.66  Evaluation took:
% 0.48/0.66    0.197 seconds of real time
% 0.48/0.66    0.179919 seconds of user run time
% 0.48/0.66    0.017436 seconds of system run time
% 0.48/0.66    [Run times include 0.008 seconds GC run time.]
% 0.48/0.66    0 calls to %EVAL
% 0.48/0.66    0 page faults and
% 0.48/0.66    14,326,880 bytes consed.
% 0.48/0.66  :PROOF-FOUND
% 0.48/0.66  ; End refute-file /export/starexec/sandbox2/benchmark/theBenchmark.p 2022-06-12T22:00:38
% 0.48/0.66  :PROOF-FOUND
% 0.48/0.66  * 
%------------------------------------------------------------------------------