TSTP Solution File: MSC007-1.008 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : MSC007-1.008 : TPTP v5.0.0. Released v1.0.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art06.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 02:00:47 EST 2010
% Result : GaveUp 0.33s
% 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/SystemOnTPTP5537/MSC/MSC007-1.008+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 = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 4 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 9 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 10 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 15 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 16 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 17 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 18 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 19 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 20 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 21 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 22 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 23 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 24 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 25 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 26 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 27 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 28 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 29 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 30 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 4 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 9 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 10 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 15 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 16 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 17 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 18 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 19 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 20 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 21 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 22 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 23 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 24 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 25 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 26 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 27 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 28 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 29 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 30 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 0]
% GIVE UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 0
% resolvents: 0 factors: 0
% Number of unit clauses generated: 0
% % unit clauses generated to total clauses generated: nan
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% Total = 0
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% Average size of a generated clause: nan
% Number of unit clauses per predicate list:
% ==========================================
% [0] pigeon_1_in_hole_1 (+)0 (-)0
% [1] pigeon_1_in_hole_2 (+)0 (-)0
% [2] pigeon_1_in_hole_3 (+)0 (-)0
% [3] pigeon_1_in_hole_4 (+)0 (-)0
% [4] pigeon_1_in_hole_5 (+)0 (-)0
% [5] pigeon_1_in_hole_6 (+)0 (-)0
% [6] pigeon_1_in_hole_7 (+)0 (-)0
% [7] pigeon_2_in_hole_1 (+)0 (-)0
% [8] pigeon_2_in_hole_2 (+)0 (-)0
% [9] pigeon_2_in_hole_3 (+)0 (-)0
% [10] pigeon_2_in_hole_4 (+)0 (-)0
% [11] pigeon_2_in_hole_5 (+)0 (-)0
% [12] pigeon_2_in_hole_6 (+)0 (-)0
% [13] pigeon_2_in_hole_7 (+)0 (-)0
% [14] pigeon_3_in_hole_1 (+)0 (-)0
% [15] pigeon_3_in_hole_2 (+)0 (-)0
% [16] pigeon_3_in_hole_3 (+)0 (-)0
% [17] pigeon_3_in_hole_4 (+)0 (-)0
% [18] pigeon_3_in_hole_5 (+)0 (-)0
% [19] pigeon_3_in_hole_6 (+)0 (-)0
% [20] pigeon_3_in_hole_7 (+)0 (-)0
% [21] pigeon_4_in_hole_1 (+)0 (-)0
% [22] pigeon_4_in_hole_2 (+)0 (-)0
% [23] pigeon_4_in_hole_3 (+)0 (-)0
% [24] pigeon_4_in_hole_4 (+)0 (-)0
% [25] pigeon_4_in_hole_5 (+)0 (-)0
% [26] pigeon_4_in_hole_6 (+)0 (-)0
% [27] pigeon_4_in_hole_7 (+)0 (-)0
% [28] pigeon_5_in_hole_1 (+)0 (-)0
% [29] pigeon_5_in_hole_2 (+)0 (-)0
% [30] pigeon_5_in_hole_3 (+)0 (-)0
% [31] pigeon_5_in_hole_4 (+)0 (-)0
% [32] pigeon_5_in_hole_5 (+)0 (-)0
% [33] pigeon_5_in_hole_6 (+)0 (-)0
% [34] pigeon_5_in_hole_7 (+)0 (-)0
% [35] pigeon_6_in_hole_1 (+)0 (-)0
% [36] pigeon_6_in_hole_2 (+)0 (-)0
% [37] pigeon_6_in_hole_3 (+)0 (-)0
% [38] pigeon_6_in_hole_4 (+)0 (-)0
% [39] pigeon_6_in_hole_5 (+)0 (-)0
% [40] pigeon_6_in_hole_6 (+)0 (-)0
% [41] pigeon_6_in_hole_7 (+)0 (-)0
% [42] pigeon_7_in_hole_1 (+)0 (-)0
% [43] pigeon_7_in_hole_2 (+)0 (-)0
% [44] pigeon_7_in_hole_3 (+)0 (-)0
% [45] pigeon_7_in_hole_4 (+)0 (-)0
% [46] pigeon_7_in_hole_5 (+)0 (-)0
% [47] pigeon_7_in_hole_6 (+)0 (-)0
% [48] pigeon_7_in_hole_7 (+)0 (-)0
% [49] pigeon_8_in_hole_1 (+)0 (-)0
% [50] pigeon_8_in_hole_2 (+)0 (-)0
% [51] pigeon_8_in_hole_3 (+)0 (-)0
% [52] pigeon_8_in_hole_4 (+)0 (-)0
% [53] pigeon_8_in_hole_5 (+)0 (-)0
% [54] pigeon_8_in_hole_6 (+)0 (-)0
% [55] pigeon_8_in_hole_7 (+)0 (-)0
% ------------------
% Total: (+)0 (-)0
% Total number of unit clauses retained: 0
% 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: 0
% Number of unification failures: 0
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 0
% N base clause resolution failure due to lookup table: 1158360
% 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: 0
% Max term depth in a unit clause: 0
% Number of states in UCFA table: 0
% 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: nan
% Number of symbols (columns) in UCFA: 90
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 0
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: nan
% | |
% --------------------------------------------------------
% Elapsed time: 1 secs
% CPU time: 0.33 secs
%
%------------------------------------------------------------------------------