TSTP Solution File: LCL033-1 by DCTP---1.31
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : DCTP---1.31
% Problem : LCL033-1 : TPTP v5.0.0. Released v1.0.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:33:54 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 LCL033-1.oldtptp on host art11.cs.miami.edu
% starting preprocessing loop for 3 clauses
% starting preprocessing loop for 3 clauses
% no conjecture type clause ... restricting relevance to all-negative clauses
% input formula is Horn
% problem statistics for file /tmp/SystemOnTPTP26902/LCL033-1.oldtptp
% Syntax : Number of clauses : 3 ( 0 non-Horn; 1 unit)
% Number of literals : 6 ( 0 equality)
% Maximal clause size : 3
% Number of predicates : 1 ( 0 propositional; 1-1 arity)
% Number of functors : 4 ( 3 constant; 0-2 arity)
% Number of variables : 8 ( 2 singleton)
% Maximal term depth : 6
% Starting proof
% **************** Exit status is success (PROOF found in 0.0 seconds) ****************
% Proof search statistics:
% ========================
% Length initial path: 3
% Linking steps (succ/fail): 27 / 17
% Twin-clause inferences: 0
% Eager eliminations: 0
% Rewrites (subgoal/path): 0 / 0
% GR-closures total/c-foldup: 0 / 0
% Links generated/deleted: 56 / 41
% Links sweeped vector/all: 0(0) / 0(0)
% Clauses in tableau/pruned: 27 / 27
% Regularity/Tautology fails: 4 / 0 (0)
% Renamings/Contractions: 1 / 0
% Variants deleted/subsumed: 0 / 1
% Clauses by splitting: 0
% Variant subsumption tests: 4
% Fails ful/mat/sig/len: 0 / 1 / 0 / 2
% Pre subsumption tests: 6
% Subsumed unit/path/back: 43 / 0 / 5
% Coupled eliminations: 0
% Simplifications/lemmas: 27 / 19 (0)
% Foldups root/context: 0 / 0
% Maximum term depth/compl: 6 / 17
% Relevance vectors: 29
% Unifications/failed: 0 / 0
% Maximum tableau depth: 26
%
%------------------------------------------------------------------------------