%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : SWV240-2 : TPTP v5.0.0. Released v3.2.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 06:35:17 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/SystemOnTPTP12123/SWV/SWV240-2+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 = 18] [nf = 0] [nu = 13] [ut = 12] % Looking for a proof at depth = 2 ... % t = 0 secs [nr = 66] [nf = 1] [nu = 45] [ut = 12] % Looking for a proof at depth = 3 ... % t = 0 secs [nr = 177] [nf = 4] [nu = 114] [ut = 13] % Looking for a proof at depth = 4 ... % t = 0 secs [nr = 419] [nf = 13] [nu = 260] [ut = 14] % Looking for a proof at depth = 5 ... % t = 0 secs [nr = 928] [nf = 36] [nu = 563] [ut = 15] % Looking for a proof at depth = 6 ... % t = 0 secs [nr = 1976] [nf = 89] [nu = 1183] [ut = 16] % Looking for a proof at depth = 7 ... % t = 0 secs [nr = 4107] [nf = 204] [nu = 2440] [ut = 17] % Looking for a proof at depth = 8 ... % t = 0 secs [nr = 8409] [nf = 445] [nu = 4974] [ut = 18] % Looking for a proof at depth = 9 ... % t = 0 secs [nr = 17058] [nf = 940] [nu = 10065] [ut = 19] % Looking for a proof at depth = 10 ... % t = 0 secs [nr = 34406] [nf = 1945] [nu = 20273] [ut = 20] % Looking for a proof at depth = 11 ... % t = 0 secs [nr = 69157] [nf = 3972] [nu = 40718] [ut = 21] % Looking for a proof at depth = 12 ... % t = 0 secs [nr = 138719] [nf = 8045] [nu = 81640] [ut = 21] % Looking for a proof at depth = 13 ... % t = 1 secs [nr = 277908] [nf = 16212] [nu = 163519] [ut = 21] % Looking for a proof at depth = 14 ... % t = 1 secs [nr = 556356] [nf = 32569] [nu = 327315] [ut = 21] % Looking for a proof at depth = 15 ... % t = 3 secs [nr = 1113327] [nf = 65308] [nu = 654948] [ut = 21] % Looking for a proof at depth = 16 ... % t = 6 secs [nr = 2227349] [nf = 130813] [nu = 1310258] [ut = 21] % Looking for a proof at depth = 17 ... % t = 12 secs [nr = 4455478] [nf = 261852] [nu = 2620925] [ut = 21] % Looking for a proof at depth = 18 ... % t = 25 secs [nr = 8911826] [nf = 523961] [nu = 5242309] [ut = 21] % Looking for a proof at depth = 19 ... % t = 49 secs [nr = 17824617] [nf = 1048212] [nu = 10485130] [ut = 21] % Looking for a proof at depth = 20 ... % t = 100 secs [nr = 35650299] [nf = 2096749] [nu = 20970828] [ut = 21] % Looking for a proof at depth = 21 ... % Entering time slice 2 % Updating parameters ... done. % Looking for a proof at depth = 1 ... % t = 122 secs [nr = 43273328] [nf = 2545278] [nu = 25454968] [ut = 21] % Looking for a proof at depth = 2 ... % t = 122 secs [nr = 43273376] [nf = 2545279] [nu = 25455000] [ut = 21] % Looking for a proof at depth = 3 ... % t = 122 secs [nr = 43273487] [nf = 2545282] [nu = 25455069] [ut = 21] % Looking for a proof at depth = 4 ... % t = 122 secs [nr = 43273729] [nf = 2545291] [nu = 25455215] [ut = 21] % Looking for a proof at depth = 5 ... % t = 122 secs [nr = 43274238] [nf = 2545314] [nu = 25455518] [ut = 21] % Looking for a proof at depth = 6 ... % t = 122 secs [nr = 43275286] [nf = 2545367] [nu = 25456138] [ut = 21] % Looking for a proof at depth = 7 ... % t = 122 secs [nr = 43277417] [nf = 2545482] [nu = 25457395] [ut = 21] % Looking for a proof at depth = 8 ... % t = 122 secs [nr = 43281719] [nf = 2545723] [nu = 25459929] [ut = 21] % Looking for a proof at depth = 9 ... % t = 122 secs [nr = 43290368] [nf = 2546218] [nu = 25465020] [ut = 21] % Looking for a proof at depth = 10 ... % t = 122 secs [nr = 43307716] [nf = 2547223] [nu = 25475228] [ut = 21] % Looking for a proof at depth = 11 ... % t = 122 secs [nr = 43342467] [nf = 2549250] [nu = 25495673] [ut = 21] % Looking for a proof at depth = 12 ... % t = 122 secs [nr = 43412029] [nf = 2553323] [nu = 25536595] [ut = 21] % Looking for a proof at depth = 13 ... % t = 123 secs [nr = 43551218] [nf = 2561490] [nu = 25618474] [ut = 21] % Looking for a proof at depth = 14 ... % t = 123 secs [nr = 43829666] [nf = 2577847] [nu = 25782270] [ut = 21] % Looking for a proof at depth = 15 ... % t = 125 secs [nr = 44386637] [nf = 2610586] [nu = 26109903] [ut = 21] % Looking for a proof at depth = 16 ... % t = 128 secs [nr = 45500659] [nf = 2676091] [nu = 26765213] [ % ut = 21] % Looking for a proof at depth = 17 ... % t = 134 secs [nr = 47728788] [nf = 2807130] [nu = 28075880] [ut = 21] % Looking for a proof at depth = 18 ... % t = 147 secs [nr = 52185136] [nf = 3069239] [nu = 30697264] [ut = 21] % Looking for a proof at depth = 19 ... % t = 172 secs [nr = 61097927] [nf = 3593490] [nu = 35940085] [ut = 21] % Looking for a proof at depth = 20 ... % t = 223 secs [nr = 78923609] [nf = 4642027] [nu = 46425783] [ut = 21] % Looking for a proof at depth = 21 ... % TIME IS UP! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 113507083 % resolvents: 107201507 factors: 6305576 % Number of unit clauses generated: 63059847 % % unit clauses generated to total clauses generated: 55.56 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 2 [1] = 10 [3] = 1 % [4] = 1 [5] = 1 [6] = 1 [7] = 1 % [8] = 1 [9] = 1 [10] = 1 [11] = 1 % Total = 21 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 63059847 [2] = 50447236 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] c_in_3 (+)8 (-)2 % [1] c_lessequals_3 (+)10 (-)1 % ------------------ % Total: (+)18 (-)3 % Total number of unit clauses retained: 21 % Number of clauses skipped because of their length: 0 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 113507083 % Number of unification failures: 94587011 % Number of unit to unit unification failures: 26 % N literal unification failure due to lookup root_id table: 201785372 % N base clause resolution failure due to lookup table: 25222946 % N UC-BCL resolution dropped due to lookup table: 0 % Max entries in substitution set: 45 % N unit clauses dropped because they exceeded max values: 31530189 % N unit clauses dropped because too much nesting: 31525154 % 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: 26 % Max term depth in a unit clause: 10 % Number of states in UCFA table: 126 % Total number of terms of all unit clauses in table: 317 % Max allowed number of states in UCFA: 528000 % Ratio n states used/total allowed states: 0.00 % Ratio n states used/total unit clauses terms: 0.40 % Number of symbols (columns) in UCFA: 43 % Profile 2: Number of calls to: % ============================== % PTUnify() = 208094094 % ConstructUnitClause() = 31530208 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 58.39 secs % -------------------------------------------------------- % | | % Inferences per sec: 378357 % | | % -------------------------------------------------------- % Elapsed time: 304 secs % CPU time: 300.00 secs % %------------------------------------------------------------------------------