TSTP Solution File: SYN542-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN542-1 : TPTP v5.0.0. Released v2.1.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Nov 28 10:16:58 EST 2010
% Result : Timeout 300.01s
% 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/SystemOnTPTP30129/SYN/SYN542-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 = 0]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 72] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 144] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 4 ...
% t = 1 secs [nr = 936] [nf = 36] [nu = 0] [ut = 0]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 4050] [nf = 396] [nu = 36] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 7164] [nf = 756] [nu = 72] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 10335] [nf = 1150] [nu = 108] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 13506] [nf = 1544] [nu = 144] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 1 secs [nr = 16714] [nf = 1968] [nu = 180] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 1 secs [nr = 19922] [nf = 2392] [nu = 216] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 23130] [nf = 2816] [nu = 252] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 2 secs [nr = 26338] [nf = 3240] [nu = 288] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 2 secs [nr = 29546] [nf = 3664] [nu = 324] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 2 secs [nr = 32754] [nf = 4088] [nu = 360] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 2 secs [nr = 35962] [nf = 4512] [nu = 396] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 2 secs [nr = 39170] [nf = 4936] [nu = 432] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 2 secs [nr = 42378] [nf = 5360] [nu = 468] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 2 secs [nr = 45586] [nf = 5784] [nu = 504] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 2 secs [nr = 48794] [nf = 6208] [nu = 540] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 2 secs [nr = 52002] [nf = 6632] [nu = 576] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 2 secs [nr = 55210] [nf = 7056] [nu = 612] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 2 secs [nr = 58418] [nf = 7480] [nu = 648] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 2 secs [nr = 61626] [nf = 7904] [nu = 684] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 3 secs [nr = 64834] [nf = 8328] [nu = 720] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 3 secs [nr = 68042] [nf = 8752] [nu = 756] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 3 secs [nr = 71250] [nf = 9176] [nu = 792] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 3 secs [nr = 74458] [nf = 9600] [nu = 828] [ut = 1]
% Looking for a proof at depth = 28 ...
% t = 3 secs [nr = 77666] [nf = 10024] [nu = 864] [ut = 1]
% Looking for a proof at depth = 29 ...
% t = 3 secs [nr = 80874] [nf = 10448] [nu = 900] [ut = 1]
% Looking for a proof at depth = 30 ...
% t = 3 secs [nr = 84082] [nf = 10872] [nu = 936] [ut = 1]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 3 secs [nr = 84082] [nf = 10872] [nu = 936] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 3 secs [nr = 84154] [nf = 10872] [nu = 936] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 3 secs [nr = 84226] [nf = 10872] [nu = 936] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 3 secs [nr = 85018] [nf = 10908] [nu = 936] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 3 secs [nr = 90163] [nf = 11292] [nu = 972] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 4 secs [nr = 203210] [nf = 14921] [nu = 1008] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 9 secs [nr = 1302221]
% [nf = 63938] [nu = 1044] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 41 secs [nr = 4855622] [nf = 275731] [nu = 1080] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 173 secs [nr = 17170574] [nf = 1125341] [nu = 1116] [ut = 1]
% Looking for a proof at depth = 10 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 28848203
% resolvents: 26860984 factors: 1987219
% Number of unit clauses generated: 1118
% % unit clauses generated to total clauses generated: 0.00
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [5] = 1
% Total = 1
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 1118 [2] = 15068 [3] = 103925 [4] = 278680 [5] = 2994046 [6] = 13657084
% [7] = 5369664 [8] = 6408010 [9] = 20608
% Average size of a generated clause: 7.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] hskp0 (+)0 (-)0
% [1] hskp1 (+)0 (-)0
% [2] hskp10 (+)0 (-)0
% [3] hskp11 (+)0 (-)0
% [4] hskp12 (+)0 (-)0
% [5] hskp13 (+)0 (-)0
% [6] hskp14 (+)0 (-)0
% [7] hskp15 (+)0 (-)0
% [8] hskp16 (+)0 (-)0
% [9] hskp17 (+)0 (-)0
% [10] hskp18 (+)0 (-)0
% [11] hskp19 (+)0 (-)0
% [12] hskp2 (+)0 (-)0
% [13] hskp20 (+)0 (-)0
% [14] hskp21 (+)0 (-)0
% [15] hskp22 (+)0 (-)0
% [16] hskp23 (+)0 (-)0
% [17] hskp24 (+)0 (-)0
% [18] hskp25 (+)0 (-)0
% [19] hskp26 (+)0 (-)0
% [20] hskp27 (+)0 (-)0
% [21] hskp28 (+)0 (-)0
% [22] hskp29 (+)0 (-)0
% [23] hskp3 (+)0 (-)0
% [24] hskp30 (+)0 (-)0
% [25] hskp31 (+)0 (-)0
% [26] hskp32 (+)0 (-)0
% [27] hskp33 (+)0 (-)0
% [28] hskp34 (+)0 (-)0
% [29] hskp35 (+)0 (-)0
% [30] hskp36 (+)0 (-)0
% [31] hskp37 (+)0 (-)0
% [32] hskp38 (+)0 (-)0
% [33] hskp39 (+)0 (-)0
% [34] hskp4 (+)0 (-)0
% [35] hskp40 (+)0 (-)0
% [36] hskp41 (+)0 (-)0
% [37] hskp42 (+)0 (-)0
% [38] hskp43 (+)0 (-)0
% [39] hskp44 (+)0 (-)0
% [40] hskp45 (+)0 (-)0
% [41] hskp46 (+)0 (-)0
% [42] hskp47 (+)0 (-)0
% [43] hskp48 (+)0 (-)0
% [44] hskp49 (+)0 (-)0
% [45] hskp5 (+)0 (-)0
% [46] hskp50 (+)0 (-)0
% [47] hskp51 (+)0 (-)0
% [48] hskp52 (+)0 (-)0
% [49] hskp53 (+)0 (-)0
% [50] hskp54 (+)0 (-)0
% [51] hskp55 (+)0 (-)0
% [52] hskp56 (+)0 (-)0
% [53] hskp57 (+)0 (-)0
% [54] hskp58 (+)0 (-)0
% [55] hskp6 (+)0 (-)0
% [56] hskp7 (+)0 (-)0
% [57] hskp8 (+)0 (-)0
% [58] hskp9 (+)0 (-)0
% [59] ndr1_0 (+)1 (-)0
% [60] c0_1_1 (+)0 (-)0
% [61] c1_1_1 (+)0 (-)0
% [62] c2_1_1 (+)0 (-)0
% [63] c3_1_1 (+)0 (-)0
% [64] c4_1_1 (+)0 (-)0
% [65] c5_1_1 (+)0 (-)0
% ------------------
% Total: (+)1 (-)0
% Total number of unit clauses retained: 1
% Number of clauses skipped because of their length: 101449626
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 3046167223
% Number of successful unifications: 28848203
% Number of unification failures: 63261053
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 1930361178
% N base clause resolution failure due to lookup table: 2512858351
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 2
% N unit clauses dropped because they exceeded max values: 71
% 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: 159
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 92109256
% ConstructUnitClause() = 72
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 96161
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------