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