TSTP Solution File: PUZ028-3 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : PUZ028-3 : TPTP v5.0.0. Released v1.1.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art05.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 03:58:16 EST 2010
% Result : GaveUp 102.55s
% 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/SystemOnTPTP23656/PUZ/PUZ028-3+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 = 36]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 0] [nf = 72] [nu = 0] [ut = 36]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 102] [nf = 144] [nu = 0] [ut = 36]
% Looking for a proof at depth = 4 ...
% t = 1 secs [nr = 690] [nf = 228] [nu = 0] [ut = 36]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 15102] [nf = 600] [nu = 0] [ut = 36]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 35994] [nf = 972] [nu = 0] [ut = 36]
% Looking for a proof at depth = 7 ...
% t = 2 secs [nr = 295350] [nf = 3072] [nu = 0] [ut = 36]
% Looking for a proof at depth = 8 ...
% t = 7 secs [nr = 554706] [nf = 5172] [nu = 0] [ut = 36]
% Looking for a proof at depth = 9 ...
% t = 11 secs [nr = 814062] [nf = 7272] [nu = 0] [ut = 36]
% Looking for a proof at depth = 10 ...
% t = 15 secs [nr = 1073418] [nf = 9372] [nu = 0] [ut = 36]
% Looking for a proof at depth = 11 ...
% t = 20 secs [nr = 1332774] [nf = 11472] [nu = 0] [ut = 36]
% Looking for a proof at depth = 12 ...
% t = 24 secs [nr = 1592130] [nf = 13572] [nu = 0] [ut = 36]
% Looking for a proof at depth = 13 ...
% t = 29 secs [nr = 1851486] [nf = 15672] [nu = 0] [ut = 36]
% Looking for a proof at depth = 14 ...
% t = 33 secs [nr = 2110842] [nf = 17772] [nu = 0] [ut = 36]
% Looking for a proof at depth = 15 ...
% t = 38 secs [nr = 2370198] [nf = 19872] [nu = 0] [ut = 36]
% Looking for a proof at depth = 16 ...
% t = 42 secs [nr = 2629554] [nf = 21972] [nu = 0] [ut = 36]
% Looking for a proof at depth = 17 ...
% t = 46 secs [nr = 2888910] [nf = 24072] [nu = 0] [ut = 36]
% Looking for a proof at depth = 18 ...
% t = 51 secs [nr = 3148266] [nf = 26172] [nu = 0] [ut = 36]
% Looking for a proof at depth = 19 ...
% t = 56 secs [nr = 3407622] [nf = 28272] [nu = 0] [ut = 36]
% Looking for a proof at depth = 20 ...
% t = 60 secs [nr = 3666978] [nf = 30372] [nu = 0] [ut = 36]
% Looking for a proof at depth = 21 ...
% t = 64 secs [nr = 3926334] [nf = 32472] [nu = 0] [ut = 36]
% Looking for a proof at depth = 22 ...
% t = 69 secs [nr = 4185690] [nf = 34572] [nu = 0] [ut = 36]
% Looking for a proof at depth = 23 ...
% t = 73 secs [nr = 4445046] [nf = 36672] [nu = 0] [ut = 36]
% Looking for a proof at depth = 24 ...
% t = 78 secs [nr = 4704402] [nf = 38772] [nu = 0] [ut = 36]
% Looking for a proof at depth = 25 ...
% t = 82 secs [nr = 4963758] [nf = 40872] [nu = 0] [ut = 36]
% Looking for a proof at depth = 26 ...
% t = 87 secs [nr = 5223114] [nf = 42972] [nu = 0] [ut = 36]
% Looking for a proof at depth = 27 ...
% t = 91 secs [nr = 5482470] [nf = 45072] [nu = 0] [ut = 36]
% Looking for a proof at depth = 28 ...
% t = 96 secs [nr = 5741826] [nf = 47172] [nu = 0] [ut = 36]
% Looking for a proof at depth = 29 ...
% t = 100 secs [nr = 6001182] [nf = 49272] [nu = 0] [ut = 36]
% Looking for a proof at depth = 30 ...
% t = 104 secs [nr = 6260538] [nf = 51372] [nu = 0] [ut = 36]
% GIVE UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 6311910
% resolvents: 6260538 factors: 51372
% 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] = 36
% Total = 36
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [2] = 6948 [3] = 384948 [4] = 5920014
% Average size of a generated clause: 4.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] person_1 (+)6 (-)0
% [1] familiar_2 (+)0 (-)0
% [2] not_equal_2 (+)30 (-)0
% [3] not_familiar_2 (+)0 (-)0
% ------------------
% Total: (+)36 (-)0
% Total number of unit clauses retained: 36
% Number of clauses skipped because of their length: 7017150
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 6311910
% Number of unification failures: 0
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 55342266
% N base clause resolution failure due to lookup table: 318823584
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 0
% 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: 2
% Max term depth in a unit clause: 1
% Number of states in UCFA table: 10
% Total number of terms of all unit clauses in table: 66
% 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: 0.15
% Number of symbols (columns) in UCFA: 44
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 6311910
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 61881
% | |
% --------------------------------------------------------
% Elapsed time: 104 secs
% CPU time: 102.52 secs
%
%------------------------------------------------------------------------------