TSTP Solution File: COM003-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : COM003-1 : TPTP v5.0.0. Bugfixed v1.0.1.
% 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 : Sat Nov 27 18:04:23 EST 2010
% Result : Timeout 300.02s
% 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/SystemOnTPTP21280/COM/COM003-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 = 1 secs [nr = 2] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 20] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 58] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 1 secs [nr = 126] [nf = 5] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 314] [nf = 12] [nu = 5] [ut = 2]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 751] [nf = 41] [nu = 14] [ut = 3]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 1391] [nf = 98] [nu = 71] [ut = 3]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 2363] [nf = 157] [nu = 128] [ut = 3]
% Looking for a proof at depth = 9 ...
% t = 1 secs [nr = 3749] [nf = 218] [nu = 185] [ut = 3]
% Looking for a proof at depth = 10 ...
% t = 1 secs [nr = 5459] [nf = 311] [nu = 242] [ut = 3]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 7529] [nf = 454] [nu = 299] [ut = 3]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 9673] [nf = 599] [nu = 356] [ut = 3]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 11949] [nf = 776] [nu = 413] [ut = 3]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 14393] [nf = 987] [nu = 470] [ut = 3]
% Looking for a proof at depth = 15 ...
% t = 1 secs [nr = 16911] [nf = 1200] [nu = 527] [ut = 3]
% Looking for a proof at depth = 16 ...
% t = 1 secs [nr = 19561] [nf = 1445] [nu = 584] [ut = 3]
% Looking for a proof at depth = 17 ...
% t = 1 secs [nr = 22379] [nf = 1724] [nu = 641] [ut = 3]
% Looking for a proof at depth = 18 ...
% t = 1 secs [nr = 25271] [nf = 2005] [nu = 698] [ut = 3]
% Looking for a proof at depth = 19 ...
% t = 1 secs [nr = 28295] [nf = 2318] [nu = 755] [ut = 3]
% Looking for a proof at depth = 20 ...
% t = 1 secs [nr = 31487] [nf = 2665] [nu = 812] [ut = 3]
% Looking for a proof at depth = 21 ...
% t = 1 secs [nr = 34753] [nf = 3014] [nu = 869] [ut = 3]
% Looking for a proof at depth = 22 ...
% t = 1 secs [nr = 38151] [nf = 3395] [nu = 926] [ut = 3]
% Looking for a proof at depth = 23 ...
% t = 1 secs [nr = 41717] [nf = 3810] [nu = 983] [ut = 3]
% Looking for a proof at depth = 24 ...
% t = 1 secs [nr = 45357] [nf = 4227] [nu = 1040] [ut = 3]
% Looking for a proof at depth = 25 ...
% t = 1 secs [nr = 49129] [nf = 4676] [nu = 1097] [ut = 3]
% Looking for a proof at depth = 26 ...
% t = 1 secs [nr = 53069] [nf = 5159] [nu = 1154] [ut = 3]
% Looking for a proof at depth = 27 ...
% t = 1 secs [nr = 57083] [nf = 5644] [nu = 1211] [ut = 3]
% Looking for a proof at depth = 28 ...
% t = 1 secs [nr = 61229] [nf = 6161] [nu = 1268] [ut = 3]
% Looking for a proof at depth = 29 ...
% t = 1 secs [nr = 65543] [nf = 6712] [nu = 1325] [ut = 3]
% Looking for a proof at depth = 30 ...
% t = 1 secs [nr = 69931] [nf = 7265] [nu = 1382] [ut = 3]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 1 secs [nr = 69934] [nf = 7265] [nu = 1383] [ut = 3]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 69955] [nf = 7265] [nu = 1384] [ut = 3]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 70040] [nf = 7267] [nu = 1385] [ut = 3]
% Looking for a proof at depth = 4 ...
% t = 1 secs [nr = 70551] [nf = 7364] [nu = 1386] [ut = 3]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 73406] [nf = 7837] [nu = 1395] [ut = 3]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 91117] [nf = 9154] [nu = 1416] [ut = 3]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 175690] [nf = 15620] [nu = 1619] [ut = 4]
% Looking for a proof at depth = 8 ...
% t = 2 secs [nr = 605751] [nf = 40945] [nu = 1822] [ut = 4]
% Looking for a proof at depth = 9 ...
% t = 6 secs [nr = 2646820] [nf = 189368] [nu = 2073] [ut = 4]
% Looking for a proof at depth
% = 10 ...
% t = 25 secs [nr = 11599469] [nf = 1033338] [nu = 2540] [ut = 4]
% Looking for a proof at depth = 11 ...
% t = 105 secs [nr = 49519952] [nf = 5412135] [nu = 3007] [ut = 4]
% Looking for a proof at depth = 12 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 157289458
% resolvents: 139095753 factors: 18193705
% Number of unit clauses generated: 3666
% % unit clauses generated to total clauses generated: 0.00
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 1 [5] = 1 [6] = 1 [7] = 1
% Total = 4
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 3666 [2] = 466863 [3] = 4023881 [4] = 23225918 [5] = 57191370 [6] = 72377760
% Average size of a generated clause: 6.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] algorithm_1 (+)1 (-)0
% [1] program_1 (+)1 (-)0
% [2] halts2_2 (+)0 (-)0
% [3] outputs_2 (+)0 (-)0
% [4] decides_3 (+)2 (-)0
% [5] halts3_3 (+)0 (-)0
% ------------------
% Total: (+)4 (-)0
% Total number of unit clauses retained: 4
% Number of clauses skipped because of their length: 220904026
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 264884
% Number of successful unifications: 157289458
% Number of unification failures: 176532905
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 544062437
% N base clause resolution failure due to lookup table: 99244310
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 30
% N unit clauses dropped because they exceeded max values: 712
% 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: 3
% Max term depth in a unit clause: 1
% Number of states in UCFA table: 9
% Total number of terms of all unit clauses in table: 8
% 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.12
% Number of symbols (columns) in UCFA: 52
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 333822363
% ConstructUnitClause() = 715
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.01 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 524298
% | |
% --------------------------------------------------------
% Elapsed time: 304 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------