TSTP Solution File: SYN773-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN773-1 : TPTP v5.0.0. Released v2.5.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art03.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:45:07 EST 2010
% Result : Timeout 300.03s
% 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/SystemOnTPTP13202/SYN/SYN773-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 = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 20] [nf = 8] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 96] [nf = 28] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 2668] [nf = 150] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 22904] [nf = 396] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% t = 1 secs [nr = 64360] [nf = 672] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% t = 1 secs [nr = 105816] [nf = 948] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 147272] [nf = 1224] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 188728] [nf = 1500] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 230184] [nf = 1776] [nu = 0] [ut = 2]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 271640] [nf = 2052] [nu = 0] [ut = 2]
% Looking for a proof at depth = 15 ...
% t = 1 secs [nr = 313096] [nf = 2328] [nu = 0] [ut = 2]
% Looking for a proof at depth = 16 ...
% t = 1 secs [nr = 354552] [nf = 2604] [nu = 0] [ut = 2]
% Looking for a proof at depth = 17 ...
% t = 1 secs [nr = 396008] [nf = 2880] [nu = 0] [ut = 2]
% Looking for a proof at depth = 18 ...
% t = 1 secs [nr = 437464] [nf = 3156] [nu = 0] [ut = 2]
% Looking for a proof at depth = 19 ...
% t = 1 secs [nr = 478920] [nf = 3432] [nu = 0] [ut = 2]
% Looking for a proof at depth = 20 ...
% t = 2 secs [nr = 520376] [nf = 3708] [nu = 0] [ut = 2]
% Looking for a proof at depth = 21 ...
% t = 2 secs [nr = 561832] [nf = 3984] [nu = 0] [ut = 2]
% Looking for a proof at depth = 22 ...
% t = 2 secs [nr = 603288] [nf = 4260] [nu = 0] [ut = 2]
% Looking for a proof at depth = 23 ...
% t = 2 secs [nr = 644744] [nf = 4536] [nu = 0] [ut = 2]
% Looking for a proof at depth = 24 ...
% t = 2 secs [nr = 686200] [nf = 4812] [nu = 0] [ut = 2]
% Looking for a proof at depth = 25 ...
% t = 2 secs [nr = 727656] [nf = 5088] [nu = 0] [ut = 2]
% Looking for a proof at depth = 26 ...
% t = 2 secs [nr = 769112] [nf = 5364] [nu = 0] [ut = 2]
% Looking for a proof at depth = 27 ...
% t = 2 secs [nr = 810568] [nf = 5640] [nu = 0] [ut = 2]
% Looking for a proof at depth = 28 ...
% t = 2 secs [nr = 852024] [nf = 5916] [nu = 0] [ut = 2]
% Looking for a proof at depth = 29 ...
% t = 2 secs [nr = 893480] [nf = 6192] [nu = 0] [ut = 2]
% Looking for a proof at depth = 30 ...
% t = 2 secs [nr = 934936] [nf = 6468] [nu = 0] [ut = 2]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 2 secs [nr = 934936] [nf = 6468] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% t = 2 secs [nr = 934936] [nf = 6468] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% t = 2 secs [nr = 934936] [nf = 6468] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% t = 2 secs [nr = 934948] [nf = 6476] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% t = 2 secs [nr = 935010] [nf = 6512] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% t = 2 secs [nr = 935300] [nf = 6976] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% t = 2 secs [nr = 942286] [nf = 8250] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% t = 3 secs [nr = 997458] [nf = 9880] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% t = 3 secs [nr = 1111401] [nf = 11590] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% t = 3 secs [nr = 1226222] [nf = 14524] [nu = 0] [ut = 2]
% Looking for a
% proof at depth = 11 ...
% t = 3 secs [nr = 1402464] [nf = 104222] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% t = 11 secs [nr = 4323984] [nf = 747943] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% t = 103 secs [nr = 42399624] [nf = 2373607] [nu = 0] [ut = 2]
% Looking for a proof at depth = 14 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 127595471
% resolvents: 124450586 factors: 3144885
% 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] = 2
% Total = 2
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [4] = 406453 [5] = 3273025 [6] = 36599055 [7] = 49486174 [8] = 27124733 [9] = 8149256
% [10] = 1985471 [11] = 360369 [12] = 193717 [13] = 16895 [14] = 323
% 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 (+)2 (-)0
% ------------------
% Total: (+)2 (-)0
% Total number of unit clauses retained: 2
% Number of clauses skipped because of their length: 1513449215
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 127595471
% Number of unification failures: 228893278
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 10664644
% N base clause resolution failure due to lookup table: 152677
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 17
% 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: 7
% Total number of terms of all unit clauses in table: 6
% 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.17
% Number of symbols (columns) in UCFA: 45
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 356488749
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 425318
% | |
% --------------------------------------------------------
% Elapsed time: 304 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------