TSTP Solution File: SYN736-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN736-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:32:48 EST 2010
% Result : GaveUp 47.49s
% 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/SystemOnTPTP13775/SYN/SYN736-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 = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 1 secs [nr = 0] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 2] [nf = 2] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 67] [nf = 24] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 1036] [nf = 126] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 7145] [nf = 356] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 1 secs [nr = 33486] [nf = 706] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 1 secs [nr = 59827] [nf = 1056] [nu = 0] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 86168] [nf = 1406] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 112509] [nf = 1756] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 138850] [nf = 2106] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 165191] [nf = 2456] [nu = 0] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 1 secs [nr = 191532] [nf = 2806] [nu = 0] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 1 secs [nr = 217873] [nf = 3156] [nu = 0] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 1 secs [nr = 244214] [nf = 3506] [nu = 0] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 1 secs [nr = 270555] [nf = 3856] [nu = 0] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 1 secs [nr = 296896] [nf = 4206] [nu = 0] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 1 secs [nr = 323237] [nf = 4556] [nu = 0] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 1 secs [nr = 349578] [nf = 4906] [nu = 0] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 1 secs [nr = 375919] [nf = 5256] [nu = 0] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 1 secs [nr = 402260] [nf = 5606] [nu = 0] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 1 secs [nr = 428601] [nf = 5956] [nu = 0] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 1 secs [nr = 454942] [nf = 6306] [nu = 0] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 1 secs [nr = 481283] [nf = 6656] [nu = 0] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 1 secs [nr = 507624] [nf = 7006] [nu = 0] [ut = 1]
% Looking for a proof at depth = 28 ...
% t = 2 secs [nr = 533965] [nf = 7356] [nu = 0] [ut = 1]
% Looking for a proof at depth = 29 ...
% t = 2 secs [nr = 560306] [nf = 7706] [nu = 0] [ut = 1]
% Looking for a proof at depth = 30 ...
% t = 2 secs [nr = 586647] [nf = 8056] [nu = 0] [ut = 1]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 2 secs [nr = 586647] [nf = 8056] [nu = 0] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 2 secs [nr = 586647] [nf = 8056] [nu = 0] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 2 secs [nr = 586647] [nf = 8056] [nu = 0] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 2 secs [nr = 586649] [nf = 8056] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 2 secs [nr = 586664] [nf = 8076] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 2 secs [nr = 586820] [nf = 8268] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 2 secs [nr = 588790] [nf = 8890] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 2 secs [nr = 601596] [nf = 10072] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 2 secs [nr = 658322] [nf = 11374] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 2 secs [nr = 715120] [nf = 13024] [nu = 0] [ut = 1]
% Looking for a proof
% at depth = 11 ...
% t = 2 secs [nr = 773890] [nf = 20974] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 2 secs [nr = 860500] [nf = 68760] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 3 secs [nr = 1080022] [nf = 268490] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 5 secs [nr = 1758832] [nf = 468220] [nu = 0] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 7 secs [nr = 2437642] [nf = 667950] [nu = 0] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 8 secs [nr = 3119572] [nf = 878720] [nu = 0] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 10 secs [nr = 3818062] [nf = 1097698] [nu = 0] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 12 secs [nr = 4581640] [nf = 1535268] [nu = 0] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 15 secs [nr = 5623426] [nf = 1972838] [nu = 0] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 18 secs [nr = 6665212] [nf = 2410408] [nu = 0] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 21 secs [nr = 7706998] [nf = 2847978] [nu = 0] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 24 secs [nr = 8748784] [nf = 3285548] [nu = 0] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 27 secs [nr = 9790570] [nf = 3723118] [nu = 0] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 31 secs [nr = 10832356] [nf = 4160688] [nu = 0] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 34 secs [nr = 11874142] [nf = 4598258] [nu = 0] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 37 secs [nr = 12915928] [nf = 5035828] [nu = 0] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 40 secs [nr = 13957714] [nf = 5473398] [nu = 0] [ut = 1]
% Looking for a proof at depth = 28 ...
% t = 43 secs [nr = 14999500] [nf = 5910968] [nu = 0] [ut = 1]
% Looking for a proof at depth = 29 ...
% t = 46 secs [nr = 16041286] [nf = 6348538] [nu = 0] [ut = 1]
% Looking for a proof at depth = 30 ...
% t = 49 secs [nr = 17083072] [nf = 6786108] [nu = 0] [ut = 1]
% GIVE UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 23869180
% resolvents: 17083072 factors: 6786108
% 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] = 563944 [5] = 1869484 [6] = 5363984 [7] = 7637076 [8] = 6791188 [9] = 1643504
% Average size of a generated clause: 7.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: 796386
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 23869180
% Number of unification failures: 14288930
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 20815020
% N base clause resolution failure due to lookup table: 903254
% 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() = 38158110
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 507855
% | |
% --------------------------------------------------------
% Elapsed time: 49 secs
% CPU time: 47.48 secs
%
%------------------------------------------------------------------------------