TSTP Solution File: PLA029-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : PLA029-1 : TPTP v5.0.0. Released v2.5.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art06.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:47:59 EST 2010
% Result : Timeout 300.02s
% 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/SystemOnTPTP18812/PLA/PLA029-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 = 2] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 13] [nf = 2] [nu = 0] [ut = 0]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 57] [nf = 14] [nu = 0] [ut = 0]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 170] [nf = 26] [nu = 0] [ut = 0]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 451] [nf = 96] [nu = 0] [ut = 0]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 1052] [nf = 170] [nu = 0] [ut = 0]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 2447] [nf = 524] [nu = 0] [ut = 0]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 5376] [nf = 918] [nu = 0] [ut = 0]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 11727] [nf = 2448] [nu = 0] [ut = 0]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 24540] [nf = 4106] [nu = 0] [ut = 0]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 50775] [nf = 9804] [nu = 0] [ut = 0]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 101888] [nf = 15934] [nu = 0] [ut = 0]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 202063] [nf = 35760] [nu = 0] [ut = 0]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 392964] [nf = 57058] [nu = 0] [ut = 0]
% Looking for a proof at depth = 15 ...
% t = 3 secs [nr = 756767] [nf = 124228] [nu = 0] [ut = 0]
% Looking for a proof at depth = 16 ...
% t = 5 secs [nr = 1441376] [nf = 196422] [nu = 0] [ut = 0]
% Looking for a proof at depth = 17 ...
% t = 8 secs [nr = 2724375] [nf = 422280] [nu = 0] [ut = 0]
% Looking for a proof at depth = 18 ...
% t = 15 secs [nr = 5122628] [nf = 665290] [nu = 0] [ut = 0]
% Looking for a proof at depth = 19 ...
% t = 28 secs [nr = 9574055] [nf = 1425068] [nu = 0] [ut = 0]
% Looking for a proof at depth = 20 ...
% t = 53 secs [nr = 17867200] [nf = 2243406] [nu = 0] [ut = 0]
% Looking for a proof at depth = 21 ...
% t = 98 secs [nr = 33180143] [nf = 4809200] [nu = 0] [ut = 0]
% Looking for a proof at depth = 22 ...
% Entering time slice 2
% Updating parameters ... done.
% Looking for a proof at depth = 1 ...
% t = 123 secs [nr = 42034739] [nf = 5694458] [nu = 0] [ut = 0]
% Looking for a proof at depth = 2 ...
% t = 123 secs [nr = 42034750] [nf = 5694460] [nu = 0] [ut = 0]
% Looking for a proof at depth = 3 ...
% t = 123 secs [nr = 42034809] [nf = 5694484] [nu = 0] [ut = 0]
% Looking for a proof at depth = 4 ...
% t = 123 secs [nr = 42035006] [nf = 5694516] [nu = 0] [ut = 0]
% Looking for a proof at depth = 5 ...
% t = 123 secs [nr = 42035813] [nf = 5695070] [nu = 0] [ut = 0]
% Looking for a proof at depth = 6 ...
% t = 123 secs [nr = 42039411] [nf = 5696244] [nu = 0] [ut = 0]
% Looking for a proof at depth = 7 ...
% t = 123 secs [nr = 42055452] [nf = 5712002] [nu = 0] [ut = 0]
% Looking for a proof at depth = 8 ...
% t = 123 secs [nr = 42148988] [nf = 5758651] [nu = 0] [ut = 0]
% Looking for a proof at depth = 9 ...
% t = 126 secs [nr = 42660173] [nf = 6314872] [nu = 0] [ut = 0]
% Looking for a proof at depth = 10 ...
% t = 138 secs [nr = 46240551] [nf = 8543994] [nu = 0] [ut = 0]
% Looking for a proof at depth = 11 ...
% t = 232 secs [nr = 69042331] [nf = 33645674] [nu = 0] [ut = 0]
% Looking for a proof at depth = 12 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 133422253
% resolvents: 87390719 factors: 46031534
% 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] = 13518055 [3] = 46108352 [4] = 29212829 [5] = 30192287 [6] = 12766038 [7] = 1624692
% Average size of a generated clause: 4.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] differ_2 (+)0 (-)0
% [1] holds_2 (+)0 (-)0
% ------------------
% Total: (+)0 (-)0
% Total number of unit clauses retained: 0
% Number of clauses skipped because of their length: 153646895
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 7853723
% Number of successful unifications: 133422253
% Number of unification failures: 123595923
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 268218492
% N base clause resolution failure due to lookup table: 9662038
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 83
% 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: 112000
% Ratio n states used/total allowed states: 0.00
% Ratio n states used/total unit clauses terms: nan
% Number of symbols (columns) in UCFA: 45
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 257018176
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 444741
% | |
% --------------------------------------------------------
% Elapsed time: 305 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------