%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : SWV299-2 : TPTP v5.0.0. Released v3.2.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art07.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:51:55 EST 2010 % Result : GaveUp 25.28s % 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/SystemOnTPTP8829/SWV/SWV299-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 = 25] [nf = 0] [nu = 20] [ut = 22] % Looking for a proof at depth = 2 ... % t = 0 secs [nr = 83] [nf = 0] [nu = 61] [ut = 22] % Looking for a proof at depth = 3 ... % t = 0 secs [nr = 206] [nf = 0] [nu = 139] [ut = 22] % Looking for a proof at depth = 4 ... % t = 0 secs [nr = 444] [nf = 0] [nu = 272] [ut = 22] % Looking for a proof at depth = 5 ... % t = 0 secs [nr = 864] [nf = 0] [nu = 463] [ut = 22] % Looking for a proof at depth = 6 ... % t = 0 secs [nr = 1566] [nf = 0] [nu = 684] [ut = 22] % Looking for a proof at depth = 7 ... % t = 0 secs [nr = 2776] [nf = 0] [nu = 905] [ut = 22] % Looking for a proof at depth = 8 ... % t = 0 secs [nr = 5006] [nf = 0] [nu = 1126] [ut = 22] % Looking for a proof at depth = 9 ... % t = 0 secs [nr = 9280] [nf = 0] [nu = 1347] [ut = 22] % Looking for a proof at depth = 10 ... % t = 0 secs [nr = 17646] [nf = 0] [nu = 1568] [ut = 22] % Looking for a proof at depth = 11 ... % t = 0 secs [nr = 34200] [nf = 0] [nu = 1789] [ut = 22] % Looking for a proof at depth = 12 ... % t = 0 secs [nr = 63038] [nf = 0] [nu = 2010] [ut = 22] % Looking for a proof at depth = 13 ... % t = 1 secs [nr = 100066] [nf = 0] [nu = 2231] [ut = 22] % Looking for a proof at depth = 14 ... % t = 1 secs [nr = 145284] [nf = 0] [nu = 2452] [ut = 22] % Looking for a proof at depth = 15 ... % t = 1 secs [nr = 198692] [nf = 0] [nu = 2673] [ut = 22] % Looking for a proof at depth = 16 ... % t = 1 secs [nr = 260290] [nf = 0] [nu = 2894] [ut = 22] % Looking for a proof at depth = 17 ... % t = 2 secs [nr = 330078] [nf = 0] [nu = 3115] [ut = 22] % Looking for a proof at depth = 18 ... % t = 2 secs [nr = 408056] [nf = 0] [nu = 3336] [ut = 22] % Looking for a proof at depth = 19 ... % t = 3 secs [nr = 494224] [nf = 0] [nu = 3557] [ut = 22] % Looking for a proof at depth = 20 ... % t = 3 secs [nr = 588582] [nf = 0] [nu = 3778] [ut = 22] % Looking for a proof at depth = 21 ... % t = 4 secs [nr = 691130] [nf = 0] [nu = 3999] [ut = 22] % Looking for a proof at depth = 22 ... % t = 5 secs [nr = 801868] [nf = 0] [nu = 4220] [ut = 22] % Looking for a proof at depth = 23 ... % t = 6 secs [nr = 920796] [nf = 0] [nu = 4441] [ut = 22] % Looking for a proof at depth = 24 ... % t = 6 secs [nr = 1047914] [nf = 0] [nu = 4662] [ut = 22] % Looking for a proof at depth = 25 ... % t = 7 secs [nr = 1183222] [nf = 0] [nu = 4883] [ut = 22] % Looking for a proof at depth = 26 ... % t = 8 secs [nr = 1326720] [nf = 0] [nu = 5104] [ut = 22] % Looking for a proof at depth = 27 ... % t = 10 secs [nr = 1478408] [nf = 0] [nu = 5325] [ut = 22] % Looking for a proof at depth = 28 ... % t = 11 secs [nr = 1638286] [nf = 0] [nu = 5546] [ut = 22] % Looking for a proof at depth = 29 ... % t = 12 secs [nr = 1806354] [nf = 0] [nu = 5767] [ut = 22] % Looking for a proof at depth = 30 ... % t = 13 secs [nr = 1982612] [nf = 0] [nu = 5988] [ut = 22] % Restarting search with different parameters. % Looking for a proof at depth = 1 ... % t = 13 secs [nr = 1982637] [nf = 0] [nu = 6008] [ut = 22] % Looking for a proof at depth = 2 ... % t = 13 secs [nr = 1982695] [nf = 0] [nu = 6049] [ut = 22] % Looking for a proof at depth = 3 ... % t = 13 secs [nr = 1982818] [nf = 0] [nu = 6127] [ut = 22] % Looking for a proof at depth = 4 ... % t = 13 secs [nr = 1983056] [nf = 0] [nu = 6260] [ut = 22] % Looking for a proof at depth = 5 ... % t = 13 secs [nr = 1983476] [nf = 0] [nu = 6451] [ut = 22] % Looking for a proof at depth = 6 ... % t = 13 secs [nr = 1984178] [nf = 0] [nu = 6672] [ut = 22] % Looking for a proof at depth = 7 ... % t = 13 secs [nr = 1985388] [nf = 0] [nu = 6893] [ut = 22] % Looking for a proof at depth = 8 ... % t = 13 secs [nr = 1987618] [nf = 0] [nu = 7114] [ut = 22] % Looking for a proof at depth = 9 ... % t = 13 secs [nr = 1991892] [nf = 0] [nu = 7335] [ut = 22] % Looking for a proof at depth = 10 ... % t = 1 % 3 secs [nr = 2000258] [nf = 0] [nu = 7556] [ut = 22] % Looking for a proof at depth = 11 ... % t = 13 secs [nr = 2016812] [nf = 0] [nu = 7777] [ut = 22] % Looking for a proof at depth = 12 ... % t = 13 secs [nr = 2045650] [nf = 0] [nu = 7998] [ut = 22] % Looking for a proof at depth = 13 ... % t = 13 secs [nr = 2082678] [nf = 0] [nu = 8219] [ut = 22] % Looking for a proof at depth = 14 ... % t = 14 secs [nr = 2127896] [nf = 0] [nu = 8440] [ut = 22] % Looking for a proof at depth = 15 ... % t = 14 secs [nr = 2181304] [nf = 0] [nu = 8661] [ut = 22] % Looking for a proof at depth = 16 ... % t = 14 secs [nr = 2242902] [nf = 0] [nu = 8882] [ut = 22] % Looking for a proof at depth = 17 ... % t = 15 secs [nr = 2312690] [nf = 0] [nu = 9103] [ut = 22] % Looking for a proof at depth = 18 ... % t = 15 secs [nr = 2390668] [nf = 0] [nu = 9324] [ut = 22] % Looking for a proof at depth = 19 ... % t = 16 secs [nr = 2476836] [nf = 0] [nu = 9545] [ut = 22] % Looking for a proof at depth = 20 ... % t = 16 secs [nr = 2571194] [nf = 0] [nu = 9766] [ut = 22] % Looking for a proof at depth = 21 ... % t = 17 secs [nr = 2673742] [nf = 0] [nu = 9987] [ut = 22] % Looking for a proof at depth = 22 ... % t = 18 secs [nr = 2784480] [nf = 0] [nu = 10208] [ut = 22] % Looking for a proof at depth = 23 ... % t = 18 secs [nr = 2903408] [nf = 0] [nu = 10429] [ut = 22] % Looking for a proof at depth = 24 ... % t = 19 secs [nr = 3030526] [nf = 0] [nu = 10650] [ut = 22] % Looking for a proof at depth = 25 ... % t = 20 secs [nr = 3165834] [nf = 0] [nu = 10871] [ut = 22] % Looking for a proof at depth = 26 ... % t = 21 secs [nr = 3309332] [nf = 0] [nu = 11092] [ut = 22] % Looking for a proof at depth = 27 ... % t = 22 secs [nr = 3461020] [nf = 0] [nu = 11313] [ut = 22] % Looking for a proof at depth = 28 ... % t = 23 secs [nr = 3620898] [nf = 0] [nu = 11534] [ut = 22] % Looking for a proof at depth = 29 ... % t = 24 secs [nr = 3788966] [nf = 0] [nu = 11755] [ut = 22] % Looking for a proof at depth = 30 ... % t = 25 secs [nr = 3965224] [nf = 0] [nu = 11976] [ut = 22] % GIVE UP! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 3965224 % resolvents: 3965224 factors: 0 % Number of unit clauses generated: 11976 % % unit clauses generated to total clauses generated: 0.30 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 4 [1] = 18 % Total = 22 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 11976 [2] = 3953248 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] c_in_3 (+)21 (-)1 % ------------------ % Total: (+)21 (-)1 % Total number of unit clauses retained: 22 % 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: 3965224 % Number of unification failures: 22906384 % Number of unit to unit unification failures: 21 % N literal unification failure due to lookup root_id table: 88226391 % N base clause resolution failure due to lookup table: 3674246 % N UC-BCL resolution dropped due to lookup table: 0 % Max entries in substitution set: 64 % N unit clauses dropped because they exceeded max values: 424 % 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: 42 % Max term depth in a unit clause: 11 % Number of states in UCFA table: 329 % Total number of terms of all unit clauses in table: 562 % 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.59 % Number of symbols (columns) in UCFA: 60 % Profile 2: Number of calls to: % ============================== % PTUnify() = 26871608 % ConstructUnitClause() = 442 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.00 secs % -------------------------------------------------------- % | | % Inferences per sec: 158609 % | | % -------------------------------------------------------- % Elapsed time: 25 secs % CPU time: 25.27 secs % %------------------------------------------------------------------------------