%------------------------------------------------------------------------------ % File : DCTP---1.31 % Problem : LAT039-1 : TPTP v5.0.0. Released v2.4.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 04:19:50 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 LAT039-1.oldtptp on host art11.cs.miami.edu % starting preprocessing loop for 12 clauses % starting preprocessing loop for 12 clauses % no conjecture type clause ... restricting relevance to all-negative clauses % input formula is Horn % input formula is in unit equality class % problem statistics for file /tmp/SystemOnTPTP8104/LAT039-1.oldtptp % Syntax : Number of clauses : 12 ( 0 non-Horn; 12 unit) % Number of literals : 12 ( 12 equality) % Maximal clause size : 1 % Number of predicates : 1 ( 0 propositional; 2-2 arity) % Number of functors : 5 ( 3 constant; 0-2 arity) % Number of variables : 22 ( 2 singleton) % Maximal term depth : 3 % Starting proof % **************** Exit status is success (PROOF found in 0.06 seconds) **************** % Proof search statistics: % ======================== % Length initial path: 12 % Linking steps (succ/fail): 0 / 0 % Eq-linkings (succ/fail): 320 / 26 % Reflexivities (succ/fail): 0 / 0 % E-variants/Order viol.: 4 / 0 % Twin-clause inferences: 0 % Eager eliminations: 0 % Rewrites (subgoal/path): 445 / 1 % GR-closures total/c-foldup: 0 / 0 % Links non-eq/eq: 0 / 1701(1) % Links sweeped vector/all: 0(0) / 0(0) % Clauses in tableau/pruned: 320 / 319 % Tautology fails: 0 % Renamings/Contractions: 816 / 0 % Variants deleted/subsumed: 8 / 0 % Clauses by splitting: 0 % Variant subsumption tests: 0 % Fails ful/mat/sig/len: 0 / 0 / 0 / 0 % Pre subsumption tests: 0 % Subsumed unit/path/back: 423 / 0 / 0 % Coupled eliminations: 0 % Simplifications/lemmas: 321 / 49 (0) % Foldups root/context: 0 / 0 % Maximum term depth/compl: 6 / 20 % Relevance vectors: 332 % Unifications/failed: 0 / 0 % Maximum tableau depth: 318 % Killed 1 orphans % %------------------------------------------------------------------------------