TSTP Solution File: LCL668+1.001 by SNARK---20120808r022

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SNARK---20120808r022
% Problem  : LCL668+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run-snark %s %d

% Computer : n016.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 : Sun Jul 17 14:24:51 EDT 2022

% Result   : Theorem 32.11s 32.32s
% Output   : Refutation 32.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   18 (  10 unt;   4 nHn;  17 RR)
%            Number of literals    :   68 (   0 equ;  51 neg)
%            Maximal clause size   :   10 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :   45 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    r1(X,X),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity) ).

cnf(2,negated_conjecture,
    r1('SKOLEMAAAU1','SKOLEMAAAU2'),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).

cnf(3,negated_conjecture,
    r1('SKOLEMAAAU2','SKOLEMAAAU3'),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).

cnf(9,negated_conjecture,
    ( ~ r1('SKOLEMAAAU1',X)
    | ~ r1(X,Y)
    | ~ r1(Y,Z)
    | ~ r1(Z,U)
    | ~ r1(U,V)
    | ~ r1(V,W)
    | ~ r1(W,X1)
    | ~ r1(X1,Y1)
    | p5(Y1)
    | p1(Y1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).

cnf(12,negated_conjecture,
    ( ~ r1('SKOLEMAAAU1',X)
    | ~ r1(X,Y)
    | ~ r1(Y,Z)
    | ~ r1(Z,U)
    | ~ r1(U,V)
    | ~ r1(V,W)
    | ~ r1(W,X1)
    | ~ r1(X1,Y1)
    | p4(Y1)
    | p5(Y1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).

cnf(14,negated_conjecture,
    ( ~ r1('SKOLEMAAAU1',X)
    | ~ r1(X,Y)
    | r1(Y,'SKOLEMAAAU10'(Y)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).

cnf(15,negated_conjecture,
    ( ~ r1('SKOLEMAAAU1',X)
    | ~ r1(X,Y)
    | ~ p5('SKOLEMAAAU10'(Y)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).

cnf(17,negated_conjecture,
    ( ~ r1('SKOLEMAAAU1',X)
    | ~ r1(X,Y)
    | ~ r1(Y,Z)
    | ~ r1(Z,U)
    | ~ r1(U,V)
    | ~ r1(V,W)
    | ~ r1(W,X1)
    | ~ r1(X1,Y1)
    | ~ p4(Y1)
    | ~ p3(Y1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).

cnf(20,negated_conjecture,
    ( ~ r1('SKOLEMAAAU1',X)
    | ~ r1(X,Y)
    | ~ r1(Y,Z)
    | ~ r1(Z,U)
    | ~ r1(U,V)
    | ~ r1(V,W)
    | ~ r1(W,X1)
    | ~ r1(X1,Y1)
    | p2(Y1)
    | p3(Y1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).

cnf(25,negated_conjecture,
    ( ~ r1('SKOLEMAAAU1',X)
    | ~ r1(X,Y)
    | ~ r1(Y,Z)
    | ~ r1(Z,U)
    | ~ r1(U,V)
    | ~ r1(V,W)
    | ~ r1(W,X1)
    | ~ r1(X1,Y1)
    | ~ p2(Y1)
    | ~ p1(Y1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).

cnf(36,plain,
    ~ p5('SKOLEMAAAU10'('SKOLEMAAAU3')),
    inference('UR-RESOLVE',[status(thm)],[15,2,3]) ).

cnf(42,plain,
    r1('SKOLEMAAAU3','SKOLEMAAAU10'('SKOLEMAAAU3')),
    inference('HYPERRESOLVE',[status(thm)],[14,2,3]) ).

cnf(199,plain,
    p4('SKOLEMAAAU10'('SKOLEMAAAU3')),
    inference('UR-RESOLVE',[status(thm)],[12,42,2,3,1,1,1,1,1,36]) ).

cnf(200,plain,
    p1('SKOLEMAAAU10'('SKOLEMAAAU3')),
    inference('UR-RESOLVE',[status(thm)],[9,42,2,3,1,1,1,1,1,36]) ).

cnf(205,plain,
    ( p2('SKOLEMAAAU10'('SKOLEMAAAU3'))
    | p3('SKOLEMAAAU10'('SKOLEMAAAU3')) ),
    inference('HYPERRESOLVE',[status(thm)],[20,42,2,3,1,1,1,1,1]) ).

cnf(392,plain,
    ~ p3('SKOLEMAAAU10'('SKOLEMAAAU3')),
    inference('UR-RESOLVE',[status(thm)],[17,199,2,3,42,1,1,1,1,1]) ).

cnf(393,plain,
    p2('SKOLEMAAAU10'('SKOLEMAAAU3')),
    inference('REWRITE',[status(thm)],[205,392]) ).

cnf(394,plain,
    $false,
    inference('REWRITE',[status(thm)],[inference('UR-RESOLVE',[status(thm)],[25,200,2,3,42,1,1,1,1,1]),393]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL668+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13  % Command  : run-snark %s %d
% 0.13/0.34  % Computer : n016.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.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jul  3 07:54:45 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.45  /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.46  * 
% 0.20/0.46  * 
% 0.20/0.47  #<PACKAGE "SNARK-USER">
% 0.20/0.47  * 
% 0.20/0.47  SNARK-TPTP-OPTIONS
% 0.20/0.47  * 
% 0.20/0.47  ((AGENDA-LENGTH-LIMIT NIL) (AGENDA-LENGTH-BEFORE-SIMPLIFICATION-LIMIT NIL)
% 0.20/0.47   (USE-HYPERRESOLUTION T) (USE-UR-RESOLUTION T) (USE-PARAMODULATION T)
% 0.20/0.47   (USE-FACTORING :POS)
% 0.20/0.47   (USE-LITERAL-ORDERING-WITH-HYPERRESOLUTION 'LITERAL-ORDERING-P)
% 0.20/0.47   (USE-LITERAL-ORDERING-WITH-PARAMODULATION 'LITERAL-ORDERING-P)
% 0.20/0.47   (ORDERING-FUNCTIONS>CONSTANTS T) (ASSERT-CONTEXT :CURRENT)
% 0.20/0.47   (RUN-TIME-LIMIT 300) (LISTEN-FOR-COMMANDS NIL)
% 0.20/0.47   (USE-CLOSURE-WHEN-SATISFIABLE T) (PRINT-ROWS-WHEN-GIVEN NIL)
% 0.20/0.47   (PRINT-ROWS-WHEN-DERIVED NIL) (PRINT-UNORIENTABLE-ROWS NIL)
% 0.20/0.47   (PRINT-ROW-WFFS-PRETTILY NIL) (PRINT-FINAL-ROWS :TPTP)
% 0.20/0.47   (PRINT-OPTIONS-WHEN-STARTING NIL) (USE-VARIABLE-NAME-SORTS NIL)
% 0.20/0.47   (USE-PURITY-TEST T) (USE-RELEVANCE-TEST T) (DECLARE-TPTP-SYMBOLS1)
% 0.20/0.47   (DECLARE-TPTP-SYMBOLS2))
% 0.20/0.47  * 
% 0.20/0.47  "."
% 0.20/0.47  * 
% 0.20/0.47  ; Begin refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T07:54:45
% 0.20/0.47  ; Running SNARK from /davis/home/graph/tptp/Systems/SNARK---20120808r022/Source/snark-system.lisp in SBCL 1.0.12 on n016.cluster.edu at 2022-07-03T07:54:45
% 0.20/0.48  WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.48  WARNING: In quantification, variable ?Y is being rebound.
% 0.20/0.48  WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.48  WARNING: In quantification, variable ?Y is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?Y is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?Y is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?Y is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?Y is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?Y is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?Y is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?Y is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?Y is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?Y is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?Y is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?Y is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?Y is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?Y is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?Y is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?Y is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?Y is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?Y is being rebound.
% 0.20/0.49  WARNING: In quantification, variable ?X is being rebound.
% 0.20/0.49  WARNING:
% 0.20/0.49     |p7| is a 1-ary relation that occurs only negatively; disabling rows that contain it.
% 0.20/0.49  WARNING:
% 0.20/0.49     |p12| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.20/0.49  WARNING:
% 0.20/0.49     |p10| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.20/0.49  WARNING:
% 0.20/0.49     |p8| is a 1-ary relation that occurs only positively; disabling rows that contain it.
% 0.20/0.49  WARNING:
% 0.20/0.49     |p6| is a 1-ary relation that occurs only negatively; disabling rows that contain it.
% 32.11/32.32  
% 32.11/32.32  
% 32.11/32.32  #||
% 32.11/32.32  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 32.11/32.32  % SZS output start Refutation
% See solution above
% 32.11/32.32  ||#
% 32.11/32.32  
% 32.11/32.32  ; Summary of computation:
% 32.11/32.32  ;     13029 formulas have been input or derived (from 156 formulas).
% 32.11/32.32  ;       394 ( 3%) were retained.  Of these,
% 32.11/32.32  ;            1 ( 0%) were simplified or subsumed later,
% 32.11/32.32  ;          393 (100%) are still being kept.
% 32.11/32.32  ; 
% 32.11/32.32  ; Run time in seconds excluding printing time:
% 32.11/32.32  ;     0.006   0%   Read assertion file          (1 call)
% 32.11/32.32  ;     0.005   0%   Assert                       (2 calls)
% 32.11/32.32  ;     0.023   0%   Process new row              (4,688 calls)
% 32.11/32.32  ;    31.705 100%   Resolution                   (310 calls)
% 32.11/32.32  ;     0.005   0%   Paramodulation               (155 calls)
% 32.11/32.32  ;     0.000   0%   Factoring                    (70 calls)
% 32.11/32.32  ;     0.004   0%   Condensing                   (3,218 calls)
% 32.11/32.32  ;     0.037   0%   Forward subsumption          (3,218 calls)
% 32.11/32.32  ;     0.001   0%   Backward subsumption         (145 calls)
% 32.11/32.32  ;     0.002   0%   Clause clause subsumption    (3,073 calls)
% 32.11/32.32  ;     0.017   0%   Forward simplification       (4,684 calls)
% 32.11/32.32  ;     0.001   0%   Backward simplification      (394 calls)
% 32.11/32.32  ;     0.001   0%   Ordering                     (142 calls)
% 32.11/32.32  ;     0.002   0%   Sortal reasoning             (32 calls)
% 32.11/32.32  ;     0.001   0%   Purity testing               (1 call)
% 32.11/32.32  ;     0.033   0%   Other
% 32.11/32.32  ;    31.843        Total
% 32.11/32.32  ;    31.851        Real time
% 32.11/32.32  ; 
% 32.11/32.32  ; Term-hash-array has 504 terms in all.
% 32.11/32.32  ; Feature-vector-row-index has 144 entries (145 at peak, 145 added, 1 deleted).
% 32.11/32.32  ; Feature-vector-row-index has 282 nodes (282 at peak, 282 added, 0 deleted).
% 32.11/32.32  ;  Retrieved 5,541 possibly forward subsuming rows in 3,218 calls.
% 32.11/32.32  ;  Retrieved 53 possibly backward subsumed rows in 145 calls.
% 32.11/32.32  ; Path-index has 518 entries (518 at peak, 519 added, 1 deleted).
% 32.11/32.32  ; Path-index has 634 nodes (634 at peak, 635 added, 1 deleted).
% 32.11/32.32  ; Trie-index has 518 entries (518 at peak, 519 added, 1 deleted).
% 32.11/32.32  ; Trie-index has 781 nodes (781 at peak, 782 added, 1 deleted).
% 32.11/32.32  ; Retrieved 1,732 generalization terms in 6,769 calls.
% 32.11/32.32  ; Retrieved 248 instance terms in 248 calls.
% 32.11/32.32  ; Retrieved 58,560,608 unifiable terms in 14,471,175 calls.
% 32.11/32.32  ; 
% 32.11/32.32  ; The agenda of rows to process has 1 entry:
% 32.11/32.32  ;     1 with value 8
% 32.11/32.32  ; The agenda of rows to give has 237 entries:
% 32.11/32.32  ;    47 with value (4 7)          64 with value (4 9)           43 with value (4 12)
% 32.11/32.32  ;    15 with value (4 8)          68 with value (4 11)
% 32.11/32.32  Evaluation took:
% 32.11/32.32    31.852 seconds of real time
% 32.11/32.32    31.744974 seconds of user run time
% 32.11/32.32    0.100878 seconds of system run time
% 32.11/32.32    [Run times include 0.778 seconds GC run time.]
% 32.11/32.32    0 calls to %EVAL
% 32.11/32.32    0 page faults and
% 32.11/32.32    4,006,130,376 bytes consed.
% 32.11/32.32  :PROOF-FOUND
% 32.11/32.32  ; End refute-file /export/starexec/sandbox/benchmark/theBenchmark.p 2022-07-03T07:55:17
% 32.11/32.32  :PROOF-FOUND
% 32.11/32.32  * 
%------------------------------------------------------------------------------