TSTP Solution File: SYN737-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN737-1 : TPTP v5.0.0. Released v2.5.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art03.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 11:33:00 EST 2010
% Result : Timeout 300.05s
% 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/SystemOnTPTP12176/SYN/SYN737-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 = 6] [nf = 4] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 100] [nf = 36] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 1490] [nf = 188] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 7247] [nf = 448] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 19234] [nf = 740] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 31221] [nf = 1032] [nu = 0] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 43208] [nf = 1324] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 55195] [nf = 1616] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 67182] [nf = 1908] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 79169] [nf = 2200] [nu = 0] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 91156] [nf = 2492] [nu = 0] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 103143] [nf = 2784] [nu = 0] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 115130] [nf = 3076] [nu = 0] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 127117] [nf = 3368] [nu = 0] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 139104] [nf = 3660] [nu = 0] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 151091] [nf = 3952] [nu = 0] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 163078] [nf = 4244] [nu = 0] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 175065] [nf = 4536] [nu = 0] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 187052] [nf = 4828] [nu = 0] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 199039] [nf = 5120] [nu = 0] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 211026] [nf = 5412] [nu = 0] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 223013] [nf = 5704] [nu = 0] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 235000] [nf = 5996] [nu = 0] [ut = 1]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 246987] [nf = 6288] [nu = 0] [ut = 1]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 258974] [nf = 6580] [nu = 0] [ut = 1]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 270961] [nf = 6872] [nu = 0] [ut = 1]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 270961] [nf = 6872] [nu = 0] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 270961] [nf = 6872] [nu = 0] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 270961] [nf = 6872] [nu = 0] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 270963] [nf = 6876] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 270985] [nf = 6912] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 271203] [nf = 7204] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 274022] [nf = 7914] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 286018] [nf = 8852] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 311326] [nf = 9822] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 336788] [nf = 11940] [nu = 0] [ut = 1]
% Looking for a proof at d
% epth = 11 ...
% t = 1 secs [nr = 376901] [nf = 44237] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 2 secs [nr = 1099702] [nf = 191387] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 24 secs [nr = 11703888] [nf = 830444] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 152082028
% resolvents: 150395129 factors: 1686899
% 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] = 137100 [5] = 4904370 [6] = 44168301 [7] = 53481853 [8] = 31859993 [9] = 12284548
% [10] = 3822148 [11] = 913074 [12] = 453367 [13] = 51680 [14] = 5491 [15] = 103
% 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: 1897745266
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 152082028
% Number of unification failures: 77369783
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 2597716
% N base clause resolution failure due to lookup table: 18846
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 17
% 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() = 229451811
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 506940
% | |
% --------------------------------------------------------
% Elapsed time: 302 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------