TSTP Solution File: SYN067-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN067-1 : TPTP v5.0.0. Released v1.0.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art01.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 08:27:59 EST 2010
% Result : Timeout 300.00s
% 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/SystemOnTPTP12708/SYN/SYN067-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 = 0]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 0] [nf = 10] [nu = 0] [ut = 0]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 0] [nf = 20] [nu = 0] [ut = 0]
% Looking for a proof at depth = 4 ...
% t = 1 secs [nr = 0] [nf = 66] [nu = 0] [ut = 0]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 0] [nf = 174] [nu = 0] [ut = 0]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 0] [nf = 480] [nu = 0] [ut = 0]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 0] [nf = 948] [nu = 0] [ut = 0]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 0] [nf = 1448] [nu = 0] [ut = 0]
% Looking for a proof at depth = 9 ...
% t = 1 secs [nr = 0] [nf = 1948] [nu = 0] [ut = 0]
% Looking for a proof at depth = 10 ...
% t = 1 secs [nr = 0] [nf = 2448] [nu = 0] [ut = 0]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 0] [nf = 2948] [nu = 0] [ut = 0]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 0] [nf = 3448] [nu = 0] [ut = 0]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 0] [nf = 3948] [nu = 0] [ut = 0]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 0] [nf = 4448] [nu = 0] [ut = 0]
% Looking for a proof at depth = 15 ...
% t = 1 secs [nr = 0] [nf = 4948] [nu = 0] [ut = 0]
% Looking for a proof at depth = 16 ...
% t = 1 secs [nr = 0] [nf = 5448] [nu = 0] [ut = 0]
% Looking for a proof at depth = 17 ...
% t = 1 secs [nr = 0] [nf = 5948] [nu = 0] [ut = 0]
% Looking for a proof at depth = 18 ...
% t = 1 secs [nr = 0] [nf = 6448] [nu = 0] [ut = 0]
% Looking for a proof at depth = 19 ...
% t = 1 secs [nr = 0] [nf = 6948] [nu = 0] [ut = 0]
% Looking for a proof at depth = 20 ...
% t = 1 secs [nr = 0] [nf = 7448] [nu = 0] [ut = 0]
% Looking for a proof at depth = 21 ...
% t = 1 secs [nr = 0] [nf = 7948] [nu = 0] [ut = 0]
% Looking for a proof at depth = 22 ...
% t = 1 secs [nr = 0] [nf = 8448] [nu = 0] [ut = 0]
% Looking for a proof at depth = 23 ...
% t = 1 secs [nr = 0] [nf = 8948] [nu = 0] [ut = 0]
% Looking for a proof at depth = 24 ...
% t = 1 secs [nr = 0] [nf = 9448] [nu = 0] [ut = 0]
% Looking for a proof at depth = 25 ...
% t = 1 secs [nr = 0] [nf = 9948] [nu = 0] [ut = 0]
% Looking for a proof at depth = 26 ...
% t = 1 secs [nr = 0] [nf = 10448] [nu = 0] [ut = 0]
% Looking for a proof at depth = 27 ...
% t = 1 secs [nr = 0] [nf = 10948] [nu = 0] [ut = 0]
% Looking for a proof at depth = 28 ...
% t = 1 secs [nr = 0] [nf = 11448] [nu = 0] [ut = 0]
% Looking for a proof at depth = 29 ...
% t = 1 secs [nr = 0] [nf = 11948] [nu = 0] [ut = 0]
% Looking for a proof at depth = 30 ...
% t = 1 secs [nr = 0] [nf = 12448] [nu = 0] [ut = 0]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 1 secs [nr = 0] [nf = 12448] [nu = 0] [ut = 0]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 0] [nf = 12458] [nu = 0] [ut = 0]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 0] [nf = 12468] [nu = 0] [ut = 0]
% Looking for a proof at depth = 4 ...
% t = 1 secs [nr = 0] [nf = 12514] [nu = 0] [ut = 0]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 277] [nf = 13155] [nu = 0] [ut = 0]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 1968] [nf = 15493] [nu = 0] [ut = 0]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 13097] [nf = 39132] [nu = 0] [ut = 0]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 63898] [nf = 115494] [nu = 0] [ut = 0]
% Looking for a proof at depth = 9 ...
% t = 3 secs [nr = 452400] [nf = 973745] [nu = 0] [ut = 0]
% Looking for a proof at depth = 10 ...
% t = 6 secs [nr = 1054992] [nf = 1963874] [nu = 0] [ut = 0]
% Looking for a proof at depth = 11 ...
% t = 16 secs [nr = 2554666] [nf =
% 4723127] [nu = 0] [ut = 0]
% Looking for a proof at depth = 12 ...
% t = 64 secs [nr = 6590415] [nf = 15468574] [nu = 0] [ut = 0]
% Looking for a proof at depth = 13 ...
% t = 126 secs [nr = 12523653] [nf = 28633020] [nu = 0] [ut = 0]
% Looking for a proof at depth = 14 ...
% t = 234 secs [nr = 22542224] [nf = 51161401] [nu = 0] [ut = 0]
% Looking for a proof at depth = 15 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 93540922
% resolvents: 26461190 factors: 67079732
% 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]:
% =============================================================
% Total = 0
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [2] = 428 [4] = 13656 [5] = 57782 [6] = 4344931 [7] = 64542191 [8] = 24581934
% Average size of a generated clause: 8.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] big_p_1 (+)0 (-)0
% [1] big_r_2 (+)0 (-)0
% ------------------
% Total: (+)0 (-)0
% Total number of unit clauses retained: 0
% Number of clauses skipped because of their length: 88329254
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 312127394
% Number of successful unifications: 93540922
% Number of unification failures: 45827379
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 547604531
% N base clause resolution failure due to lookup table: 87165732
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 4
% 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: 0
% Max term depth in a unit clause: 0
% Number of states in UCFA table: 0
% Total number of terms of all unit clauses in table: 0
% 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: nan
% Number of symbols (columns) in UCFA: 47
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 139368301
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 311803
% | |
% --------------------------------------------------------
% Elapsed time: 305 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------