TSTP Solution File: ANA010-2 by DCTP---1.31
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : DCTP---1.31
% Problem : ANA010-2 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : oldtptp
% Command : dctp-wrapper -negpref -complexity -fullrewrite -alternate -resisol %s
% Computer : art05.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 : Fri Dec 3 17:05:55 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 ANA010-2.oldtptp on host art05.cs.miami.edu
% starting preprocessing loop for 9 clauses
% no conjecture type clause ... restricting relevance to all-negative clauses
% input formula is Horn
% problem statistics for file /tmp/SystemOnTPTP11975/ANA010-2.oldtptp
% Syntax : Number of clauses : 9 ( 0 non-Horn; 4 unit)
% Number of literals : 17 ( 2 equality)
% Maximal clause size : 4
% Number of predicates : 5 ( 0 propositional; 1-3 arity)
% Number of functors : 8 ( 3 constant; 0-3 arity)
% Number of variables : 14 ( 1 singleton)
% Maximal term depth : 5
% Starting proof
% **************** Exit status is success (PROOF found in 0.0 seconds) ****************
% Proof search statistics:
% ========================
% Length initial path: 9
% Linking steps (succ/fail): 9 / 5
% Eq-linkings (succ/fail): 2 / 0
% Reflexivities (succ/fail): 0 / 0
% E-variants/Order viol.: 0 / 0
% Twin-clause inferences: 0
% Eager eliminations: 0
% Rewrites (subgoal/path): 0 / 0
% GR-closures total/c-foldup: 0 / 0
% Links non-eq/eq: 14 / 10(0)
% Links sweeped vector/all: 0(0) / 0(0)
% Clauses in tableau/pruned: 11 / 10
% Tautology fails: 0
% Renamings/Contractions: 3 / 0
% Variants deleted/subsumed: 0 / 2
% Clauses by splitting: 0
% Variant subsumption tests: 3
% Fails ful/mat/sig/len: 0 / 1 / 0 / 0
% Pre subsumption tests: 40
% Subsumed unit/path/back: 20 / 0 / 0
% Coupled eliminations: 0
% Simplifications/lemmas: 17 / 7 (0)
% Foldups root/context: 0 / 0
% Maximum term depth/compl: 8 / 26
% Relevance vectors: 15
% Unifications/failed: 0 / 0
% Maximum tableau depth: 9
%
%------------------------------------------------------------------------------