TSTP Solution File: GRP123-9.003 by DCTP---1.31
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : DCTP---1.31
% Problem : GRP123-9.003 : 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 : Fri Dec 3 23:33:47 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 GRP123-9.003.oldtptp on host art11.cs.miami.edu
% starting preprocessing loop for 22 clauses
% starting preprocessing loop for 20 clauses
% no conjecture type clause ... restricting relevance to all-negative clauses
% input formula is in Bernays-Schönfinkel class
% problem statistics for file /tmp/SystemOnTPTP27030/GRP123-9.003.oldtptp
% Syntax : Number of clauses : 20 ( 2 non-Horn; 11 unit)
% Number of literals : 42 ( 0 equality)
% Maximal clause size : 5
% Number of predicates : 4 ( 0 propositional; 1-3 arity)
% Number of functors : 3 ( 3 constant; 0-0 arity)
% Number of variables : 34 ( 0 singleton)
% Maximal term depth : 1
% Starting proof
% **************** Exit status is success (PROOF found in 0.0 seconds) ****************
% Proof search statistics:
% ========================
% Length initial path: 20
% Linking steps (succ/fail): 57 / 16
% Twin-clause inferences: 0
% Eager eliminations: 0
% Rewrites (subgoal/path): 0 / 0
% GR-closures total/c-foldup: 1 / 0
% Links generated/deleted: 169 / 125
% Links sweeped vector/all: 0(0) / 0(0)
% Clauses in tableau/pruned: 57 / 55
% Regularity/Tautology fails: 0 / 0 (0)
% Renamings/Contractions: 0 / 0
% Variants deleted/subsumed: 0 / 13
% Clauses by splitting: 0
% Variant subsumption tests: 38
% Fails ful/mat/sig/len: 0 / 11 / 14 / 0
% Pre subsumption tests: 346
% Subsumed unit/path/back: 80 / 0 / 15
% Coupled eliminations: 0
% Simplifications/lemmas: 73 / 21 (0)
% Foldups root/context: 15 / 0
% Maximum term depth/compl: 1 / 3
% Relevance vectors: 84
% Unifications/failed: 0 / 0
% Maximum tableau depth: 39
%
%------------------------------------------------------------------------------