%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : SWV288-2 : TPTP v5.0.0. Released v3.2.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art04.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 06:49:53 EST 2010 % Result : GaveUp 30.32s % 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/SystemOnTPTP18724/SWV/SWV288-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 = 1 secs [nr = 10] [nf = 0] [nu = 6] [ut = 9] % Looking for a proof at depth = 2 ... % t = 1 secs [nr = 37] [nf = 0] [nu = 20] [ut = 12] % Looking for a proof at depth = 3 ... % t = 1 secs [nr = 99] [nf = 0] [nu = 49] [ut = 13] % Looking for a proof at depth = 4 ... % t = 1 secs [nr = 216] [nf = 0] [nu = 90] [ut = 13] % Looking for a proof at depth = 5 ... % t = 1 secs [nr = 435] [nf = 0] [nu = 143] [ut = 13] % Looking for a proof at depth = 6 ... % t = 1 secs [nr = 839] [nf = 0] [nu = 196] [ut = 13] % Looking for a proof at depth = 7 ... % t = 1 secs [nr = 1619] [nf = 0] [nu = 249] [ut = 13] % Looking for a proof at depth = 8 ... % t = 1 secs [nr = 3158] [nf = 0] [nu = 302] [ut = 13] % Looking for a proof at depth = 9 ... % t = 1 secs [nr = 6223] [nf = 0] [nu = 355] [ut = 13] % Looking for a proof at depth = 10 ... % t = 1 secs [nr = 12349] [nf = 0] [nu = 408] [ut = 13] % Looking for a proof at depth = 11 ... % t = 1 secs [nr = 24607] [nf = 0] [nu = 461] [ut = 13] % Looking for a proof at depth = 12 ... % t = 1 secs [nr = 49140] [nf = 0] [nu = 514] [ut = 13] % Looking for a proof at depth = 13 ... % t = 1 secs [nr = 90043] [nf = 0] [nu = 567] [ut = 13] % Looking for a proof at depth = 14 ... % t = 1 secs [nr = 147316] [nf = 0] [nu = 620] [ut = 13] % Looking for a proof at depth = 15 ... % t = 2 secs [nr = 220959] [nf = 0] [nu = 673] [ut = 13] % Looking for a proof at depth = 16 ... % t = 2 secs [nr = 310972] [nf = 0] [nu = 726] [ut = 13] % Looking for a proof at depth = 17 ... % t = 2 secs [nr = 417355] [nf = 0] [nu = 779] [ut = 13] % Looking for a proof at depth = 18 ... % t = 3 secs [nr = 540108] [nf = 0] [nu = 832] [ut = 13] % Looking for a proof at depth = 19 ... % t = 4 secs [nr = 679231] [nf = 0] [nu = 885] [ut = 13] % Looking for a proof at depth = 20 ... % t = 4 secs [nr = 834724] [nf = 0] [nu = 938] [ut = 13] % Looking for a proof at depth = 21 ... % t = 5 secs [nr = 1006587] [nf = 0] [nu = 991] [ut = 13] % Looking for a proof at depth = 22 ... % t = 6 secs [nr = 1194820] [nf = 0] [nu = 1044] [ut = 13] % Looking for a proof at depth = 23 ... % t = 7 secs [nr = 1399423] [nf = 0] [nu = 1097] [ut = 13] % Looking for a proof at depth = 24 ... % t = 8 secs [nr = 1620396] [nf = 0] [nu = 1150] [ut = 13] % Looking for a proof at depth = 25 ... % t = 9 secs [nr = 1857739] [nf = 0] [nu = 1203] [ut = 13] % Looking for a proof at depth = 26 ... % t = 10 secs [nr = 2111452] [nf = 0] [nu = 1256] [ut = 13] % Looking for a proof at depth = 27 ... % t = 11 secs [nr = 2381535] [nf = 0] [nu = 1309] [ut = 13] % Looking for a proof at depth = 28 ... % t = 13 secs [nr = 2667988] [nf = 0] [nu = 1362] [ut = 13] % Looking for a proof at depth = 29 ... % t = 14 secs [nr = 2970811] [nf = 0] [nu = 1415] [ut = 13] % Looking for a proof at depth = 30 ... % t = 16 secs [nr = 3290004] [nf = 0] [nu = 1468] [ut = 13] % Restarting search with different parameters. % Looking for a proof at depth = 1 ... % t = 16 secs [nr = 3290018] [nf = 0] [nu = 1478] [ut = 13] % Looking for a proof at depth = 2 ... % t = 16 secs [nr = 3290049] [nf = 0] [nu = 1496] [ut = 13] % Looking for a proof at depth = 3 ... % t = 16 secs [nr = 3290111] [nf = 0] [nu = 1525] [ut = 13] % Looking for a proof at depth = 4 ... % t = 16 secs [nr = 3290228] [nf = 0] [nu = 1566] [ut = 13] % Looking for a proof at depth = 5 ... % t = 16 secs [nr = 3290447] [nf = 0] [nu = 1619] [ut = 13] % Looking for a proof at depth = 6 ... % t = 16 secs [nr = 3290851] [nf = 0] [nu = 1672] [ut = 13] % Looking for a proof at depth = 7 ... % t = 16 secs [nr = 3291631] [nf = 0] [nu = 1725] [ut = 13] % Looking for a proof at depth = 8 ... % t = 16 secs [nr = 3293170] [nf = 0] [nu = 1778] [ut = 13] % Looking for a proof at depth = 9 ... % t = 16 secs [nr = 3296235] [nf = 0] [nu = 1831] [ut = 13] % Looking for a proof at depth = 10 ... % t = 16 secs [nr = 33 % 02361] [nf = 0] [nu = 1884] [ut = 13] % Looking for a proof at depth = 11 ... % t = 16 secs [nr = 3314619] [nf = 0] [nu = 1937] [ut = 13] % Looking for a proof at depth = 12 ... % t = 16 secs [nr = 3339152] [nf = 0] [nu = 1990] [ut = 13] % Looking for a proof at depth = 13 ... % t = 16 secs [nr = 3380055] [nf = 0] [nu = 2043] [ut = 13] % Looking for a proof at depth = 14 ... % t = 16 secs [nr = 3437328] [nf = 0] [nu = 2096] [ut = 13] % Looking for a proof at depth = 15 ... % t = 17 secs [nr = 3510971] [nf = 0] [nu = 2149] [ut = 13] % Looking for a proof at depth = 16 ... % t = 17 secs [nr = 3600984] [nf = 0] [nu = 2202] [ut = 13] % Looking for a proof at depth = 17 ... % t = 17 secs [nr = 3707367] [nf = 0] [nu = 2255] [ut = 13] % Looking for a proof at depth = 18 ... % t = 18 secs [nr = 3830120] [nf = 0] [nu = 2308] [ut = 13] % Looking for a proof at depth = 19 ... % t = 19 secs [nr = 3969243] [nf = 0] [nu = 2361] [ut = 13] % Looking for a proof at depth = 20 ... % t = 19 secs [nr = 4124736] [nf = 0] [nu = 2414] [ut = 13] % Looking for a proof at depth = 21 ... % t = 20 secs [nr = 4296599] [nf = 0] [nu = 2467] [ut = 13] % Looking for a proof at depth = 22 ... % t = 21 secs [nr = 4484832] [nf = 0] [nu = 2520] [ut = 13] % Looking for a proof at depth = 23 ... % t = 22 secs [nr = 4689435] [nf = 0] [nu = 2573] [ut = 13] % Looking for a proof at depth = 24 ... % t = 23 secs [nr = 4910408] [nf = 0] [nu = 2626] [ut = 13] % Looking for a proof at depth = 25 ... % t = 24 secs [nr = 5147751] [nf = 0] [nu = 2679] [ut = 13] % Looking for a proof at depth = 26 ... % t = 25 secs [nr = 5401464] [nf = 0] [nu = 2732] [ut = 13] % Looking for a proof at depth = 27 ... % t = 26 secs [nr = 5671547] [nf = 0] [nu = 2785] [ut = 13] % Looking for a proof at depth = 28 ... % t = 28 secs [nr = 5958000] [nf = 0] [nu = 2838] [ut = 13] % Looking for a proof at depth = 29 ... % t = 29 secs [nr = 6260823] [nf = 0] [nu = 2891] [ut = 13] % Looking for a proof at depth = 30 ... % t = 31 secs [nr = 6580016] [nf = 0] [nu = 2944] [ut = 13] % GIVE UP! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 6580016 % resolvents: 6580016 factors: 0 % Number of unit clauses generated: 2944 % % unit clauses generated to total clauses generated: 0.04 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 5 [1] = 4 [2] = 3 [3] = 1 % Total = 13 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 2944 [2] = 6577072 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] c_in_3 (+)11 (-)2 % ------------------ % Total: (+)11 (-)2 % Total number of unit clauses retained: 13 % 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: 6580016 % Number of unification failures: 22188268 % Number of unit to unit unification failures: 22 % N literal unification failure due to lookup root_id table: 90328475 % N base clause resolution failure due to lookup table: 14689110 % N UC-BCL resolution dropped due to lookup table: 0 % Max entries in substitution set: 63 % N unit clauses dropped because they exceeded max values: 92 % 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: 25 % Max term depth in a unit clause: 9 % Number of states in UCFA table: 166 % Total number of terms of all unit clauses in table: 212 % 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.78 % Number of symbols (columns) in UCFA: 60 % Profile 2: Number of calls to: % ============================== % PTUnify() = 28768284 % ConstructUnitClause() = 100 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.00 secs % -------------------------------------------------------- % | | % Inferences per sec: 219334 % | | % -------------------------------------------------------- % Elapsed time: 31 secs % CPU time: 30.30 secs % %------------------------------------------------------------------------------