%------------------------------------------------------------------------------ % File : DCTP---1.31 % Problem : LAT039-2 : 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: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 LAT039-2.oldtptp on host art11.cs.miami.edu % starting preprocessing loop for 12 clauses % no all negative clause in formula % no conjecture type clause ... restricting relevance to all-negative clauses % input formula is Horn % problem statistics for file /tmp/SystemOnTPTP8273/LAT039-2.oldtptp % Syntax : Number of clauses : 12 ( 0 non-Horn; 11 unit) % Number of literals : 12 ( 11 equality) % Maximal clause size : 1 % Number of predicates : 2 ( 1 propositional; 0-2 arity) % Number of functors : 4 ( 2 constant; 0-2 arity) % Number of variables : 22 ( 2 singleton) % Maximal term depth : 3 % complementary unit pair generated by formula preprocessing. % **************** Exit status is success (PROOF found in 0.0 seconds) **************** % %------------------------------------------------------------------------------