TSTP Solution File: SYN317-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN317-1 : TPTP v5.0.0. Released v1.2.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Nov 28 08:53:33 EST 2010
% Result : GaveUp 0.14s
% 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/SystemOnTPTP18172/SYN/SYN317-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 = 2]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 3] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 21] [nf = 0] [nu = 6] [ut = 3]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 39] [nf = 0] [nu = 12] [ut = 3]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 57] [nf = 0] [nu = 18] [ut = 3]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 75] [nf = 0] [nu = 24] [ut = 3]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 93] [nf = 0] [nu = 30] [ut = 3]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 111] [nf = 0] [nu = 36] [ut = 3]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 129] [nf = 0] [nu = 42] [ut = 3]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 147] [nf = 0] [nu = 48] [ut = 3]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 165] [nf = 0] [nu = 54] [ut = 3]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 183] [nf = 0] [nu = 60] [ut = 3]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 201] [nf = 0] [nu = 66] [ut = 3]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 219] [nf = 0] [nu = 72] [ut = 3]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 237] [nf = 0] [nu = 78] [ut = 3]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 255] [nf = 0] [nu = 84] [ut = 3]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 273] [nf = 0] [nu = 90] [ut = 3]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 291] [nf = 0] [nu = 96] [ut = 3]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 309] [nf = 0] [nu = 102] [ut = 3]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 327] [nf = 0] [nu = 108] [ut = 3]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 345] [nf = 0] [nu = 114] [ut = 3]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 363] [nf = 0] [nu = 120] [ut = 3]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 381] [nf = 0] [nu = 126] [ut = 3]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 399] [nf = 0] [nu = 132] [ut = 3]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 417] [nf = 0] [nu = 138] [ut = 3]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 435] [nf = 0] [nu = 144] [ut = 3]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 453] [nf = 0] [nu = 150] [ut = 3]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 471] [nf = 0] [nu = 156] [ut = 3]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 489] [nf = 0] [nu = 162] [ut = 3]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 507] [nf = 0] [nu = 168] [ut = 3]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 507] [nf = 0] [nu = 168] [ut = 3]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 510] [nf = 0] [nu = 168] [ut = 3]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 528] [nf = 0] [nu = 174] [ut = 3]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 546] [nf = 0] [nu = 180] [ut = 3]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 564] [nf = 0] [nu = 186] [ut = 3]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 582] [nf = 0] [nu = 192] [ut = 3]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 600] [nf = 0] [nu = 198] [ut = 3]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 618] [nf = 0] [nu = 204] [ut = 3]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 636] [nf = 0] [nu = 210] [ut = 3]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 654] [nf = 0] [nu = 216] [ut = 3]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 672] [nf = 0] [nu = 222] [ut = 3]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 690] [nf = 0] [nu = 228] [ut = 3]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 708] [nf = 0] [nu = 234] [ut = 3]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 726] [nf = 0] [nu = 240] [ut = 3]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 744] [nf = 0] [nu = 246] [ut = 3]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 762] [nf = 0] [nu = 252] [ut = 3]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 780] [nf = 0] [nu = 258] [ut = 3]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 798] [nf = 0] [nu = 264] [ut = 3]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 816] [nf = 0] [nu = 270] [ut = 3]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 834] [nf = 0] [nu = 276] [ut = 3]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 852] [nf = 0] [nu = 282] [ut = 3]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 870] [nf = 0] [nu = 288] [ut = 3]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 888] [nf = 0] [nu = 294] [ut = 3]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 906] [nf = 0] [nu = 300] [ut = 3]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 924] [nf = 0] [nu = 306] [ut = 3]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 942] [nf = 0] [nu = 312] [ut = 3]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 960] [nf = 0] [nu = 318] [ut = 3]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 978] [nf = 0] [nu = 324] [ut = 3]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 996] [nf = 0] [nu = 330] [ut = 3]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 1014] [nf = 0] [nu = 336] [ut = 3]
% GIVE UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 1014
% resolvents: 1014 factors: 0
% Number of unit clauses generated: 336
% % unit clauses generated to total clauses generated: 33.14
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 2 [3] = 1
% Total = 3
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 336 [2] = 336 [3] = 342
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] f_1 (+)2 (-)0
% [1] g_1 (+)0 (-)1
% ------------------
% Total: (+)2 (-)1
% Total number of unit clauses retained: 3
% Number of clauses skipped because of their length: 16
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 1014
% Number of unification failures: 0
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 798
% N base clause resolution failure due to lookup table: 78
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 3
% N unit clauses dropped because they exceeded max values: 11
% 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: 1
% Max term depth in a unit clause: 1
% 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: 39
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 1014
% ConstructUnitClause() = 12
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.13 secs
%
%------------------------------------------------------------------------------