TSTP Solution File: SYN743-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN743-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:33:54 EST 2010
% Result : GaveUp 0.20s
% 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/SystemOnTPTP13997/SYN/SYN743-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 = 8] [nf = 2] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 80] [nf = 40] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 384] [nf = 130] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 688] [nf = 220] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 992] [nf = 310] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 1296] [nf = 400] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 1600] [nf = 490] [nu = 0] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 1904] [nf = 580] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 2208] [nf = 670] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 2512] [nf = 760] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 2816] [nf = 850] [nu = 0] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 3120] [nf = 940] [nu = 0] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 3424] [nf = 1030] [nu = 0] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 3728] [nf = 1120] [nu = 0] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 4032] [nf = 1210] [nu = 0] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 4336] [nf = 1300] [nu = 0] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 4640] [nf = 1390] [nu = 0] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 4944] [nf = 1480] [nu = 0] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 5248] [nf = 1570] [nu = 0] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 5552] [nf = 1660] [nu = 0] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 5856] [nf = 1750] [nu = 0] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 6160] [nf = 1840] [nu = 0] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 6464] [nf = 1930] [nu = 0] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 6768] [nf = 2020] [nu = 0] [ut = 1]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 7072] [nf = 2110] [nu = 0] [ut = 1]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 7376] [nf = 2200] [nu = 0] [ut = 1]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 7680] [nf = 2290] [nu = 0] [ut = 1]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 7680] [nf = 2290] [nu = 0] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 7680] [nf = 2290] [nu = 0] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 7688] [nf = 2290] [nu = 0] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 7732] [nf = 2300] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 7892] [nf = 2402] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 8436] [nf = 2556] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 8980] [nf = 2710] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 9524] [nf = 2864] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 10068] [nf = 3018] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 10612] [nf = 3172] [nu = 0] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 11156] [nf = 3326] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 11700] [nf = 3480] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 12244] [nf = 3634] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 12788] [nf = 3788] [nu = 0] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 13332] [nf = 3942] [nu = 0] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 13876] [nf = 4096] [nu = 0] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 14420] [nf = 4250] [nu = 0] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 14964] [nf = 4404] [nu = 0] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 15508] [nf = 4558] [nu = 0] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 16052] [nf = 4712] [nu = 0] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 16596] [nf = 4866] [nu = 0] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 17140] [nf = 5020] [nu = 0] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 17684] [nf = 5174] [nu = 0] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 18228] [nf = 5328] [nu = 0] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 18772] [nf = 5482] [nu = 0] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 19316] [nf = 5636] [nu = 0] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 19860] [nf = 5790] [nu = 0] [ut = 1]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 20404] [nf = 5944] [nu = 0] [ut = 1]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 20948] [nf = 6098] [nu = 0] [ut = 1]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 21492] [nf = 6252] [nu = 0] [ut = 1]
% GIVE UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 27744
% resolvents: 21492 factors: 6252
% 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] = 11380 [5] = 11940 [6] = 4424
% 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: 214
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 27744
% Number of unification failures: 2924
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 3240
% 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() = 30668
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.19 secs
%
%------------------------------------------------------------------------------