TSTP Solution File: SWV290-2 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SWV290-2 : TPTP v5.0.0. Released v3.2.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art03.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:15 EST 2010
% Result : GaveUp 34.33s
% 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/SystemOnTPTP11883/SWV/SWV290-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 = 18] [nf = 0] [nu = 11] [ut = 15]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 73] [nf = 0] [nu = 42] [ut = 19]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 210] [nf = 0] [nu = 113] [ut = 22]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 497] [nf = 0] [nu = 241] [ut = 22]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 1054] [nf = 0] [nu = 447] [ut = 22]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 2062] [nf = 0] [nu = 723] [ut = 22]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 3842] [nf = 0] [nu = 999] [ut = 22]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 7210] [nf = 0] [nu = 1275] [ut = 22]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 13812] [nf = 0] [nu = 1551] [ut = 22]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 26701] [nf = 0] [nu = 1827] [ut = 22]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 50470] [nf = 0] [nu = 2103] [ut = 22]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 89457] [nf = 0] [nu = 2379] [ut = 22]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 140064] [nf = 0] [nu = 2655] [ut = 22]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 202787] [nf = 0] [nu = 2931] [ut = 22]
% Looking for a proof at depth = 15 ...
% t = 1 secs [nr = 278122] [nf = 0] [nu = 3207] [ut = 22]
% Looking for a proof at depth = 16 ...
% t = 2 secs [nr = 366565] [nf = 0] [nu = 3483] [ut = 22]
% Looking for a proof at depth = 17 ...
% t = 2 secs [nr = 468612] [nf = 0] [nu = 3759] [ut = 22]
% Looking for a proof at depth = 18 ...
% t = 3 secs [nr = 584759] [nf = 0] [nu = 4035] [ut = 22]
% Looking for a proof at depth = 19 ...
% t = 4 secs [nr = 715502] [nf = 0] [nu = 4311] [ut = 22]
% Looking for a proof at depth = 20 ...
% t = 5 secs [nr = 861337] [nf = 0] [nu = 4587] [ut = 22]
% Looking for a proof at depth = 21 ...
% t = 5 secs [nr = 1022760] [nf = 0] [nu = 4863] [ut = 22]
% Looking for a proof at depth = 22 ...
% t = 6 secs [nr = 1200267] [nf = 0] [nu = 5139] [ut = 22]
% Looking for a proof at depth = 23 ...
% t = 7 secs [nr = 1394354] [nf = 0] [nu = 5415] [ut = 22]
% Looking for a proof at depth = 24 ...
% t = 8 secs [nr = 1605517] [nf = 0] [nu = 5691] [ut = 22]
% Looking for a proof at depth = 25 ...
% t = 10 secs [nr = 1834252] [nf = 0] [nu = 5967] [ut = 22]
% Looking for a proof at depth = 26 ...
% t = 11 secs [nr = 2081055] [nf = 0] [nu = 6243] [ut = 22]
% Looking for a proof at depth = 27 ...
% t = 12 secs [nr = 2346422] [nf = 0] [nu = 6519] [ut = 22]
% Looking for a proof at depth = 28 ...
% t = 14 secs [nr = 2630849] [nf = 0] [nu = 6795] [ut = 22]
% Looking for a proof at depth = 29 ...
% t = 16 secs [nr = 2934832] [nf = 0] [nu = 7071] [ut = 22]
% Looking for a proof at depth = 30 ...
% t = 17 secs [nr = 3258867] [nf = 0] [nu = 7347] [ut = 22]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 17 secs [nr = 3258891] [nf = 0] [nu = 7364] [ut = 22]
% Looking for a proof at depth = 2 ...
% t = 17 secs [nr = 3258952] [nf = 0] [nu = 7401] [ut = 22]
% Looking for a proof at depth = 3 ...
% t = 17 secs [nr = 3259089] [nf = 0] [nu = 7472] [ut = 22]
% Looking for a proof at depth = 4 ...
% t = 17 secs [nr = 3259376] [nf = 0] [nu = 7600] [ut = 22]
% Looking for a proof at depth = 5 ...
% t = 17 secs [nr = 3259933] [nf = 0] [nu = 7806] [ut = 22]
% Looking for a proof at depth = 6 ...
% t = 17 secs [nr = 3260941] [nf = 0] [nu = 8082] [ut = 22]
% Looking for a proof at depth = 7 ...
% t = 17 secs [nr = 3262721] [nf = 0] [nu = 8358] [ut = 22]
% Looking for a proof at depth = 8 ...
% t = 17 secs [nr = 3266089] [nf = 0] [nu = 8634] [ut = 22]
% Looking for a proof at depth = 9 ...
% t = 17 secs [nr = 3272691] [nf = 0] [nu = 8910] [ut = 22]
% Looking for a proof at depth = 10
% ...
% t = 17 secs [nr = 3285580] [nf = 0] [nu = 9186] [ut = 22]
% Looking for a proof at depth = 11 ...
% t = 17 secs [nr = 3309349] [nf = 0] [nu = 9462] [ut = 22]
% Looking for a proof at depth = 12 ...
% t = 18 secs [nr = 3348336] [nf = 0] [nu = 9738] [ut = 22]
% Looking for a proof at depth = 13 ...
% t = 18 secs [nr = 3398943] [nf = 0] [nu = 10014] [ut = 22]
% Looking for a proof at depth = 14 ...
% t = 18 secs [nr = 3461666] [nf = 0] [nu = 10290] [ut = 22]
% Looking for a proof at depth = 15 ...
% t = 18 secs [nr = 3537001] [nf = 0] [nu = 10566] [ut = 22]
% Looking for a proof at depth = 16 ...
% t = 19 secs [nr = 3625444] [nf = 0] [nu = 10842] [ut = 22]
% Looking for a proof at depth = 17 ...
% t = 19 secs [nr = 3727491] [nf = 0] [nu = 11118] [ut = 22]
% Looking for a proof at depth = 18 ...
% t = 20 secs [nr = 3843638] [nf = 0] [nu = 11394] [ut = 22]
% Looking for a proof at depth = 19 ...
% t = 21 secs [nr = 3974381] [nf = 0] [nu = 11670] [ut = 22]
% Looking for a proof at depth = 20 ...
% t = 22 secs [nr = 4120216] [nf = 0] [nu = 11946] [ut = 22]
% Looking for a proof at depth = 21 ...
% t = 22 secs [nr = 4281639] [nf = 0] [nu = 12222] [ut = 22]
% Looking for a proof at depth = 22 ...
% t = 23 secs [nr = 4459146] [nf = 0] [nu = 12498] [ut = 22]
% Looking for a proof at depth = 23 ...
% t = 24 secs [nr = 4653233] [nf = 0] [nu = 12774] [ut = 22]
% Looking for a proof at depth = 24 ...
% t = 25 secs [nr = 4864396] [nf = 0] [nu = 13050] [ut = 22]
% Looking for a proof at depth = 25 ...
% t = 27 secs [nr = 5093131] [nf = 0] [nu = 13326] [ut = 22]
% Looking for a proof at depth = 26 ...
% t = 28 secs [nr = 5339934] [nf = 0] [nu = 13602] [ut = 22]
% Looking for a proof at depth = 27 ...
% t = 29 secs [nr = 5605301] [nf = 0] [nu = 13878] [ut = 22]
% Looking for a proof at depth = 28 ...
% t = 31 secs [nr = 5889728] [nf = 0] [nu = 14154] [ut = 22]
% Looking for a proof at depth = 29 ...
% t = 33 secs [nr = 6193711] [nf = 0] [nu = 14430] [ut = 22]
% Looking for a proof at depth = 30 ...
% t = 34 secs [nr = 6517746] [nf = 0] [nu = 14706] [ut = 22]
% GIVE UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 6517746
% resolvents: 6517746 factors: 0
% Number of unit clauses generated: 14706
% % unit clauses generated to total clauses generated: 0.23
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 5 [1] = 10 [2] = 4 [3] = 3
% Total = 22
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 14706 [2] = 6220220 [3] = 282820
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] c_in_3 (+)20 (-)2
% ------------------
% Total: (+)20 (-)2
% Total number of unit clauses retained: 22
% Number of clauses skipped because of their length: 620516
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 6517746
% Number of unification failures: 24976693
% Number of unit to unit unification failures: 40
% N literal unification failure due to lookup root_id table: 160278098
% N base clause resolution failure due to lookup table: 18045431
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 64
% N unit clauses dropped because they exceeded max values: 526
% 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: 31
% Max term depth in a unit clause: 11
% Number of states in UCFA table: 270
% Total number of terms of all unit clauses in table: 412
% 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.66
% Number of symbols (columns) in UCFA: 63
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 31494439
% ConstructUnitClause() = 543
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 191698
% | |
% --------------------------------------------------------
% Elapsed time: 34 secs
% CPU time: 34.31 secs
%
%------------------------------------------------------------------------------