TSTP Solution File: SYN751-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN751-1 : TPTP v5.0.0. Released v2.5.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art04.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 11:35:58 EST 2010
% Result : Timeout 300.02s
% 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/SystemOnTPTP19545/SYN/SYN751-1+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 = 0] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 14] [nf = 12] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 195] [nf = 82] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 1920] [nf = 316] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 8750] [nf = 692] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 1 secs [nr = 48272] [nf = 1252] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 1 secs [nr = 87794] [nf = 1812] [nu = 0] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 127316] [nf = 2372] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 166838] [nf = 2932] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 206360] [nf = 3492] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 245882] [nf = 4052] [nu = 0] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 1 secs [nr = 285404] [nf = 4612] [nu = 0] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 1 secs [nr = 324926] [nf = 5172] [nu = 0] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 1 secs [nr = 364448] [nf = 5732] [nu = 0] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 1 secs [nr = 403970] [nf = 6292] [nu = 0] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 1 secs [nr = 443492] [nf = 6852] [nu = 0] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 1 secs [nr = 483014] [nf = 7412] [nu = 0] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 2 secs [nr = 522536] [nf = 7972] [nu = 0] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 2 secs [nr = 562058] [nf = 8532] [nu = 0] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 2 secs [nr = 601580] [nf = 9092] [nu = 0] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 2 secs [nr = 641102] [nf = 9652] [nu = 0] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 2 secs [nr = 680624] [nf = 10212] [nu = 0] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 2 secs [nr = 720146] [nf = 10772] [nu = 0] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 2 secs [nr = 759668] [nf = 11332] [nu = 0] [ut = 1]
% Looking for a proof at depth = 28 ...
% t = 2 secs [nr = 799190] [nf = 11892] [nu = 0] [ut = 1]
% Looking for a proof at depth = 29 ...
% t = 2 secs [nr = 838712] [nf = 12452] [nu = 0] [ut = 1]
% Looking for a proof at depth = 30 ...
% t = 2 secs [nr = 878234] [nf = 13012] [nu = 0] [ut = 1]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 2 secs [nr = 878234] [nf = 13012] [nu = 0] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 2 secs [nr = 878234] [nf = 13012] [nu = 0] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 2 secs [nr = 878234] [nf = 13012] [nu = 0] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 2 secs [nr = 878244] [nf = 13016] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 2 secs [nr = 878305] [nf = 13080] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 2 secs [nr = 878731] [nf = 13492] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 2 secs [nr = 882304] [nf = 14442] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 2 secs [nr = 896778] [nf = 16206] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 2 secs [nr = 981908] [nf = 18668] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 3 secs [nr = 1068844] [nf = 25932]
% [nu = 0] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 3 secs [nr = 1173028] [nf = 61608] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 3 secs [nr = 1368264] [nf = 193240] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 6 secs [nr = 1890044] [nf = 910232] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 12 secs [nr = 3789304] [nf = 1627224] [nu = 0] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 19 secs [nr = 5693436] [nf = 2358976] [nu = 0] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 25 secs [nr = 7641896] [nf = 3188192] [nu = 0] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 32 secs [nr = 9681364] [nf = 4115904] [nu = 0] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 47 secs [nr = 13280640] [nf = 8975968] [nu = 0] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 75 secs [nr = 19237484] [nf = 13836032] [nu = 0] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 103 secs [nr = 25194328] [nf = 18696096] [nu = 0] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 131 secs [nr = 31151172] [nf = 23556160] [nu = 0] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 159 secs [nr = 37108016] [nf = 28416224] [nu = 0] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 187 secs [nr = 43064860] [nf = 33276288] [nu = 0] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 215 secs [nr = 49021704] [nf = 38136352] [nu = 0] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 243 secs [nr = 54978548] [nf = 42996416] [nu = 0] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 271 secs [nr = 60935392] [nf = 47856480] [nu = 0] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 299 secs [nr = 66892236] [nf = 52716544] [nu = 0] [ut = 1]
% Looking for a proof at depth = 28 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 121417209
% resolvents: 67920706 factors: 53496503
% Number of unit clauses generated: 0
% % unit clauses generated to total clauses generated: 0.00
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 1
% Total = 1
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [4] = 771042 [5] = 4117373 [6] = 13643277 [7] = 30702668 [8] = 53501311 [9] = 18681538
% Average size of a generated clause: 8.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] ssPv1_1 (+)0 (-)0
% [1] ssPv2_1 (+)0 (-)0
% [2] ssPv3_1 (+)0 (-)0
% [3] ssPv4_1 (+)0 (-)0
% [4] ssPv5_1 (+)0 (-)0
% [5] ssPv6_1 (+)0 (-)0
% [6] ssPv7_1 (+)0 (-)0
% [7] ssPv8_1 (+)0 (-)0
% [8] ssRr_2 (+)1 (-)0
% ------------------
% Total: (+)1 (-)0
% Total number of unit clauses retained: 1
% Number of clauses skipped because of their length: 9946104
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 121417209
% Number of unification failures: 74828401
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 257141025
% N base clause resolution failure due to lookup table: 8148121
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 22
% N unit clauses dropped because they exceeded max values: 0
% 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: 3
% Max term depth in a unit clause: 2
% Number of states in UCFA table: 5
% Total number of terms of all unit clauses in table: 3
% 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: 1.67
% Number of symbols (columns) in UCFA: 44
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 196245610
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 404724
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------