TSTP Solution File: SWV293-2 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SWV293-2 : TPTP v5.0.0. Released v3.2.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art02.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 06:50:47 EST 2010
% Result : GaveUp 25.09s
% 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/SystemOnTPTP18931/SWV/SWV293-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 = 6] [nf = 0] [nu = 0] [ut = 4]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 33] [nf = 0] [nu = 7] [ut = 7]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 107] [nf = 0] [nu = 33] [ut = 10]
% Looking for a proof at depth = 4 ...
% t = 1 secs [nr = 260] [nf = 0] [nu = 79] [ut = 10]
% Looking for a proof at depth = 5 ...
% t = 1 secs [nr = 564] [nf = 0] [nu = 153] [ut = 10]
% Looking for a proof at depth = 6 ...
% t = 1 secs [nr = 1160] [nf = 0] [nu = 261] [ut = 10]
% Looking for a proof at depth = 7 ...
% t = 1 secs [nr = 2336] [nf = 0] [nu = 445] [ut = 10]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 4511] [nf = 0] [nu = 629] [ut = 10]
% Looking for a proof at depth = 9 ...
% t = 1 secs [nr = 8737] [nf = 0] [nu = 813] [ut = 10]
% Looking for a proof at depth = 10 ...
% t = 1 secs [nr = 17145] [nf = 0] [nu = 997] [ut = 10]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 33529] [nf = 0] [nu = 1181] [ut = 10]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 60411] [nf = 0] [nu = 1365] [ut = 10]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 98266] [nf = 0] [nu = 1549] [ut = 10]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 147569] [nf = 0] [nu = 1733] [ut = 10]
% Looking for a proof at depth = 15 ...
% t = 1 secs [nr = 208795] [nf = 0] [nu = 1917] [ut = 10]
% Looking for a proof at depth = 16 ...
% t = 2 secs [nr = 282419] [nf = 0] [nu = 2101] [ut = 10]
% Looking for a proof at depth = 17 ...
% t = 2 secs [nr = 368916] [nf = 0] [nu = 2285] [ut = 10]
% Looking for a proof at depth = 18 ...
% t = 3 secs [nr = 468761] [nf = 0] [nu = 2469] [ut = 10]
% Looking for a proof at depth = 19 ...
% t = 3 secs [nr = 582429] [nf = 0] [nu = 2653] [ut = 10]
% Looking for a proof at depth = 20 ...
% t = 4 secs [nr = 710395] [nf = 0] [nu = 2837] [ut = 10]
% Looking for a proof at depth = 21 ...
% t = 4 secs [nr = 853134] [nf = 0] [nu = 3021] [ut = 10]
% Looking for a proof at depth = 22 ...
% t = 5 secs [nr = 1011121] [nf = 0] [nu = 3205] [ut = 10]
% Looking for a proof at depth = 23 ...
% t = 6 secs [nr = 1184831] [nf = 0] [nu = 3389] [ut = 10]
% Looking for a proof at depth = 24 ...
% t = 6 secs [nr = 1374739] [nf = 0] [nu = 3573] [ut = 10]
% Looking for a proof at depth = 25 ...
% t = 7 secs [nr = 1581320] [nf = 0] [nu = 3757] [ut = 10]
% Looking for a proof at depth = 26 ...
% t = 8 secs [nr = 1805049] [nf = 0] [nu = 3941] [ut = 10]
% Looking for a proof at depth = 27 ...
% t = 9 secs [nr = 2046401] [nf = 0] [nu = 4125] [ut = 10]
% Looking for a proof at depth = 28 ...
% t = 11 secs [nr = 2305851] [nf = 0] [nu = 4309] [ut = 10]
% Looking for a proof at depth = 29 ...
% t = 12 secs [nr = 2583874] [nf = 0] [nu = 4493] [ut = 10]
% Looking for a proof at depth = 30 ...
% t = 13 secs [nr = 2880945] [nf = 0] [nu = 4677] [ut = 10]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 13 secs [nr = 2880956] [nf = 0] [nu = 4682] [ut = 10]
% Looking for a proof at depth = 2 ...
% t = 13 secs [nr = 2880989] [nf = 0] [nu = 4695] [ut = 10]
% Looking for a proof at depth = 3 ...
% t = 13 secs [nr = 2881063] [nf = 0] [nu = 4721] [ut = 10]
% Looking for a proof at depth = 4 ...
% t = 13 secs [nr = 2881216] [nf = 0] [nu = 4767] [ut = 10]
% Looking for a proof at depth = 5 ...
% t = 13 secs [nr = 2881520] [nf = 0] [nu = 4841] [ut = 10]
% Looking for a proof at depth = 6 ...
% t = 13 secs [nr = 2882116] [nf = 0] [nu = 4949] [ut = 10]
% Looking for a proof at depth = 7 ...
% t = 13 secs [nr = 2883292] [nf = 0] [nu = 5133] [ut = 10]
% Looking for a proof at depth = 8 ...
% t = 13 secs [nr = 2885467] [nf = 0] [nu = 5317] [ut = 10]
% Looking for a proof at depth = 9 ...
% t = 13 secs [nr = 2889693] [nf = 0] [nu = 5501] [ut = 10]
% Looking for a proof at depth = 10 ...
% t = 13 secs [
% nr = 2898101] [nf = 0] [nu = 5685] [ut = 10]
% Looking for a proof at depth = 11 ...
% t = 13 secs [nr = 2914485] [nf = 0] [nu = 5869] [ut = 10]
% Looking for a proof at depth = 12 ...
% t = 14 secs [nr = 2941367] [nf = 0] [nu = 6053] [ut = 10]
% Looking for a proof at depth = 13 ...
% t = 14 secs [nr = 2979222] [nf = 0] [nu = 6237] [ut = 10]
% Looking for a proof at depth = 14 ...
% t = 14 secs [nr = 3028525] [nf = 0] [nu = 6421] [ut = 10]
% Looking for a proof at depth = 15 ...
% t = 14 secs [nr = 3089751] [nf = 0] [nu = 6605] [ut = 10]
% Looking for a proof at depth = 16 ...
% t = 14 secs [nr = 3163375] [nf = 0] [nu = 6789] [ut = 10]
% Looking for a proof at depth = 17 ...
% t = 15 secs [nr = 3249872] [nf = 0] [nu = 6973] [ut = 10]
% Looking for a proof at depth = 18 ...
% t = 15 secs [nr = 3349717] [nf = 0] [nu = 7157] [ut = 10]
% Looking for a proof at depth = 19 ...
% t = 16 secs [nr = 3463385] [nf = 0] [nu = 7341] [ut = 10]
% Looking for a proof at depth = 20 ...
% t = 16 secs [nr = 3591351] [nf = 0] [nu = 7525] [ut = 10]
% Looking for a proof at depth = 21 ...
% t = 17 secs [nr = 3734090] [nf = 0] [nu = 7709] [ut = 10]
% Looking for a proof at depth = 22 ...
% t = 17 secs [nr = 3892077] [nf = 0] [nu = 7893] [ut = 10]
% Looking for a proof at depth = 23 ...
% t = 18 secs [nr = 4065787] [nf = 0] [nu = 8077] [ut = 10]
% Looking for a proof at depth = 24 ...
% t = 19 secs [nr = 4255695] [nf = 0] [nu = 8261] [ut = 10]
% Looking for a proof at depth = 25 ...
% t = 20 secs [nr = 4462276] [nf = 0] [nu = 8445] [ut = 10]
% Looking for a proof at depth = 26 ...
% t = 21 secs [nr = 4686005] [nf = 0] [nu = 8629] [ut = 10]
% Looking for a proof at depth = 27 ...
% t = 22 secs [nr = 4927357] [nf = 0] [nu = 8813] [ut = 10]
% Looking for a proof at depth = 28 ...
% t = 23 secs [nr = 5186807] [nf = 0] [nu = 8997] [ut = 10]
% Looking for a proof at depth = 29 ...
% t = 25 secs [nr = 5464830] [nf = 0] [nu = 9181] [ut = 10]
% Looking for a proof at depth = 30 ...
% t = 26 secs [nr = 5761901] [nf = 0] [nu = 9365] [ut = 10]
% GIVE UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 5761901
% resolvents: 5761901 factors: 0
% Number of unit clauses generated: 9365
% % unit clauses generated to total clauses generated: 0.16
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 4 [2] = 3 [3] = 3
% Total = 10
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 9365 [2] = 5514014 [3] = 238522
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] c_in_3 (+)8 (-)2
% ------------------
% Total: (+)8 (-)2
% Total number of unit clauses retained: 10
% Number of clauses skipped because of their length: 567499
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 5761901
% Number of unification failures: 11400170
% Number of unit to unit unification failures: 16
% N literal unification failure due to lookup root_id table: 75580103
% N base clause resolution failure due to lookup table: 21452815
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 63
% N unit clauses dropped because they exceeded max values: 354
% 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: 45
% Max term depth in a unit clause: 10
% Number of states in UCFA table: 175
% Total number of terms of all unit clauses in table: 201
% Max allowed number of states in UCFA: 528000
% Ratio n states used/total allowed states: 0.00
% Ratio n states used/total unit clauses terms: 0.87
% Number of symbols (columns) in UCFA: 57
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 17162071
% ConstructUnitClause() = 360
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 230476
% | |
% --------------------------------------------------------
% Elapsed time: 26 secs
% CPU time: 25.08 secs
%
%------------------------------------------------------------------------------