TSTP Solution File: SYN793-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN793-1 : TPTP v5.0.0. Released v2.5.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Nov 28 11:53:54 EST 2010
% Result : Timeout 300.01s
% 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/SystemOnTPTP13848/SYN/SYN793-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 = 2]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 32] [nf = 16] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 398] [nf = 90] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 4628] [nf = 328] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 25248] [nf = 706] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% t = 1 secs [nr = 140368] [nf = 1178] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% t = 1 secs [nr = 255488] [nf = 1650] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 370608] [nf = 2122] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 485728] [nf = 2594] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% t = 2 secs [nr = 600848] [nf = 3066] [nu = 0] [ut = 2]
% Looking for a proof at depth = 14 ...
% t = 2 secs [nr = 715968] [nf = 3538] [nu = 0] [ut = 2]
% Looking for a proof at depth = 15 ...
% t = 2 secs [nr = 831088] [nf = 4010] [nu = 0] [ut = 2]
% Looking for a proof at depth = 16 ...
% t = 3 secs [nr = 946208] [nf = 4482] [nu = 0] [ut = 2]
% Looking for a proof at depth = 17 ...
% t = 3 secs [nr = 1061328] [nf = 4954] [nu = 0] [ut = 2]
% Looking for a proof at depth = 18 ...
% t = 3 secs [nr = 1176448] [nf = 5426] [nu = 0] [ut = 2]
% Looking for a proof at depth = 19 ...
% t = 4 secs [nr = 1291568] [nf = 5898] [nu = 0] [ut = 2]
% Looking for a proof at depth = 20 ...
% t = 4 secs [nr = 1406688] [nf = 6370] [nu = 0] [ut = 2]
% Looking for a proof at depth = 21 ...
% t = 4 secs [nr = 1521808] [nf = 6842] [nu = 0] [ut = 2]
% Looking for a proof at depth = 22 ...
% t = 4 secs [nr = 1636928] [nf = 7314] [nu = 0] [ut = 2]
% Looking for a proof at depth = 23 ...
% t = 5 secs [nr = 1752048] [nf = 7786] [nu = 0] [ut = 2]
% Looking for a proof at depth = 24 ...
% t = 5 secs [nr = 1867168] [nf = 8258] [nu = 0] [ut = 2]
% Looking for a proof at depth = 25 ...
% t = 5 secs [nr = 1982288] [nf = 8730] [nu = 0] [ut = 2]
% Looking for a proof at depth = 26 ...
% t = 6 secs [nr = 2097408] [nf = 9202] [nu = 0] [ut = 2]
% Looking for a proof at depth = 27 ...
% t = 6 secs [nr = 2212528] [nf = 9674] [nu = 0] [ut = 2]
% Looking for a proof at depth = 28 ...
% t = 6 secs [nr = 2327648] [nf = 10146] [nu = 0] [ut = 2]
% Looking for a proof at depth = 29 ...
% t = 6 secs [nr = 2442768] [nf = 10618] [nu = 0] [ut = 2]
% Looking for a proof at depth = 30 ...
% t = 7 secs [nr = 2557888] [nf = 11090] [nu = 0] [ut = 2]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 7 secs [nr = 2557888] [nf = 11090] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% t = 7 secs [nr = 2557888] [nf = 11090] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% t = 7 secs [nr = 2557888] [nf = 11090] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% t = 7 secs [nr = 2557920] [nf = 11090] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% t = 7 secs [nr = 2558086] [nf = 11214] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% t = 7 secs [nr = 2559242] [nf = 12052] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% t = 7 secs [nr = 2570920] [nf = 13854] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% t = 7 secs [nr = 2629184] [nf = 16540] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% t = 8 secs [nr = 2925759] [nf = 21198] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% t = 9 secs [nr
% = 3252344] [nf = 41325] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% t = 11 secs [nr = 3990506] [nf = 313044] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% t = 43 secs [nr = 14948275] [nf = 2049332] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 111161550
% resolvents: 103748383 factors: 7413167
% 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:
% ------------------------------------------------
% [4] = 1118556 [5] = 3126146 [6] = 32226678 [7] = 40782786 [8] = 22890316 [9] = 7856566
% [10] = 2551204 [11] = 525992 [12] = 79445 [13] = 3827 [14] = 34
% Average size of a generated clause: 8.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] ssPv1_1 (+)0 (-)0
% [1] ssPv2_1 (+)0 (-)0
% [2] ssPv3_1 (+)0 (-)0
% [3] ssPv4_1 (+)0 (-)0
% [4] ssPv5_1 (+)0 (-)0
% [5] ssPv6_1 (+)0 (-)0
% [6] ssPv7_1 (+)0 (-)0
% [7] ssPv8_1 (+)0 (-)0
% [8] ssRr_2 (+)2 (-)0
% ------------------
% Total: (+)2 (-)0
% Total number of unit clauses retained: 2
% Number of clauses skipped because of their length: 2771593498
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 111161550
% Number of unification failures: 154908581
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 30416347
% N base clause resolution failure due to lookup table: 535797
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 15
% 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: 3
% Max term depth in a unit clause: 2
% Number of states in UCFA table: 7
% Total number of terms of all unit clauses in table: 6
% 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.17
% Number of symbols (columns) in UCFA: 45
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 266070131
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 370538
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------