TSTP Solution File: SYN516-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN516-1 : TPTP v5.0.0. Released v2.1.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art01.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 10:01:25 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/SystemOnTPTP22812/SYN/SYN516-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 = 0]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 88] [nf = 4] [nu = 0] [ut = 0]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 176] [nf = 8] [nu = 0] [ut = 0]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 287] [nf = 15] [nu = 0] [ut = 0]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 404] [nf = 22] [nu = 0] [ut = 0]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 586] [nf = 51] [nu = 2] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 775] [nf = 82] [nu = 4] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 964] [nf = 113] [nu = 6] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 1153] [nf = 144] [nu = 8] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 1342] [nf = 175] [nu = 10] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 1531] [nf = 206] [nu = 12] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 1720] [nf = 237] [nu = 14] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 1909] [nf = 268] [nu = 16] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 2098] [nf = 299] [nu = 18] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 2287] [nf = 330] [nu = 20] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 2476] [nf = 361] [nu = 22] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 2665] [nf = 392] [nu = 24] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 2854] [nf = 423] [nu = 26] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 3043] [nf = 454] [nu = 28] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 3232] [nf = 485] [nu = 30] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 3421] [nf = 516] [nu = 32] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 3610] [nf = 547] [nu = 34] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 3799] [nf = 578] [nu = 36] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 3988] [nf = 609] [nu = 38] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 4177] [nf = 640] [nu = 40] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 4366] [nf = 671] [nu = 42] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 4555] [nf = 702] [nu = 44] [ut = 1]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 4744] [nf = 733] [nu = 46] [ut = 1]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 4933] [nf = 764] [nu = 48] [ut = 1]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 5122] [nf = 795] [nu = 50] [ut = 1]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 5122] [nf = 795] [nu = 50] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 5210] [nf = 799] [nu = 50] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 5415] [nf = 806] [nu = 50] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 6333] [nf = 892] [nu = 50] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 8738] [nf = 1441] [nu = 50] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 14207] [nf = 2182] [nu = 54] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 28355] [nf = 3492] [nu = 58] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 81195] [nf = 9208] [nu = 62] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 213166] [nf = 26614] [nu = 66] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 2 secs [nr = 564251] [nf = 67379] [nu = 70] [ut = 1]
% Looking for
% a proof at depth = 11 ...
% t = 5 secs [nr = 1584930] [nf = 260811] [nu = 74] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 11 secs [nr = 3070079] [nf = 642074] [nu = 78] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 25 secs [nr = 6657712] [nf = 1629067] [nu = 82] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 62 secs [nr = 15476411] [nf = 5451260] [nu = 86] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 139 secs [nr = 26953044] [nf = 10322750] [nu = 90] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 279 secs [nr = 43673313] [nf = 17083625] [nu = 94] [ut = 1]
% Looking for a proof at depth = 17 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 66333162
% resolvents: 47720182 factors: 18612980
% Number of unit clauses generated: 96
% % unit clauses generated to total clauses generated: 0.00
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [6] = 1
% Total = 1
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 96 [2] = 2098 [3] = 20848 [4] = 310766 [5] = 5090640 [6] = 24606385
% [7] = 36302329
% Average size of a generated clause: 7.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] c1_0 (+)0 (-)0
% [1] c2_0 (+)0 (-)0
% [2] c3_0 (+)0 (-)0
% [3] c4_0 (+)0 (-)0
% [4] c5_0 (+)0 (-)0
% [5] ndr1_0 (+)1 (-)0
% [6] ssSkC0 (+)0 (-)0
% [7] ssSkC1 (+)0 (-)0
% [8] ssSkC2 (+)0 (-)0
% [9] ssSkC3 (+)0 (-)0
% [10] ssSkC4 (+)0 (-)0
% [11] ssSkC5 (+)0 (-)0
% [12] c1_1_1 (+)0 (-)0
% [13] c2_1_1 (+)0 (-)0
% [14] c3_1_1 (+)0 (-)0
% [15] c4_1_1 (+)0 (-)0
% [16] c5_1_1 (+)0 (-)0
% [17] ndr1_1_1 (+)0 (-)0
% [18] c1_2_2 (+)0 (-)0
% [19] c2_2_2 (+)0 (-)0
% [20] c3_2_2 (+)0 (-)0
% [21] c4_2_2 (+)0 (-)0
% [22] c5_2_2 (+)0 (-)0
% ------------------
% Total: (+)1 (-)0
% Total number of unit clauses retained: 1
% Number of clauses skipped because of their length: 321244286
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 494835721
% Number of successful unifications: 66333162
% Number of unification failures: 1225938
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 2268128017
% N base clause resolution failure due to lookup table: 2056912368
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 3
% N unit clauses dropped because they exceeded max values: 5
% 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: 2
% 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: 80
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 67559100
% ConstructUnitClause() = 6
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 221111
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------