TSTP Solution File: SYN836-1 by DCTP---1.31
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : DCTP---1.31
% Problem : SYN836-1 : TPTP v5.0.0. Released v2.5.0.
% Transfm : none
% Format : oldtptp
% Command : dctp-wrapper -negpref -complexity -fullrewrite -alternate -resisol %s
% Computer : art09.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 10:48:04 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 SYN836-1.oldtptp on host art09.cs.miami.edu
% starting preprocessing loop for 536 clauses
% starting preprocessing loop for 387 clauses
% starting preprocessing loop for 146 clauses
% starting preprocessing loop for 121 clauses
% starting preprocessing loop for 98 clauses
% starting preprocessing loop for 91 clauses
% starting preprocessing loop for 87 clauses
% starting preprocessing loop for 84 clauses
% starting preprocessing loop for 82 clauses
% starting preprocessing loop for 81 clauses
% starting preprocessing loop for 80 clauses
% starting preprocessing loop for 78 clauses
% starting preprocessing loop for 77 clauses
% starting preprocessing loop for 67 clauses
% starting preprocessing loop for 58 clauses
% starting preprocessing loop for 53 clauses
% starting preprocessing loop for 50 clauses
% starting preprocessing loop for 48 clauses
% starting preprocessing loop for 47 clauses
% starting preprocessing loop for 40 clauses
% starting preprocessing loop for 38 clauses
% starting preprocessing loop for 37 clauses
% no conjecture type clause ... restricting relevance to all-negative clauses
% input formula is in Bernays-Schönfinkel class
% problem statistics for file /tmp/SystemOnTPTP19391/SYN836-1.oldtptp
% Syntax : Number of clauses : 37 ( 9 non-Horn; 8 unit)
% Number of literals : 91 ( 0 equality)
% Maximal clause size : 6
% Number of predicates : 16 ( 0 propositional; 1-16 arity)
% Number of functors : 12 ( 12 constant; 0-0 arity)
% Number of variables : 461 ( 238 singleton)
% Maximal term depth : 1
% Starting proof
% **************** Exit status is success (PROOF found in 1.57 seconds) ****************
% Proof search statistics:
% ========================
% Length initial path: 37
% Linking steps (succ/fail): 78 / 38
% Twin-clause inferences: 5
% Eager eliminations: 0
% Rewrites (subgoal/path): 0 / 0
% GR-closures total/c-foldup: 42 / 0
% Links generated/deleted: 132 / 99
% Links sweeped vector/all: 0(0) / 0(0)
% Clauses in tableau/pruned: 83 / 75
% Regularity/Tautology fails: 0 / 184 (0)
% Renamings/Contractions: 16 / 2812
% Variants deleted/subsumed: 32 / 15
% Clauses by splitting: 0
% Variant subsumption tests: 39
% Fails ful/mat/sig/len: 0 / 5 / 16 / 3
% Pre subsumption tests: 316968
% Subsumed unit/path/back: 265 / 0 / 6
% Coupled eliminations: 5
% Simplifications/lemmas: 50 / 22 (0)
% Foldups root/context: 3 / 7
% Maximum term depth/compl: 1 / 16
% Relevance vectors: 143
% Unifications/failed: 0 / 0
% Maximum tableau depth: 37
% Killed 1 orphans
%
%------------------------------------------------------------------------------