TSTP Solution File: SWV419-1.010 by DCTP---1.31
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : DCTP---1.31
% Problem : SWV419-1.010 : 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 02:41:49 EST 2010
% Result : Unsatisfiable 5.96s
% Output : Assurance 5.96s
% 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 SWV419-1.010.oldtptp on host art03.cs.miami.edu
% starting preprocessing loop for 169 clauses
% starting preprocessing loop for 157 clauses
% starting preprocessing loop for 146 clauses
% starting preprocessing loop for 145 clauses
% starting preprocessing loop for 145 clauses
% starting preprocessing loop for 145 clauses
% starting preprocessing loop for 145 clauses
% starting preprocessing loop for 145 clauses
% starting preprocessing loop for 145 clauses
% starting preprocessing loop for 145 clauses
% starting preprocessing loop for 145 clauses
% starting preprocessing loop for 145 clauses
% starting preprocessing loop for 145 clauses
% starting preprocessing loop for 145 clauses
% starting preprocessing loop for 145 clauses
% starting preprocessing loop for 145 clauses
% starting preprocessing loop for 145 clauses
% starting preprocessing loop for 145 clauses
% starting preprocessing loop for 145 clauses
% starting preprocessing loop for 145 clauses
% starting preprocessing loop for 145 clauses
% no conjecture type clause ... restricting relevance to all-negative clauses
% input formula is in Bernays-Schönfinkel class
% problem statistics for file /tmp/SystemOnTPTP17152/SWV419-1.010.oldtptp
% Syntax : Number of clauses : 145 ( 34 non-Horn; 21 unit)
% Number of literals : 386 ( 0 equality)
% Maximal clause size : 38
% Number of predicates : 37 ( 0 propositional; 1-4 arity)
% Number of functors : 31 ( 31 constant; 0-0 arity)
% Number of variables : 320 ( 15 singleton)
% Maximal term depth : 1
% Starting proof
% **************** Exit status is success (PROOF found in 7.0 seconds) ****************
% Proof search statistics:
% ========================
% Length initial path: 145
% Linking steps (succ/fail): 126648 / 53834
% Twin-clause inferences: 334
% Eager eliminations: 0
% Rewrites (subgoal/path): 0 / 0
% GR-closures total/c-foldup: 134073 / 2552
% Links generated/deleted: 176273 / 176042
% Links sweeped vector/all: 19958(2) / 0(0)
% Clauses in tableau/pruned: 126982 / 120338
% Regularity/Tautology fails: 787 / 2 (0)
% Renamings/Contractions: 1053 / 1
% Variants deleted/subsumed: 135669 / 1075
% Clauses by splitting: 0
% Variant subsumption tests: 415919
% Fails ful/mat/sig/len: 386 / 53431 / 268171 / 92856
% Pre subsumption tests: 379312
% Subsumed unit/path/back: 28266 / 0 / 302
% Coupled eliminations: 1006
% Simplifications/lemmas: 29184 / 450 (0)
% Foldups root/context: 463 / 6278
% Maximum term depth/compl: 1 / 4
% Relevance vectors: 267635
% Unifications/failed: 0 / 0
% Maximum tableau depth: 1811
% WARNING: TreeLimitedRun lost 5.96s, total lost is 5.96s
% Killed 1 orphans
%
%------------------------------------------------------------------------------