TSTP Solution File: NLP117-1 by DCTP---1.31

View Problem - Process Solution

```%------------------------------------------------------------------------------
% File     : DCTP---1.31
% Problem  : NLP117-1 : TPTP v5.0.0. Released v2.4.0.
% Transfm  : none
% Format   : oldtptp
% Command  : dctp-wrapper -negpref -complexity -fullrewrite -alternate -resisol %s

% Computer : art06.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory   : 2018MB
% OS       : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Sat Dec  4 10:48:57 EST 2010

% Result   : Unsatisfiable 0.00s
% Output   : Assurance 0.00s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% running dctp on problem file NLP117-1.oldtptp on host art06.cs.miami.edu
% starting preprocessing loop for 36 clauses
% no conjecture type clause ... restricting relevance to all-negative clauses
% input formula is in Bernays-Schönfinkel class
% problem statistics for file /tmp/SystemOnTPTP14498/NLP117-1.oldtptp
%   	Syntax :	Number of clauses :	36 ( 16 non-Horn; 2 unit)
%   			Number of literals :	102 ( 0 equality)
%   			Maximal clause size :	18
%   			Number of predicates :	18 ( 1 propositional; 0-3 arity)
%   			Number of functors :	12 ( 12 constant; 0-0 arity)
%   			Number of variables :	12 ( 0 singleton)
%   			Maximal term depth :	1
% Starting proof
% **************** Exit status is success (PROOF found in 0.0 seconds) ****************
% Proof search statistics:
% ========================
% Length initial path:        36
% Linking steps (succ/fail):  37 / 257
% Twin-clause inferences:     1
% Eager eliminations:         0
% Rewrites (subgoal/path):    0 / 0
% GR-closures total/c-foldup: 56 / 0
% Links generated/deleted:    294 / 277
% Links sweeped vector/all:   0(0) / 0(0)
% Clauses in tableau/pruned:  38 / 20
% Regularity/Tautology fails: 240 / 0 (0)
% Renamings/Contractions:     32 / 0
% Variants deleted/subsumed:  17 / 0
% Clauses by splitting:       0
% Variant subsumption tests:  0
% Fails ful/mat/sig/len:      0 / 0 / 0 / 0
% Pre subsumption tests:      1190
% Subsumed unit/path/back:    20 / 0 / 16
% Coupled eliminations:       255
% Simplifications/lemmas:     35 / 16 (0)
% Foldups root/context:       1 / 16
% Maximum term depth/compl:   1 / 3
% Relevance vectors:          112
% Unifications/failed:        0 / 0
% Maximum tableau depth:      19
%
%------------------------------------------------------------------------------
```