TSTP Solution File: SWV424-1.050 by DCTP---1.31
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : DCTP---1.31
% Problem : SWV424-1.050 : TPTP v5.0.0. Released v3.5.0.
% Transfm : none
% Format : oldtptp
% Command : dctp-wrapper -negpref -complexity -fullrewrite -alternate -resisol %s
% Computer : art03.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 : Sun Dec 5 03:14:16 EST 2010
% Result : Unsatisfiable 0.00s
% Output : Assurance 0.00s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% running dctp on problem file SWV424-1.050.oldtptp on host art03.cs.miami.edu
% starting preprocessing loop for 73 clauses
% starting preprocessing loop for 67 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% starting preprocessing loop for 64 clauses
% no conjecture type clause ... restricting relevance to all-negative clauses
% input formula is in Bernays-Schönfinkel class
% problem statistics for file /tmp/SystemOnTPTP19545/SWV424-1.050.oldtptp
% Syntax : Number of clauses : 64 ( 7 non-Horn; 51 unit)
% Number of literals : 235 ( 0 equality)
% Maximal clause size : 53
% Number of predicates : 7 ( 0 propositional; 1-2 arity)
% Number of functors : 52 ( 52 constant; 0-0 arity)
% Number of variables : 16 ( 0 singleton)
% Maximal term depth : 1
% Starting proof
% **************** Exit status is success (PROOF found in 1.15 seconds) ****************
% Proof search statistics:
% ========================
% Length initial path: 64
% Linking steps (succ/fail): 21759 / 11997
% Twin-clause inferences: 92
% Eager eliminations: 0
% Rewrites (subgoal/path): 0 / 0
% GR-closures total/c-foldup: 22375 / 3357
% Links generated/deleted: 7058 / 6612
% Links sweeped vector/all: 0(0) / 0(0)
% Clauses in tableau/pruned: 21851 / 10953
% Regularity/Tautology fails: 5053 / 0 (0)
% Renamings/Contractions: 239 / 0
% Variants deleted/subsumed: 146 / 53
% Clauses by splitting: 0
% Variant subsumption tests: 53
% Fails ful/mat/sig/len: 0 / 0 / 0 / 0
% Pre subsumption tests: 82962
% Subsumed unit/path/back: 28187 / 0 / 29
% Coupled eliminations: 111
% Simplifications/lemmas: 19241 / 148 (0)
% Foldups root/context: 80 / 10819
% Maximum term depth/compl: 1 / 2
% Relevance vectors: 55193
% Unifications/failed: 0 / 0
% Maximum tableau depth: 292
% Killed 1 orphans
%
%------------------------------------------------------------------------------