TSTP Solution File: SYN308-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN308-1 : TPTP v5.0.0. Released v1.2.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art09.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 08:50:44 EST 2010
% Result : GaveUp 0.39s
% 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/SystemOnTPTP2831/SYN/SYN308-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 = 1]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 0] [nf = 2] [nu = 0] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 0] [nf = 4] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 0] [nf = 6] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 0] [nf = 8] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 0] [nf = 10] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 0] [nf = 12] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 0] [nf = 14] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 0] [nf = 16] [nu = 0] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 0] [nf = 18] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 0] [nf = 20] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 0] [nf = 22] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 0] [nf = 24] [nu = 0] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 0] [nf = 26] [nu = 0] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 0] [nf = 28] [nu = 0] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 0] [nf = 30] [nu = 0] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 0] [nf = 32] [nu = 0] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 0] [nf = 34] [nu = 0] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 0] [nf = 36] [nu = 0] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 0] [nf = 38] [nu = 0] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 0] [nf = 40] [nu = 0] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 0] [nf = 42] [nu = 0] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 0] [nf = 44] [nu = 0] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 0] [nf = 46] [nu = 0] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 0] [nf = 48] [nu = 0] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 0] [nf = 50] [nu = 0] [ut = 1]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 0] [nf = 52] [nu = 0] [ut = 1]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 0] [nf = 54] [nu = 0] [ut = 1]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 0] [nf = 56] [nu = 0] [ut = 1]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 0] [nf = 56] [nu = 0] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 0] [nf = 56] [nu = 0] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 0] [nf = 58] [nu = 0] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 0] [nf = 60] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 10] [nf = 92] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 20] [nf = 124] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 30] [nf = 156] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 44] [nf = 204] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 102] [nf = 412] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 160] [nf = 620] [nu = 0] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 218] [nf = 828] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 276] [nf = 1036] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 334] [nf = 1244] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 392] [nf = 1452] [nu = 0] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 450] [nf = 1660] [nu = 0] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 508] [nf = 1868] [nu = 0] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 566] [nf = 2076] [nu = 0] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 624] [nf = 2284] [nu = 0] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 682] [nf = 2492] [nu = 0] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 740] [nf = 2700] [nu = 0] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 798] [nf = 2908] [nu = 0] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 856] [nf = 3116] [nu = 0] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 914] [nf = 3324] [nu = 0] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 972] [nf = 3532] [nu = 0] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 1030] [nf = 3740] [nu = 0] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 1088] [nf = 3948] [nu = 0] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 1146] [nf = 4156] [nu = 0] [ut = 1]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 1204] [nf = 4364] [nu = 0] [ut = 1]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 1262] [nf = 4572] [nu = 0] [ut = 1]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 1320] [nf = 4780] [nu = 0] [ut = 1]
% GIVE UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 6100
% resolvents: 1320 factors: 4780
% 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] = 1
% Total = 1
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [3] = 112 [4] = 364 [5] = 4460 [6] = 1164
% Average size of a generated clause: 6.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] e_1 (+)1 (-)0
% [1] g_1 (+)0 (-)0
% [2] p_2 (+)0 (-)0
% [3] r_2 (+)0 (-)0
% ------------------
% Total: (+)1 (-)0
% Total number of unit clauses retained: 1
% Number of clauses skipped because of their length: 86
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 13
% Number of successful unifications: 6100
% Number of unification failures: 0
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 4784
% N base clause resolution failure due to lookup table: 11932
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 9
% 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: 7
% Max term depth in a unit clause: 3
% Number of states in UCFA table: 9
% Total number of terms of all unit clauses in table: 7
% 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: 1.29
% Number of symbols (columns) in UCFA: 44
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 6100
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.38 secs
%
%------------------------------------------------------------------------------