TSTP Solution File: COL105-2 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : COL105-2 : TPTP v5.0.0. Released v3.2.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art04.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 : Sat Nov 27 18:00:50 EST 2010
% Result : GaveUp 0.14s
% 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/SystemOnTPTP15748/COL/COL105-2+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 = 1] [nf = 0] [nu = 1] [ut = 0]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 2] [nf = 0] [nu = 2] [ut = 0]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 3] [nf = 0] [nu = 3] [ut = 0]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 4] [nf = 0] [nu = 4] [ut = 0]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 5] [nf = 0] [nu = 5] [ut = 0]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 6] [nf = 0] [nu = 6] [ut = 0]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 7] [nf = 0] [nu = 7] [ut = 0]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 8] [nf = 0] [nu = 8] [ut = 0]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 9] [nf = 0] [nu = 9] [ut = 0]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 10] [nf = 0] [nu = 10] [ut = 0]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 11] [nf = 0] [nu = 11] [ut = 0]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 12] [nf = 0] [nu = 12] [ut = 0]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 13] [nf = 0] [nu = 13] [ut = 0]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 14] [nf = 0] [nu = 14] [ut = 0]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 15] [nf = 0] [nu = 15] [ut = 0]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 16] [nf = 0] [nu = 16] [ut = 0]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 17] [nf = 0] [nu = 17] [ut = 0]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 18] [nf = 0] [nu = 18] [ut = 0]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 19] [nf = 0] [nu = 19] [ut = 0]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 20] [nf = 0] [nu = 20] [ut = 0]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 21] [nf = 0] [nu = 21] [ut = 0]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 22] [nf = 0] [nu = 22] [ut = 0]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 23] [nf = 0] [nu = 23] [ut = 0]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 24] [nf = 0] [nu = 24] [ut = 0]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 25] [nf = 0] [nu = 25] [ut = 0]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 26] [nf = 0] [nu = 26] [ut = 0]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 27] [nf = 0] [nu = 27] [ut = 0]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 28] [nf = 0] [nu = 28] [ut = 0]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 29] [nf = 0] [nu = 29] [ut = 0]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 30] [nf = 0] [nu = 30] [ut = 0]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 31] [nf = 0] [nu = 31] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 32] [nf = 0] [nu = 32] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 33] [nf = 0] [nu = 33] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 34] [nf = 0] [nu = 34] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 35] [nf = 0] [nu = 35] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 36] [nf = 0] [nu = 36] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 37] [nf = 0] [nu = 37] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 38] [nf = 0] [nu = 38] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 39] [nf = 0] [nu = 39] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 40] [nf = 0] [nu = 40] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 41] [nf = 0] [nu = 41] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 42] [nf = 0] [nu = 42] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 43] [nf = 0] [nu = 43] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 44] [nf = 0] [nu = 44] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 45] [nf = 0] [nu = 45] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 46] [nf = 0] [nu = 46] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 47] [nf = 0] [nu = 47] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 48] [nf = 0] [nu = 48] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 49] [nf = 0] [nu = 49] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 50] [nf = 0] [nu = 50] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 51] [nf = 0] [nu = 51] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 52] [nf = 0] [nu = 52] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 53] [nf = 0] [nu = 53] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 54] [nf = 0] [nu = 54] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 55] [nf = 0] [nu = 55] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 56] [nf = 0] [nu = 56] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 57] [nf = 0] [nu = 57] [ut = 1]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 58] [nf = 0] [nu = 58] [ut = 1]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 59] [nf = 0] [nu = 59] [ut = 1]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 60] [nf = 0] [nu = 60] [ut = 1]
% GIVE UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 60
% resolvents: 60 factors: 0
% Number of unit clauses generated: 60
% % unit clauses generated to total clauses generated: 100.00
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [1] = 1
% Total = 1
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 60
% Average size of a generated clause: 1.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] c_in_3 (+)0 (-)1
% ------------------
% Total: (+)0 (-)1
% Total number of unit clauses retained: 1
% Number of clauses skipped because of their length: 0
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 60
% Number of unification failures: 0
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 180
% N base clause resolution failure due to lookup table: 60
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 1
% N unit clauses dropped because they exceeded max values: 1
% 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: 9
% Max term depth in a unit clause: 2
% Number of states in UCFA table: 11
% Total number of terms of all unit clauses in table: 9
% 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.22
% Number of symbols (columns) in UCFA: 41
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 60
% ConstructUnitClause() = 2
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.14 secs
%
%------------------------------------------------------------------------------