TSTP Solution File: SYN098-1.002 by CARINE---0.734

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CARINE---0.734
% Problem  : SYN098-1.002 : TPTP v5.0.0. Bugfixed v1.2.1.
% Transfm  : add_equality
% Format   : carine
% Command  : carine %s t=%d xo=off uct=32000

% Computer : art06.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 Nov 28 08:32:02 EST 2010

% Result   : GaveUp 0.24s
% Output   : None 
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----NO SOLUTION OUTPUT BY SYSTEM
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Command entered:
% /home/graph/tptp/Systems/CARINE---0.734/carine /tmp/SystemOnTPTP26205/SYN/SYN098-1.002+noeq.car t=300 xo=off uct=32000
% CARINE version 0.734 (Dec 2003)
% Initializing tables ... done.
% Parsing .................................................................... done.
% Calculating time slices ... done.
% Building Lookup Tables ... done.
% Looking for a proof at depth = 1 ...
% 	t = 0 secs [nr = 9] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 44] [nf = 12] [nu = 8] [ut = 10]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 151] [nf = 24] [nu = 16] [ut = 10]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 298] [nf = 44] [nu = 24] [ut = 10]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 445] [nf = 64] [nu = 32] [ut = 10]
% Looking for a proof at depth = 6 ...
% 	t = 0 secs [nr = 592] [nf = 84] [nu = 40] [ut = 10]
% Looking for a proof at depth = 7 ...
% 	t = 0 secs [nr = 739] [nf = 104] [nu = 48] [ut = 10]
% Looking for a proof at depth = 8 ...
% 	t = 0 secs [nr = 886] [nf = 124] [nu = 56] [ut = 10]
% Looking for a proof at depth = 9 ...
% 	t = 0 secs [nr = 1033] [nf = 144] [nu = 64] [ut = 10]
% Looking for a proof at depth = 10 ...
% 	t = 0 secs [nr = 1180] [nf = 164] [nu = 72] [ut = 10]
% Looking for a proof at depth = 11 ...
% 	t = 0 secs [nr = 1327] [nf = 184] [nu = 80] [ut = 10]
% Looking for a proof at depth = 12 ...
% 	t = 0 secs [nr = 1474] [nf = 204] [nu = 88] [ut = 10]
% Looking for a proof at depth = 13 ...
% 	t = 0 secs [nr = 1621] [nf = 224] [nu = 96] [ut = 10]
% Looking for a proof at depth = 14 ...
% 	t = 0 secs [nr = 1768] [nf = 244] [nu = 104] [ut = 10]
% Looking for a proof at depth = 15 ...
% 	t = 0 secs [nr = 1915] [nf = 264] [nu = 112] [ut = 10]
% Looking for a proof at depth = 16 ...
% 	t = 0 secs [nr = 2062] [nf = 284] [nu = 120] [ut = 10]
% Looking for a proof at depth = 17 ...
% 	t = 0 secs [nr = 2209] [nf = 304] [nu = 128] [ut = 10]
% Looking for a proof at depth = 18 ...
% 	t = 0 secs [nr = 2356] [nf = 324] [nu = 136] [ut = 10]
% Looking for a proof at depth = 19 ...
% 	t = 0 secs [nr = 2503] [nf = 344] [nu = 144] [ut = 10]
% Looking for a proof at depth = 20 ...
% 	t = 0 secs [nr = 2650] [nf = 364] [nu = 152] [ut = 10]
% Looking for a proof at depth = 21 ...
% 	t = 0 secs [nr = 2797] [nf = 384] [nu = 160] [ut = 10]
% Looking for a proof at depth = 22 ...
% 	t = 0 secs [nr = 2944] [nf = 404] [nu = 168] [ut = 10]
% Looking for a proof at depth = 23 ...
% 	t = 0 secs [nr = 3091] [nf = 424] [nu = 176] [ut = 10]
% Looking for a proof at depth = 24 ...
% 	t = 0 secs [nr = 3238] [nf = 444] [nu = 184] [ut = 10]
% Looking for a proof at depth = 25 ...
% 	t = 0 secs [nr = 3385] [nf = 464] [nu = 192] [ut = 10]
% Looking for a proof at depth = 26 ...
% 	t = 0 secs [nr = 3532] [nf = 484] [nu = 200] [ut = 10]
% Looking for a proof at depth = 27 ...
% 	t = 0 secs [nr = 3679] [nf = 504] [nu = 208] [ut = 10]
% Looking for a proof at depth = 28 ...
% 	t = 0 secs [nr = 3826] [nf = 524] [nu = 216] [ut = 10]
% Looking for a proof at depth = 29 ...
% 	t = 0 secs [nr = 3973] [nf = 544] [nu = 224] [ut = 10]
% Looking for a proof at depth = 30 ...
% 	t = 0 secs [nr = 4120] [nf = 564] [nu = 232] [ut = 10]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% 	t = 0 secs [nr = 4129] [nf = 564] [nu = 232] [ut = 10]
% Looking for a proof at depth = 2 ...
% 	t = 0 secs [nr = 4164] [nf = 576] [nu = 240] [ut = 10]
% Looking for a proof at depth = 3 ...
% 	t = 0 secs [nr = 4271] [nf = 588] [nu = 248] [ut = 10]
% Looking for a proof at depth = 4 ...
% 	t = 0 secs [nr = 4418] [nf = 608] [nu = 256] [ut = 10]
% Looking for a proof at depth = 5 ...
% 	t = 0 secs [nr = 4565] [nf = 628] [nu = 264] [ut = 10]
% Looking for a proof at depth = 6 ...
% 	t = 0 secs [nr = 4712] [nf = 648] [nu = 272] [ut = 10]
% Looking for a proof at depth = 7 ...
% 	t = 0 secs [nr = 4859] [nf = 668] [nu = 280] [ut = 10]
% Looking for a proof at depth = 8 ...
% 	t = 0 secs [nr = 5006] [nf = 688] [nu = 288] [ut = 10]
% Looking for a proof at depth = 9 ...
% 	t = 0 secs [nr = 5153] [nf = 708] [nu = 296] [ut = 10]
% Looking for a proof at depth = 10 ...
% 	t = 0 secs [nr = 5300] [nf = 728] [nu = 304] [ut = 10]
% Looking for a proof at depth = 11 ...
% 	t = 0 secs [nr = 5447] [nf = 748] [nu = 312] [ut = 10]
% Looking for a proof at depth = 12 ...
% 	t = 0 secs [nr = 5594] [nf = 768] [nu = 320] [ut = 10]
% Looking for a proof at depth = 13 ...
% 	t = 0 secs [nr = 5741] [nf = 788] [nu = 328] [ut = 10]
% Looking for a proof at depth = 14 ...
% 	t = 0 secs [nr = 5888] [nf = 808] [nu = 336] [ut = 10]
% Looking for a proof at depth = 15 ...
% 	t = 0 secs [nr = 6035] [nf = 828] [nu = 344] [ut = 10]
% Looking for a proof at depth = 16 ...
% 	t = 0 secs [nr = 6182] [nf = 848] [nu = 352] [ut = 10]
% Looking for a proof at depth = 17 ...
% 	t = 0 secs [nr = 6329] [nf = 868] [nu = 360] [ut = 10]
% Looking for a proof at depth = 18 ...
% 	t = 0 secs [nr = 6476] [nf = 888] [nu = 368] [ut = 10]
% Looking for a proof at depth = 19 ...
% 	t = 0 secs [nr = 6623] [nf = 908] [nu = 376] [ut = 10]
% Looking for a proof at depth = 20 ...
% 	t = 0 secs [nr = 6770] [nf = 928] [nu = 384] [ut = 10]
% Looking for a proof at depth = 21 ...
% 	t = 0 secs [nr = 6917] [nf = 948] [nu = 392] [ut = 10]
% Looking for a proof at depth = 22 ...
% 	t = 0 secs [nr = 7064] [nf = 968] [nu = 400] [ut = 10]
% Looking for a proof at depth = 23 ...
% 	t = 0 secs [nr = 7211] [nf = 988] [nu = 408] [ut = 10]
% Looking for a proof at depth = 24 ...
% 	t = 0 secs [nr = 7358] [nf = 1008] [nu = 416] [ut = 10]
% Looking for a proof at depth = 25 ...
% 	t = 0 secs [nr = 7505] [nf = 1028] [nu = 424] [ut = 10]
% Looking for a proof at depth = 26 ...
% 	t = 0 secs [nr = 7652] [nf = 1048] [nu = 432] [ut = 10]
% Looking for a proof at depth = 27 ...
% 	t = 0 secs [nr = 7799] [nf = 1068] [nu = 440] [ut = 10]
% Looking for a proof at depth = 28 ...
% 	t = 0 secs [nr = 7946] [nf = 1088] [nu = 448] [ut = 10]
% Looking for a proof at depth = 29 ...
% 	t = 0 secs [nr = 8093] [nf = 1108] [nu = 456] [ut = 10]
% Looking for a proof at depth = 30 ...
% 	t = 0 secs [nr = 8240] [nf = 1128] [nu = 464] [ut = 10]
% GIVE UP!
% ---------------------------------------------
% |                Statistics                 |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 9368
% 	resolvents: 8240	factors: 1128
% Number of unit clauses generated: 464
% % unit clauses generated to total clauses generated: 4.95
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 2		[2] = 8		
% Total = 10
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 464	[2] = 4656	[3] = 4248	
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] p_0		(+)0	(-)0
% [1] p_1		(+)0	(-)0
% [2] p_2		(+)1	(-)0
% [3] p_3		(+)1	(-)0
% [4] p_4		(+)0	(-)0
% [5] q_0		(+)0	(-)0
% [6] q_1		(+)0	(-)0
% [7] q_2		(+)1	(-)0
% [8] q_3		(+)1	(-)0
% [9] q_4		(+)0	(-)0
% [10] sym_p_0		(+)0	(-)0
% [11] sym_p_1		(+)0	(-)0
% [12] sym_p_2		(+)0	(-)1
% [13] sym_p_3		(+)0	(-)1
% [14] sym_p_4		(+)0	(-)0
% [15] sym_q_0		(+)0	(-)0
% [16] sym_q_1		(+)0	(-)0
% [17] sym_q_2		(+)0	(-)1
% [18] sym_q_3		(+)0	(-)1
% [19] sym_q_4		(+)0	(-)0
% [20] sym_u_1		(+)1	(-)0
% [21] sym_u_10		(+)0	(-)0
% [22] sym_u_11		(+)0	(-)0
% [23] sym_u_12		(+)0	(-)0
% [24] sym_u_13		(+)0	(-)0
% [25] sym_u_14		(+)0	(-)0
% [26] sym_u_15		(+)0	(-)0
% [27] sym_u_16		(+)0	(-)0
% [28] sym_u_17		(+)0	(-)0
% [29] sym_u_2		(+)0	(-)0
% [30] sym_u_3		(+)0	(-)0
% [31] sym_u_4		(+)0	(-)0
% [32] sym_u_5		(+)0	(-)0
% [33] sym_u_6		(+)0	(-)0
% [34] sym_u_7		(+)0	(-)0
% [35] sym_u_8		(+)0	(-)0
% [36] sym_u_9		(+)0	(-)0
% [37] u_1		(+)0	(-)1
% [38] u_10		(+)0	(-)0
% [39] u_11		(+)0	(-)0
% [40] u_12		(+)0	(-)0
% [41] u_13		(+)0	(-)0
% [42] u_14		(+)0	(-)0
% [43] u_15		(+)0	(-)0
% [44] u_16		(+)0	(-)0
% [45] u_17		(+)0	(-)0
% [46] u_2		(+)0	(-)0
% [47] u_3		(+)0	(-)0
% [48] u_4		(+)0	(-)0
% [49] u_5		(+)0	(-)0
% [50] u_6		(+)0	(-)0
% [51] u_7		(+)0	(-)0
% [52] u_8		(+)0	(-)0
% [53] u_9		(+)0	(-)0
% 			------------------
% 		Total:	(+)5	(-)5
% Total number of unit clauses retained: 10
% Number of clauses skipped because of their length: 1452
% N base clauses skippped in resolve-with-all-base-clauses
% 	because of the shortest resolvents table: 1680
% Number of successful unifications: 9368
% Number of unification failures: 0
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 61792
% N base clause resolution failure due to lookup table: 658396
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 0
% N unit clauses dropped because they exceeded max values: 8
% N unit clauses dropped because too much nesting: 0
% N unit clauses not constrcuted because table was full: 0
% N unit clauses dropped because UCFA table was full: 0
% Max number of terms in a unit clause: 0
% Max term depth in a unit clause: 0
% Number of states in UCFA table: 3
% Total number of terms of all unit clauses in table: 0
% Max allowed number of states in UCFA: 80000
% Ratio n states used/total allowed states: 0.00
% Ratio n states used/total unit clauses terms: inf
% Number of symbols (columns) in UCFA: 88
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 9368
% ConstructUnitClause() = 16
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% |                                                      |
%   Inferences per sec: inf
% |                                                      |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.24 secs
% 
%------------------------------------------------------------------------------