TSTP Solution File: SYN756-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN756-1 : TPTP v5.0.0. Released v2.5.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art09.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:38:38 EST 2010
% Result : GaveUp 0.26s
% 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/SystemOnTPTP14287/SYN/SYN756-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 = 11] [nf = 10] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 158] [nf = 104] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 680] [nf = 282] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 1202] [nf = 460] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 1724] [nf = 638] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 1 secs [nr = 2246] [nf = 816] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 1 secs [nr = 2768] [nf = 994] [nu = 0] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 3290] [nf = 1172] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 3812] [nf = 1350] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 4334] [nf = 1528] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 4856] [nf = 1706] [nu = 0] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 1 secs [nr = 5378] [nf = 1884] [nu = 0] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 1 secs [nr = 5900] [nf = 2062] [nu = 0] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 1 secs [nr = 6422] [nf = 2240] [nu = 0] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 1 secs [nr = 6944] [nf = 2418] [nu = 0] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 1 secs [nr = 7466] [nf = 2596] [nu = 0] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 1 secs [nr = 7988] [nf = 2774] [nu = 0] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 1 secs [nr = 8510] [nf = 2952] [nu = 0] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 1 secs [nr = 9032] [nf = 3130] [nu = 0] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 1 secs [nr = 9554] [nf = 3308] [nu = 0] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 1 secs [nr = 10076] [nf = 3486] [nu = 0] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 1 secs [nr = 10598] [nf = 3664] [nu = 0] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 1 secs [nr = 11120] [nf = 3842] [nu = 0] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 1 secs [nr = 11642] [nf = 4020] [nu = 0] [ut = 1]
% Looking for a proof at depth = 28 ...
% t = 1 secs [nr = 12164] [nf = 4198] [nu = 0] [ut = 1]
% Looking for a proof at depth = 29 ...
% t = 1 secs [nr = 12686] [nf = 4376] [nu = 0] [ut = 1]
% Looking for a proof at depth = 30 ...
% t = 1 secs [nr = 13208] [nf = 4554] [nu = 0] [ut = 1]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 1 secs [nr = 13208] [nf = 4554] [nu = 0] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 13208] [nf = 4554] [nu = 0] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 13219] [nf = 4554] [nu = 0] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 1 secs [nr = 13293] [nf = 4596] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 13594] [nf = 4812] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 14516] [nf = 5112] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 15438] [nf = 5412] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 16360] [nf = 5712] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 1 secs [nr = 17282] [nf = 6012] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 1 secs [nr = 18204] [nf = 6312] [nu = 0] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 19126] [nf = 6612] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 20048] [nf = 6912] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 20970] [nf = 7212] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 21892] [nf = 7512] [nu = 0] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 1 secs [nr = 22814] [nf = 7812] [nu = 0] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 1 secs [nr = 23736] [nf = 8112] [nu = 0] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 1 secs [nr = 24658] [nf = 8412] [nu = 0] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 1 secs [nr = 25580] [nf = 8712] [nu = 0] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 1 secs [nr = 26502] [nf = 9012] [nu = 0] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 1 secs [nr = 27424] [nf = 9312] [nu = 0] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 1 secs [nr = 28346] [nf = 9612] [nu = 0] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 1 secs [nr = 29268] [nf = 9912] [nu = 0] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 1 secs [nr = 30190] [nf = 10212] [nu = 0] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 1 secs [nr = 31112] [nf = 10512] [nu = 0] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 1 secs [nr = 32034] [nf = 10812] [nu = 0] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 1 secs [nr = 32956] [nf = 11112] [nu = 0] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 1 secs [nr = 33878] [nf = 11412] [nu = 0] [ut = 1]
% Looking for a proof at depth = 28 ...
% t = 1 secs [nr = 34800] [nf = 11712] [nu = 0] [ut = 1]
% Looking for a proof at depth = 29 ...
% t = 1 secs [nr = 35722] [nf = 12012] [nu = 0] [ut = 1]
% Looking for a proof at depth = 30 ...
% t = 1 secs [nr = 36644] [nf = 12312] [nu = 0] [ut = 1]
% GIVE UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 48956
% resolvents: 36644 factors: 12312
% 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] = 20626 [5] = 21166 [6] = 7164
% 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] ssRr_2 (+)1 (-)0
% ------------------
% Total: (+)1 (-)0
% Total number of unit clauses retained: 1
% Number of clauses skipped because of their length: 376
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 48956
% Number of unification failures: 8100
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 5392
% 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: 40
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 57056
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 1 secs
% CPU time: 0.27 secs
%
%------------------------------------------------------------------------------