TSTP Solution File: LAT273-2 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : LAT273-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 23:12:12 EST 2010
% Result : GaveUp 11.91s
% 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/SystemOnTPTP24739/LAT/LAT273-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 = 1 secs [nr = 3] [nf = 0] [nu = 0] [ut = 4]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 14] [nf = 0] [nu = 2] [ut = 5]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 44] [nf = 0] [nu = 11] [ut = 6]
% Looking for a proof at depth = 4 ...
% t = 1 secs [nr = 83] [nf = 0] [nu = 20] [ut = 6]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 148] [nf = 0] [nu = 41] [ut = 7]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 227] [nf = 0] [nu = 62] [ut = 7]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 318] [nf = 0] [nu = 83] [ut = 7]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 421] [nf = 0] [nu = 104] [ut = 7]
% Looking for a proof at depth = 9 ...
% t = 1 secs [nr = 524] [nf = 0] [nu = 125] [ut = 7]
% Looking for a proof at depth = 10 ...
% t = 1 secs [nr = 627] [nf = 0] [nu = 146] [ut = 7]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 730] [nf = 0] [nu = 167] [ut = 7]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 833] [nf = 0] [nu = 188] [ut = 7]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 936] [nf = 0] [nu = 209] [ut = 7]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 1039] [nf = 0] [nu = 230] [ut = 7]
% Looking for a proof at depth = 15 ...
% t = 1 secs [nr = 1142] [nf = 0] [nu = 251] [ut = 7]
% Looking for a proof at depth = 16 ...
% t = 1 secs [nr = 1245] [nf = 0] [nu = 272] [ut = 7]
% Looking for a proof at depth = 17 ...
% t = 1 secs [nr = 1348] [nf = 0] [nu = 293] [ut = 7]
% Looking for a proof at depth = 18 ...
% t = 1 secs [nr = 1451] [nf = 0] [nu = 314] [ut = 7]
% Looking for a proof at depth = 19 ...
% t = 1 secs [nr = 1554] [nf = 0] [nu = 335] [ut = 7]
% Looking for a proof at depth = 20 ...
% t = 1 secs [nr = 1657] [nf = 0] [nu = 356] [ut = 7]
% Looking for a proof at depth = 21 ...
% t = 1 secs [nr = 1760] [nf = 0] [nu = 377] [ut = 7]
% Looking for a proof at depth = 22 ...
% t = 1 secs [nr = 1863] [nf = 0] [nu = 398] [ut = 7]
% Looking for a proof at depth = 23 ...
% t = 1 secs [nr = 1966] [nf = 0] [nu = 419] [ut = 7]
% Looking for a proof at depth = 24 ...
% t = 1 secs [nr = 2069] [nf = 0] [nu = 440] [ut = 7]
% Looking for a proof at depth = 25 ...
% t = 1 secs [nr = 2172] [nf = 0] [nu = 461] [ut = 7]
% Looking for a proof at depth = 26 ...
% t = 1 secs [nr = 2275] [nf = 0] [nu = 482] [ut = 7]
% Looking for a proof at depth = 27 ...
% t = 1 secs [nr = 2378] [nf = 0] [nu = 503] [ut = 7]
% Looking for a proof at depth = 28 ...
% t = 1 secs [nr = 2481] [nf = 0] [nu = 524] [ut = 7]
% Looking for a proof at depth = 29 ...
% t = 1 secs [nr = 2584] [nf = 0] [nu = 545] [ut = 7]
% Looking for a proof at depth = 30 ...
% t = 1 secs [nr = 2687] [nf = 0] [nu = 566] [ut = 7]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 1 secs [nr = 2690] [nf = 0] [nu = 566] [ut = 7]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 2704] [nf = 0] [nu = 569] [ut = 7]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 2737] [nf = 0] [nu = 578] [ut = 7]
% Looking for a proof at depth = 4 ...
% t = 1 secs [nr = 2798] [nf = 2] [nu = 587] [ut = 7]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 3025] [nf = 8] [nu = 650] [ut = 7]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 3464] [nf = 14] [nu = 713] [ut = 7]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 4479] [nf = 55] [nu = 776] [ut = 7]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 6591] [nf = 349] [nu = 839] [ut = 7]
% Looking for a proof at depth = 9 ...
% t = 1 secs [nr = 10673] [nf = 703] [nu = 902] [ut = 7]
% Looking for a proof at depth = 10 ...
% t = 1 secs [nr = 18768] [nf = 1486] [nu = 965] [ut = 7]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 31592] [nf = 3641] [nu = 1028] [ut = 7]
% Looking for a proof
% at depth = 12 ...
% t = 1 secs [nr = 53923] [nf = 9125] [nu = 1091] [ut = 7]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 86482] [nf = 16171] [nu = 1154] [ut = 7]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 135700] [nf = 25281] [nu = 1217] [ut = 7]
% Looking for a proof at depth = 15 ...
% t = 2 secs [nr = 195198] [nf = 38513] [nu = 1280] [ut = 7]
% Looking for a proof at depth = 16 ...
% t = 2 secs [nr = 267368] [nf = 58081] [nu = 1343] [ut = 7]
% Looking for a proof at depth = 17 ...
% t = 3 secs [nr = 347782] [nf = 77649] [nu = 1406] [ut = 7]
% Looking for a proof at depth = 18 ...
% t = 3 secs [nr = 440868] [nf = 97217] [nu = 1469] [ut = 7]
% Looking for a proof at depth = 19 ...
% t = 4 secs [nr = 533954] [nf = 116785] [nu = 1532] [ut = 7]
% Looking for a proof at depth = 20 ...
% t = 5 secs [nr = 627040] [nf = 136353] [nu = 1595] [ut = 7]
% Looking for a proof at depth = 21 ...
% t = 6 secs [nr = 720126] [nf = 155921] [nu = 1658] [ut = 7]
% Looking for a proof at depth = 22 ...
% t = 6 secs [nr = 813212] [nf = 175489] [nu = 1721] [ut = 7]
% Looking for a proof at depth = 23 ...
% t = 7 secs [nr = 906298] [nf = 195057] [nu = 1784] [ut = 7]
% Looking for a proof at depth = 24 ...
% t = 8 secs [nr = 999384] [nf = 214625] [nu = 1847] [ut = 7]
% Looking for a proof at depth = 25 ...
% t = 9 secs [nr = 1092470] [nf = 234193] [nu = 1910] [ut = 7]
% Looking for a proof at depth = 26 ...
% t = 9 secs [nr = 1185556] [nf = 253761] [nu = 1973] [ut = 7]
% Looking for a proof at depth = 27 ...
% t = 10 secs [nr = 1278642] [nf = 273329] [nu = 2036] [ut = 7]
% Looking for a proof at depth = 28 ...
% t = 11 secs [nr = 1371728] [nf = 292897] [nu = 2099] [ut = 7]
% Looking for a proof at depth = 29 ...
% t = 12 secs [nr = 1464814] [nf = 312465] [nu = 2162] [ut = 7]
% Looking for a proof at depth = 30 ...
% t = 12 secs [nr = 1557900] [nf = 332033] [nu = 2225] [ut = 7]
% GIVE UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 1889933
% resolvents: 1557900 factors: 332033
% Number of unit clauses generated: 2225
% % unit clauses generated to total clauses generated: 0.12
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 4 [2] = 1 [3] = 1
% [5] = 1
% Total = 7
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 2225 [2] = 7222 [3] = 28210 [4] = 141306 [5] = 622806 [6] = 1088164
% Average size of a generated clause: 6.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] c_in_3 (+)3 (-)2
% [1] c_lessequals_3 (+)1 (-)0
% [2] c_Tarski_OisLub_4 (+)1 (-)0
% ------------------
% Total: (+)5 (-)2
% Total number of unit clauses retained: 7
% Number of clauses skipped because of their length: 162483
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 1889933
% Number of unification failures: 17237999
% Number of unit to unit unification failures: 6
% N literal unification failure due to lookup root_id table: 11189035
% N base clause resolution failure due to lookup table: 118
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 43
% N unit clauses dropped because they exceeded max values: 80
% 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: 12
% Max term depth in a unit clause: 3
% Number of states in UCFA table: 45
% Total number of terms of all unit clauses in table: 45
% Max allowed number of states in UCFA: 176000
% Ratio n states used/total allowed states: 0.00
% Ratio n states used/total unit clauses terms: 1.00
% Number of symbols (columns) in UCFA: 50
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 19127932
% ConstructUnitClause() = 83
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 171812
% | |
% --------------------------------------------------------
% Elapsed time: 12 secs
% CPU time: 11.91 secs
%
%------------------------------------------------------------------------------