TSTP Solution File: RNG010-2 by DCTP---1.31
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : DCTP---1.31
% Problem : RNG010-2 : TPTP v5.0.0. Bugfixed v1.2.1.
% 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 15:41: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 RNG010-2.oldtptp on host art11.cs.miami.edu
% starting preprocessing loop for 24 clauses
% found unit link between input subgoals multiply(multiply(X1,X2),X1) !=> multiply(X1,multiply(X2,X1)) and multiply(multiply(X1,X2),X2) ==> multiply(X1,multiply(X2,X2))
% no conjecture type clause ... restricting relevance to all-negative clauses
% input formula is Horn
% problem statistics for file /tmp/SystemOnTPTP13589/RNG010-2.oldtptp
% Syntax : Number of clauses : 24 ( 0 non-Horn; 22 unit)
% Number of literals : 26 ( 26 equality)
% Maximal clause size : 2
% Number of predicates : 1 ( 0 propositional; 2-2 arity)
% Number of functors : 8 ( 4 constant; 0-3 arity)
% Number of variables : 49 ( 2 singleton)
% Maximal term depth : 5
% complementary unit pair generated by formula preprocessing.
% **************** Exit status is success (PROOF found in 0.0 seconds) ****************
%
%------------------------------------------------------------------------------