TSTP Solution File: SYN742-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN742-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:35:27 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/SystemOnTPTP10437/SYN/SYN742-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 = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 12] [nf = 8] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 168] [nf = 70] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 1462] [nf = 248] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 7368] [nf = 550] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 39736] [nf = 1004] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 72104] [nf = 1458] [nu = 0] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 104472] [nf = 1912] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 136840] [nf = 2366] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 169208] [nf = 2820] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 201576] [nf = 3274] [nu = 0] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 1 secs [nr = 233944] [nf = 3728] [nu = 0] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 1 secs [nr = 266312] [nf = 4182] [nu = 0] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 1 secs [nr = 298680] [nf = 4636] [nu = 0] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 1 secs [nr = 331048] [nf = 5090] [nu = 0] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 1 secs [nr = 363416] [nf = 5544] [nu = 0] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 1 secs [nr = 395784] [nf = 5998] [nu = 0] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 1 secs [nr = 428152] [nf = 6452] [nu = 0] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 1 secs [nr = 460520] [nf = 6906] [nu = 0] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 1 secs [nr = 492888] [nf = 7360] [nu = 0] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 1 secs [nr = 525256] [nf = 7814] [nu = 0] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 1 secs [nr = 557624] [nf = 8268] [nu = 0] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 1 secs [nr = 589992] [nf = 8722] [nu = 0] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 1 secs [nr = 622360] [nf = 9176] [nu = 0] [ut = 1]
% Looking for a proof at depth = 28 ...
% t = 1 secs [nr = 654728] [nf = 9630] [nu = 0] [ut = 1]
% Looking for a proof at depth = 29 ...
% t = 1 secs [nr = 687096] [nf = 10084] [nu = 0] [ut = 1]
% Looking for a proof at depth = 30 ...
% t = 1 secs [nr = 719464] [nf = 10538] [nu = 0] [ut = 1]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 1 secs [nr = 719464] [nf = 10538] [nu = 0] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 719464] [nf = 10538] [nu = 0] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 719464] [nf = 10538] [nu = 0] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 1 secs [nr = 719468] [nf = 10546] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 719512] [nf = 10606] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 719860] [nf = 10928] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 722508] [nf = 11696] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 734962] [nf = 13140] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 2 secs [nr = 804682] [nf = 14994] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 2 secs [nr = 876074] [nf = 20214] [nu = 0] [ut =
% 1]
% Looking for a proof at depth = 11 ...
% t = 2 secs [nr = 961944] [nf = 48828] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 2 secs [nr = 1134510] [nf = 153082] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 4 secs [nr = 1648684] [nf = 813200] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 9 secs [nr = 3340709] [nf = 1221709] [nu = 0] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 17 secs [nr = 6042939] [nf = 1881827] [nu = 0] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 25 secs [nr = 8750425] [nf = 2545017] [nu = 0] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 32 secs [nr = 11482127] [nf = 3223087] [nu = 0] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 41 secs [nr = 14403981] [nf = 4017125] [nu = 0] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 51 secs [nr = 17736379] [nf = 5063883] [nu = 0] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 100 secs [nr = 31058057] [nf = 12215377] [nu = 0] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 149 secs [nr = 44379735] [nf = 19366871] [nu = 0] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 198 secs [nr = 57701413] [nf = 26518365] [nu = 0] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 246 secs [nr = 71023091] [nf = 33669859] [nu = 0] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 295 secs [nr = 84344769] [nf = 40821353] [nu = 0] [ut = 1]
% Looking for a proof at depth = 25 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 128957634
% resolvents: 86867940 factors: 42089694
% 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:
% ------------------------------------------------
% [4] = 565920 [5] = 4110842 [6] = 22403181 [7] = 51129600 [8] = 42094528 [9] = 8653563
% 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] ssRr_2 (+)1 (-)0
% ------------------
% Total: (+)1 (-)0
% Total number of unit clauses retained: 1
% Number of clauses skipped because of their length: 3124477
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 1272046
% Number of successful unifications: 128957634
% Number of unification failures: 75668324
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 76055490
% N base clause resolution failure due to lookup table: 1878787
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 22
% 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: 5
% Total number of terms of all unit clauses in table: 3
% 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.67
% Number of symbols (columns) in UCFA: 40
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 204625958
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 429859
% | |
% --------------------------------------------------------
% Elapsed time: 305 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------