TSTP Solution File: LAT274-2 by DCTP---1.31
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : DCTP---1.31
% Problem : LAT274-2 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : oldtptp
% Command : dctp-wrapper -negpref -complexity -fullrewrite -alternate -resisol %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sat Dec 4 06:20:11 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 LAT274-2.oldtptp on host art11.cs.miami.edu
% starting preprocessing loop for 15 clauses
% no conjecture type clause ... restricting relevance to all-negative clauses
% problem statistics for file /tmp/SystemOnTPTP24820/LAT274-2.oldtptp
% Syntax : Number of clauses : 15 ( 5 non-Horn; 5 unit)
% Number of literals : 45 ( 5 equality)
% Maximal clause size : 5
% Number of predicates : 4 ( 0 propositional; 2-4 arity)
% Number of functors : 16 ( 9 constant; 0-4 arity)
% Number of variables : 42 ( 6 singleton)
% Maximal term depth : 3
% Starting proof
% **************** Exit status is success (PROOF found in 0.01 seconds) ****************
% Proof search statistics:
% ========================
% Length initial path: 15
% Linking steps (succ/fail): 102 / 24
% Eq-linkings (succ/fail): 0 / 0
% Reflexivities (succ/fail): 0 / 0
% E-variants/Order viol.: 0 / 0
% Twin-clause inferences: 1
% Eager eliminations: 0
% Rewrites (subgoal/path): 0 / 0
% GR-closures total/c-foldup: 123 / 1
% Links non-eq/eq: 173 / 0(0)
% Links sweeped vector/all: 0(0) / 0(0)
% Clauses in tableau/pruned: 103 / 93
% Tautology fails: 0
% Renamings/Contractions: 0 / 0
% Variants deleted/subsumed: 50 / 22
% Clauses by splitting: 0
% Variant subsumption tests: 82
% Fails ful/mat/sig/len: 0 / 42 / 18 / 0
% Pre subsumption tests: 140
% Subsumed unit/path/back: 28 / 0 / 1
% Coupled eliminations: 1
% Simplifications/lemmas: 27 / 4 (0)
% Foldups root/context: 2 / 7
% Maximum term depth/compl: 4 / 15
% Relevance vectors: 239
% Unifications/failed: 0 / 0
% Maximum tableau depth: 63
%
%------------------------------------------------------------------------------