TSTP Solution File: SYN538-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN538-1 : TPTP v5.0.0. Released v2.1.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art02.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:14:14 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/SystemOnTPTP10611/SYN/SYN538-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 = 2] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 73] [nf = 4] [nu = 0] [ut = 0]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 182] [nf = 18] [nu = 0] [ut = 0]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 427] [nf = 40] [nu = 0] [ut = 0]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 946] [nf = 74] [nu = 0] [ut = 0]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 1893] [nf = 140] [nu = 0] [ut = 0]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 3369] [nf = 255] [nu = 0] [ut = 0]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 5742] [nf = 400] [nu = 0] [ut = 0]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 11352] [nf = 788] [nu = 2] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 19601] [nf = 1698] [nu = 6] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 32487] [nf = 3295] [nu = 10] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 53537] [nf = 5218] [nu = 14] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 89680] [nf = 7899] [nu = 20] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 151098] [nf = 12375] [nu = 28] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 2 secs [nr = 249284] [nf = 19885] [nu = 48] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 3 secs [nr = 393720] [nf = 32286] [nu = 114] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 5 secs [nr = 614569] [nf = 55354] [nu = 288] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 8 secs [nr = 970434] [nf = 94672] [nu = 493] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 13 secs [nr = 1556183] [nf = 153733] [nu = 749] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 21 secs [nr = 2524938] [nf = 236311] [nu = 1060] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 35 secs [nr = 4110393] [nf = 362349] [nu = 1518] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 58 secs [nr = 6592640] [nf = 571058] [nu = 2424] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 95 secs [nr = 10425168] [nf = 925294] [nu = 4454] [ut = 1]
% Looking for a proof at depth = 24 ...
% Entering time slice 2
% Updating parameters ... done.
% Looking for a proof at depth = 1 ...
% t = 123 secs [nr = 13282741] [nf = 1197471] [nu = 5783] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 123 secs [nr = 13282813] [nf = 1197475] [nu = 5783] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 123 secs [nr = 13283011] [nf = 1197496] [nu = 5783] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 123 secs [nr = 13284011] [nf = 1197608] [nu = 5783] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 123 secs [nr = 13288256] [nf = 1198058] [nu = 5783] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 123 secs [nr = 13307349] [nf = 1200641] [nu = 5783] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 123 secs [nr = 13394619] [nf = 1214128] [nu = 5783] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 124 secs [nr = 13844436] [nf = 1293500] [nu = 5783] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 133 secs [nr = 16368757] [nf = 1816487] [nu = 5785] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 185 secs [nr = 31566287] [nf = 5188749] [nu = 5803] [ut = 1]
% Looking for a proof at depth = 11 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 79557592
% resolvents: 66247031 factors: 13310561
% Number of unit clauses generated: 5807
% % unit clauses generated to total clauses generated: 0.01
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [9] = 1
% Total = 1
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 5807 [2] = 2386600 [3] = 13819005 [4] = 9660268 [5] = 21696717 [6] = 19545792
% [7] = 8730001 [8] = 2952070 [9] = 665148 [10] = 93475 [11] = 2709
% Average size of a generated clause: 6.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] ssSkC6 (+)0 (-)0
% [13] ssSkC7 (+)0 (-)0
% [14] c1_1_1 (+)0 (-)0
% [15] c2_1_1 (+)0 (-)0
% [16] c3_1_1 (+)0 (-)0
% [17] c4_1_1 (+)0 (-)0
% [18] c5_1_1 (+)0 (-)0
% [19] ndr1_1_1 (+)0 (-)0
% [20] ssSkP0_1 (+)0 (-)0
% [21] ssSkP1_1 (+)0 (-)0
% [22] ssSkP2_1 (+)0 (-)0
% [23] ssSkP3_1 (+)0 (-)0
% [24] c1_2_2 (+)0 (-)0
% [25] c2_2_2 (+)0 (-)0
% [26] c3_2_2 (+)0 (-)0
% [27] c4_2_2 (+)0 (-)0
% [28] c5_2_2 (+)0 (-)0
% ------------------
% Total: (+)1 (-)0
% Total number of unit clauses retained: 1
% Number of clauses skipped because of their length: 872639569
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 528338469
% Number of successful unifications: 79557592
% Number of unification failures: 1231997
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 570018604
% N base clause resolution failure due to lookup table: 1572134605
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 6
% N unit clauses dropped because they exceeded max values: 2392
% 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: 104
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 80789589
% ConstructUnitClause() = 2393
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 265192
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------