TSTP Solution File: SYN735-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN735-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:32:42 EST 2010
% Result : GaveUp 0.18s
% 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/SystemOnTPTP13585/SYN/SYN735-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 = 2] [nf = 4] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 50] [nf = 34] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 322] [nf = 114] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 594] [nf = 194] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 866] [nf = 274] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 1138] [nf = 354] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 1410] [nf = 434] [nu = 0] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 1682] [nf = 514] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 1954] [nf = 594] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 2226] [nf = 674] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 2498] [nf = 754] [nu = 0] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 2770] [nf = 834] [nu = 0] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 3042] [nf = 914] [nu = 0] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 3314] [nf = 994] [nu = 0] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 3586] [nf = 1074] [nu = 0] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 3858] [nf = 1154] [nu = 0] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 4130] [nf = 1234] [nu = 0] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 4402] [nf = 1314] [nu = 0] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 4674] [nf = 1394] [nu = 0] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 4946] [nf = 1474] [nu = 0] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 5218] [nf = 1554] [nu = 0] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 5490] [nf = 1634] [nu = 0] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 5762] [nf = 1714] [nu = 0] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 6034] [nf = 1794] [nu = 0] [ut = 1]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 6306] [nf = 1874] [nu = 0] [ut = 1]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 6578] [nf = 1954] [nu = 0] [ut = 1]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 6850] [nf = 2034] [nu = 0] [ut = 1]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 6850] [nf = 2034] [nu = 0] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 6850] [nf = 2034] [nu = 0] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 6852] [nf = 2034] [nu = 0] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 6876] [nf = 2044] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 6990] [nf = 2132] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 7476] [nf = 2270] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 7962] [nf = 2408] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 8448] [nf = 2546] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 8934] [nf = 2684] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 9420] [nf = 2822] [nu = 0] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 9906] [nf = 2960] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 10392] [nf = 3098] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 10878] [nf = 3236] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 11364] [nf = 3374] [nu = 0] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 11850] [nf = 3512] [nu = 0] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 12336] [nf = 3650] [nu = 0] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 12822] [nf = 3788] [nu = 0] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 13308] [nf = 3926] [nu = 0] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 13794] [nf = 4064] [nu = 0] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 14280] [nf = 4202] [nu = 0] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 14766] [nf = 4340] [nu = 0] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 15252] [nf = 4478] [nu = 0] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 15738] [nf = 4616] [nu = 0] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 16224] [nf = 4754] [nu = 0] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 16710] [nf = 4892] [nu = 0] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 17196] [nf = 5030] [nu = 0] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 17682] [nf = 5168] [nu = 0] [ut = 1]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 18168] [nf = 5306] [nu = 0] [ut = 1]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 18654] [nf = 5444] [nu = 0] [ut = 1]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 19140] [nf = 5582] [nu = 0] [ut = 1]
% GIVE UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 24722
% resolvents: 19140 factors: 5582
% 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] = 9914 [5] = 10484 [6] = 4324
% 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: 170
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 24722
% Number of unification failures: 2022
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 2136
% 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() = 26744
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.18 secs
%
%------------------------------------------------------------------------------