%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : NLP237-1 : TPTP v5.0.0. Released v2.4.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 03:02:31 EST 2010 % Result : GaveUp 1.44s % 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/SystemOnTPTP15326/NLP/NLP237-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 = 1260] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 2 ... % t = 0 secs [nr = 2804] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 3 ... % t = 0 secs [nr = 4348] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 4 ... % t = 0 secs [nr = 5892] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 5 ... % t = 0 secs [nr = 7436] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 6 ... % t = 0 secs [nr = 8980] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 7 ... % t = 0 secs [nr = 10524] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 8 ... % t = 0 secs [nr = 12068] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 9 ... % t = 1 secs [nr = 13612] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 10 ... % t = 1 secs [nr = 15156] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 11 ... % t = 1 secs [nr = 16700] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 12 ... % t = 1 secs [nr = 18244] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 13 ... % t = 1 secs [nr = 19788] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 14 ... % t = 1 secs [nr = 21332] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 15 ... % t = 1 secs [nr = 22876] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 16 ... % t = 1 secs [nr = 24420] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 17 ... % t = 1 secs [nr = 25964] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 18 ... % t = 1 secs [nr = 27508] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 19 ... % t = 1 secs [nr = 29052] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 20 ... % t = 1 secs [nr = 30596] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 21 ... % t = 1 secs [nr = 32140] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 22 ... % t = 1 secs [nr = 33684] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 23 ... % t = 1 secs [nr = 35228] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 24 ... % t = 1 secs [nr = 36772] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 25 ... % t = 1 secs [nr = 38316] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 26 ... % t = 1 secs [nr = 39860] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 27 ... % t = 1 secs [nr = 41404] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 28 ... % t = 1 secs [nr = 42948] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 29 ... % t = 1 secs [nr = 44492] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 30 ... % t = 1 secs [nr = 46036] [nf = 0] [nu = 0] [ut = 2] % Restarting search with different parameters. % Looking for a proof at depth = 1 ... % t = 1 secs [nr = 47296] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 2 ... % t = 1 secs [nr = 48840] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 3 ... % t = 1 secs [nr = 50400] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 4 ... % t = 1 secs [nr = 51960] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 5 ... % t = 1 secs [nr = 53520] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 6 ... % t = 1 secs [nr = 55080] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 7 ... % t = 1 secs [nr = 56640] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 8 ... % t = 1 secs [nr = 58200] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 9 ... % t = 1 secs [nr = 59760] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 10 ... % t = 1 secs [nr = 61320] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 11 ... % t = 1 secs [nr = 62880] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 12 ... % t = 1 secs [nr = 64440] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 13 ... % t = 1 secs [nr = 66000] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 14 ... % t = 1 secs [nr = 67560] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 15 ... % t = 1 secs [nr = 69120] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 16 ... % t = 1 secs [nr = 70680] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 17 ... % t = 1 secs [nr = 72240] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 18 ... % t = 1 secs [nr = 73800] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 19 ... % t = 1 secs [nr = 75360] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 20 ... % t = 1 secs [nr = 76920] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 21 ... % t = 1 secs [nr = 78480] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 22 ... % t = 1 secs [nr = 80040] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 23 ... % t = 1 secs [nr = 81600] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 24 ... % t = 1 secs [nr = 83160] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 25 ... % t = 1 secs [nr = 84720] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 26 ... % t = 2 secs [nr = 86280] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 27 ... % t = 2 secs [nr = 87840] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 28 ... % t = 2 secs [nr = 89400] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 29 ... % t = 2 secs [nr = 90960] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 30 ... % t = 2 secs [nr = 92520] [nf = 0] [nu = 0] [ut = 2] % GIVE UP! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 92520 % resolvents: 92520 factors: 0 % Number of unit clauses generated: 0 % % unit clauses generated to total clauses generated: 0.00 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 2 % Total = 2 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [2] = 75600 [3] = 16472 [4] = 448 % Average size of a generated clause: 3.0 % Number of unit clauses per predicate list: % ========================================== % [0] ssSkC0 (+)0 (-)0 % [1] actual_world_1 (+)2 (-)0 % [2] accessible_world_2 (+)0 (-)0 % [3] event_2 (+)0 (-)0 % [4] forename_2 (+)0 (-)0 % [5] jules_forename_2 (+)0 (-)0 % [6] man_2 (+)0 (-)0 % [7] present_2 (+)0 (-)0 % [8] proposition_2 (+)0 (-)0 % [9] smoke_2 (+)0 (-)0 % [10] state_2 (+)0 (-)0 % [11] think_believe_consider_2 (+)0 (-)0 % [12] vincent_forename_2 (+)0 (-)0 % [13] agent_3 (+)0 (-)0 % [14] of_3 (+)0 (-)0 % [15] theme_3 (+)0 (-)0 % [16] be_4 (+)0 (-)0 % ------------------ % Total: (+)2 (-)0 % Total number of unit clauses retained: 2 % Number of clauses skipped because of their length: 31410 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 568 % Number of successful unifications: 92520 % Number of unification failures: 0 % Number of unit to unit unification failures: 0 % N literal unification failure due to lookup root_id table: 16188312 % N base clause resolution failure due to lookup table: 7081392 % N UC-BCL resolution dropped due to lookup table: 0 % Max entries in substitution set: 0 % N unit clauses dropped because they exceeded max values: 0 % 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: 1 % Max term depth in a unit clause: 1 % Number of states in UCFA table: 3 % Total number of terms of all unit clauses in table: 2 % 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: 1.50 % Number of symbols (columns) in UCFA: 84 % Profile 2: Number of calls to: % ============================== % PTUnify() = 92520 % ConstructUnitClause() = 0 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.00 secs % -------------------------------------------------------- % | | % Inferences per sec: 92520 % | | % -------------------------------------------------------- % Elapsed time: 2 secs % CPU time: 1.44 secs % %------------------------------------------------------------------------------