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