TSTP Solution File: SYN764-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN764-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 11:40:46 EST 2010
% Result : GaveUp 70.08s
% 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/SystemOnTPTP11947/SYN/SYN764-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 = 0] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 4] [nf = 4] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 227] [nf = 74] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 2666] [nf = 382] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 16611] [nf = 1014] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 1 secs [nr = 50788] [nf = 1766] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 1 secs [nr = 84965] [nf = 2518] [nu = 0] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 119142] [nf = 3270] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 153319] [nf = 4022] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 187496] [nf = 4774] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 221673] [nf = 5526] [nu = 0] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 1 secs [nr = 255850] [nf = 6278] [nu = 0] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 1 secs [nr = 290027] [nf = 7030] [nu = 0] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 1 secs [nr = 324204] [nf = 7782] [nu = 0] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 1 secs [nr = 358381] [nf = 8534] [nu = 0] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 1 secs [nr = 392558] [nf = 9286] [nu = 0] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 1 secs [nr = 426735] [nf = 10038] [nu = 0] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 1 secs [nr = 460912] [nf = 10790] [nu = 0] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 1 secs [nr = 495089] [nf = 11542] [nu = 0] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 2 secs [nr = 529266] [nf = 12294] [nu = 0] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 2 secs [nr = 563443] [nf = 13046] [nu = 0] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 2 secs [nr = 597620] [nf = 13798] [nu = 0] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 2 secs [nr = 631797] [nf = 14550] [nu = 0] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 2 secs [nr = 665974] [nf = 15302] [nu = 0] [ut = 1]
% Looking for a proof at depth = 28 ...
% t = 2 secs [nr = 700151] [nf = 16054] [nu = 0] [ut = 1]
% Looking for a proof at depth = 29 ...
% t = 2 secs [nr = 734328] [nf = 16806] [nu = 0] [ut = 1]
% Looking for a proof at depth = 30 ...
% t = 2 secs [nr = 768505] [nf = 17558] [nu = 0] [ut = 1]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 2 secs [nr = 768505] [nf = 17558] [nu = 0] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 2 secs [nr = 768505] [nf = 17558] [nu = 0] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 2 secs [nr = 768505] [nf = 17558] [nu = 0] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 2 secs [nr = 768509] [nf = 17558] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 2 secs [nr = 768548] [nf = 17630] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 2 secs [nr = 769060] [nf = 18186] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 2 secs [nr = 774128] [nf = 19830] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 2 secs [nr = 803734] [nf = 22230] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 2 secs [nr = 877260] [nf = 24750] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 3 secs [nr = 951316
% ] [nf = 29730] [nu = 0] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 3 secs [nr = 1034550] [nf = 50508] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 3 secs [nr = 1173420] [nf = 166930] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 5 secs [nr = 1524586] [nf = 458336] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 7 secs [nr = 2249336] [nf = 749742] [nu = 0] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 10 secs [nr = 2974086] [nf = 1041148] [nu = 0] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 13 secs [nr = 3700492] [nf = 1336250] [nu = 0] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 16 secs [nr = 4444082] [nf = 1675128] [nu = 0] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 19 secs [nr = 5289048] [nf = 2252470] [nu = 0] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 23 secs [nr = 6292990] [nf = 2829812] [nu = 0] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 28 secs [nr = 7296932] [nf = 3407154] [nu = 0] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 32 secs [nr = 8300874] [nf = 3984496] [nu = 0] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 36 secs [nr = 9304816] [nf = 4561838] [nu = 0] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 41 secs [nr = 10308758] [nf = 5139180] [nu = 0] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 45 secs [nr = 11312700] [nf = 5716522] [nu = 0] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 50 secs [nr = 12316642] [nf = 6293864] [nu = 0] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 54 secs [nr = 13320584] [nf = 6871206] [nu = 0] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 58 secs [nr = 14324526] [nf = 7448548] [nu = 0] [ut = 1]
% Looking for a proof at depth = 28 ...
% t = 63 secs [nr = 15328468] [nf = 8025890] [nu = 0] [ut = 1]
% Looking for a proof at depth = 29 ...
% t = 67 secs [nr = 16332410] [nf = 8603232] [nu = 0] [ut = 1]
% Looking for a proof at depth = 30 ...
% t = 71 secs [nr = 17336352] [nf = 9180574] [nu = 0] [ut = 1]
% GIVE UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 26516926
% resolvents: 17336352 factors: 9180574
% 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] = 1
% Total = 1
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [4] = 727460 [5] = 2146286 [6] = 3503826 [7] = 8321112 [8] = 9159216 [9] = 2659026
% Average size of a generated clause: 8.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] ssPv1_1 (+)0 (-)0
% [1] ssPv2_1 (+)0 (-)0
% [2] ssPv3_1 (+)0 (-)0
% [3] ssPv4_1 (+)0 (-)0
% [4] ssPv5_1 (+)0 (-)0
% [5] ssPv6_1 (+)0 (-)0
% [6] ssPv7_1 (+)0 (-)0
% [7] ssPv8_1 (+)0 (-)0
% [8] ssRr_2 (+)1 (-)0
% ------------------
% Total: (+)1 (-)0
% Total number of unit clauses retained: 1
% Number of clauses skipped because of their length: 1370614
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 26516926
% Number of unification failures: 16562084
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 39841842
% N base clause resolution failure due to lookup table: 2427516
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 22
% 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: 3
% Max term depth in a unit clause: 2
% Number of states in UCFA table: 5
% Total number of terms of all unit clauses in table: 3
% 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: 1.67
% Number of symbols (columns) in UCFA: 44
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 43079010
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 378813
% | |
% --------------------------------------------------------
% Elapsed time: 71 secs
% CPU time: 70.07 secs
%
%------------------------------------------------------------------------------