TSTP Solution File: SYN744-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN744-1 : TPTP v5.0.0. Released v2.5.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art02.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:34:00 EST 2010
% Result : GaveUp 0.21s
% 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/SystemOnTPTP14111/SYN/SYN744-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 = 6] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 74] [nf = 38] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 490] [nf = 154] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 906] [nf = 270] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 1322] [nf = 386] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 1738] [nf = 502] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 2154] [nf = 618] [nu = 0] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 2570] [nf = 734] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 2986] [nf = 850] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 3402] [nf = 966] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 3818] [nf = 1082] [nu = 0] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 4234] [nf = 1198] [nu = 0] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 4650] [nf = 1314] [nu = 0] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 5066] [nf = 1430] [nu = 0] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 5482] [nf = 1546] [nu = 0] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 5898] [nf = 1662] [nu = 0] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 6314] [nf = 1778] [nu = 0] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 6730] [nf = 1894] [nu = 0] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 7146] [nf = 2010] [nu = 0] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 7562] [nf = 2126] [nu = 0] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 7978] [nf = 2242] [nu = 0] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 8394] [nf = 2358] [nu = 0] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 8810] [nf = 2474] [nu = 0] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 9226] [nf = 2590] [nu = 0] [ut = 1]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 9642] [nf = 2706] [nu = 0] [ut = 1]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 10058] [nf = 2822] [nu = 0] [ut = 1]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 10474] [nf = 2938] [nu = 0] [ut = 1]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 10474] [nf = 2938] [nu = 0] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 10474] [nf = 2938] [nu = 0] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 10480] [nf = 2938] [nu = 0] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 10516] [nf = 2952] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 10674] [nf = 3088] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 11408] [nf = 3302] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 12142] [nf = 3516] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 12876] [nf = 3730] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 13610] [nf = 3944] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 14344] [nf = 4158] [nu = 0] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 15078] [nf = 4372] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 15812] [nf = 4586] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 16546] [nf = 4800] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 17280] [nf = 5014] [nu = 0] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 18014] [nf = 5228] [nu = 0] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 18748] [nf = 5442] [nu = 0] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 19482] [nf = 5656] [nu = 0] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 20216] [nf = 5870] [nu = 0] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 20950] [nf = 6084] [nu = 0] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 21684] [nf = 6298] [nu = 0] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 22418] [nf = 6512] [nu = 0] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 23152] [nf = 6726] [nu = 0] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 23886] [nf = 6940] [nu = 0] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 24620] [nf = 7154] [nu = 0] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 25354] [nf = 7368] [nu = 0] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 26088] [nf = 7582] [nu = 0] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 26822] [nf = 7796] [nu = 0] [ut = 1]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 27556] [nf = 8010] [nu = 0] [ut = 1]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 28290] [nf = 8224] [nu = 0] [ut = 1]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 29024] [nf = 8438] [nu = 0] [ut = 1]
% GIVE UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 37462
% resolvents: 29024 factors: 8438
% 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] = 15170 [5] = 15656 [6] = 6636
% Average size of a generated clause: 5.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 (+)1 (-)0
% ------------------
% Total: (+)1 (-)0
% Total number of unit clauses retained: 1
% Number of clauses skipped because of their length: 260
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 37462
% Number of unification failures: 4454
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 3216
% N base clause resolution failure due to lookup table: 0
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 6
% 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: 44
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 41916
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.21 secs
%
%------------------------------------------------------------------------------