TSTP Solution File: PUZ011-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : PUZ011-1 : TPTP v5.0.0. Released v1.0.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art02.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:53:17 EST 2010
% Result : GaveUp 0.19s
% 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/SystemOnTPTP26255/PUZ/PUZ011-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 = 0] [nf = 0] [nu = 0] [ut = 26]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 26]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 26]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 345] [nf = 2] [nu = 108] [ut = 35]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 690] [nf = 4] [nu = 216] [ut = 35]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 1035] [nf = 6] [nu = 324] [ut = 35]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 1380] [nf = 8] [nu = 432] [ut = 35]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 1725] [nf = 10] [nu = 540] [ut = 35]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 2070] [nf = 12] [nu = 648] [ut = 35]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 2415] [nf = 14] [nu = 756] [ut = 35]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 2760] [nf = 16] [nu = 864] [ut = 35]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 3105] [nf = 18] [nu = 972] [ut = 35]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 3450] [nf = 20] [nu = 1080] [ut = 35]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 3795] [nf = 22] [nu = 1188] [ut = 35]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 4140] [nf = 24] [nu = 1296] [ut = 35]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 4485] [nf = 26] [nu = 1404] [ut = 35]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 4830] [nf = 28] [nu = 1512] [ut = 35]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 5175] [nf = 30] [nu = 1620] [ut = 35]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 5520] [nf = 32] [nu = 1728] [ut = 35]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 5865] [nf = 34] [nu = 1836] [ut = 35]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 6210] [nf = 36] [nu = 1944] [ut = 35]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 6555] [nf = 38] [nu = 2052] [ut = 35]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 6900] [nf = 40] [nu = 2160] [ut = 35]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 7245] [nf = 42] [nu = 2268] [ut = 35]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 7590] [nf = 44] [nu = 2376] [ut = 35]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 7935] [nf = 46] [nu = 2484] [ut = 35]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 8280] [nf = 48] [nu = 2592] [ut = 35]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 8625] [nf = 50] [nu = 2700] [ut = 35]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 8970] [nf = 52] [nu = 2808] [ut = 35]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 9315] [nf = 54] [nu = 2916] [ut = 35]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 9315] [nf = 54] [nu = 2916] [ut = 35]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 9315] [nf = 54] [nu = 2916] [ut = 35]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 9315] [nf = 54] [nu = 2916] [ut = 35]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 9660] [nf = 56] [nu = 3024] [ut = 35]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 10005] [nf = 58] [nu = 3132] [ut = 35]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 10350] [nf = 60] [nu = 3240] [ut = 35]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 10695] [nf = 62] [nu = 3348] [ut = 35]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 11040] [nf = 64] [nu = 3456] [ut = 35]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 11385] [nf = 66] [nu = 3564] [ut = 35]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 11730] [nf = 68] [nu = 3672] [ut = 35]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 12075] [nf = 70] [nu = 3780] [ut = 35]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 12420] [nf = 72] [nu = 3888] [ut = 35]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 12765] [nf = 74] [nu = 3996] [ut = 35]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 13110] [nf = 76] [nu = 4104] [ut = 35]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 13455] [nf = 78] [nu = 4212] [ut = 35]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 13800] [nf = 80] [nu = 4320] [ut = 35]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 14145] [nf = 82] [nu = 4428] [ut = 35]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 14490] [nf = 84] [nu = 4536] [ut = 35]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 14835] [nf = 86] [nu = 4644] [ut = 35]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 15180] [nf = 88] [nu = 4752] [ut = 35]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 15525] [nf = 90] [nu = 4860] [ut = 35]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 15870] [nf = 92] [nu = 4968] [ut = 35]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 16215] [nf = 94] [nu = 5076] [ut = 35]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 16560] [nf = 96] [nu = 5184] [ut = 35]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 16905] [nf = 98] [nu = 5292] [ut = 35]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 17250] [nf = 100] [nu = 5400] [ut = 35]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 17595] [nf = 102] [nu = 5508] [ut = 35]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 17940] [nf = 104] [nu = 5616] [ut = 35]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 18285] [nf = 106] [nu = 5724] [ut = 35]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 18630] [nf = 108] [nu = 5832] [ut = 35]
% GIVE UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 18738
% resolvents: 18630 factors: 108
% Number of unit clauses generated: 5832
% % unit clauses generated to total clauses generated: 31.12
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 26 [4] = 9
% Total = 35
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 5832 [2] = 8424 [3] = 2484 [4] = 1998
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] african_1 (+)6 (-)3
% [1] asian_1 (+)3 (-)6
% [2] ocean_1 (+)2 (-)0
% [3] south_american_1 (+)3 (-)0
% [4] borders_2 (+)12 (-)0
% ------------------
% Total: (+)26 (-)9
% Total number of unit clauses retained: 35
% 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: 18738
% Number of unification failures: 119232
% Number of unit to unit unification failures: 36
% N literal unification failure due to lookup root_id table: 0
% N base clause resolution failure due to lookup table: 0
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 3
% N unit clauses dropped because they exceeded max values: 207
% 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: 2
% Max term depth in a unit clause: 1
% Number of states in UCFA table: 12
% Total number of terms of all unit clauses in table: 47
% 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: 0.26
% Number of symbols (columns) in UCFA: 53
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 137970
% ConstructUnitClause() = 216
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.19 secs
%
%------------------------------------------------------------------------------