TSTP Solution File: SYN059-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN059-1 : TPTP v5.0.0. Released v1.0.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:28:39 EST 2010
% Result : GaveUp 0.20s
% 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/SystemOnTPTP10736/SYN/SYN059-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 = 0] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 16] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 140] [nf = 12] [nu = 24] [ut = 4]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 328] [nf = 24] [nu = 48] [ut = 4]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 516] [nf = 36] [nu = 72] [ut = 4]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 704] [nf = 48] [nu = 96] [ut = 4]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 892] [nf = 60] [nu = 120] [ut = 4]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 1080] [nf = 72] [nu = 144] [ut = 4]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 1268] [nf = 84] [nu = 168] [ut = 4]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 1456] [nf = 96] [nu = 192] [ut = 4]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 1644] [nf = 108] [nu = 216] [ut = 4]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 1832] [nf = 120] [nu = 240] [ut = 4]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 2020] [nf = 132] [nu = 264] [ut = 4]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 2208] [nf = 144] [nu = 288] [ut = 4]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 2396] [nf = 156] [nu = 312] [ut = 4]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 2584] [nf = 168] [nu = 336] [ut = 4]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 2772] [nf = 180] [nu = 360] [ut = 4]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 2960] [nf = 192] [nu = 384] [ut = 4]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 3148] [nf = 204] [nu = 408] [ut = 4]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 3336] [nf = 216] [nu = 432] [ut = 4]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 3524] [nf = 228] [nu = 456] [ut = 4]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 3712] [nf = 240] [nu = 480] [ut = 4]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 3900] [nf = 252] [nu = 504] [ut = 4]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 4088] [nf = 264] [nu = 528] [ut = 4]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 4276] [nf = 276] [nu = 552] [ut = 4]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 4464] [nf = 288] [nu = 576] [ut = 4]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 4652] [nf = 300] [nu = 600] [ut = 4]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 4840] [nf = 312] [nu = 624] [ut = 4]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 5028] [nf = 324] [nu = 648] [ut = 4]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 0 secs [nr = 5028] [nf = 324] [nu = 648] [ut = 4]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 5028] [nf = 324] [nu = 648] [ut = 4]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 5044] [nf = 324] [nu = 648] [ut = 4]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 5168] [nf = 336] [nu = 672] [ut = 4]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 5692] [nf = 348] [nu = 696] [ut = 4]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 6280] [nf = 360] [nu = 720] [ut = 4]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 6868] [nf = 372] [nu = 744] [ut = 4]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 7456] [nf = 384] [nu = 768] [ut = 4]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 8044] [nf = 396] [nu = 792] [ut = 4]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 8632] [nf = 408] [nu = 816] [ut = 4]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 9220] [nf = 420] [nu = 840] [ut = 4]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 9808] [nf = 432] [nu = 864] [ut = 4]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 10396] [nf = 444] [nu = 888] [ut = 4]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 10984] [nf = 456] [nu = 912] [ut = 4]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 11572] [nf = 468] [nu = 936] [ut = 4]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 12160] [nf = 480] [nu = 960] [ut = 4]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 12748] [nf = 492] [nu = 984] [ut = 4]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 13336] [nf = 504] [nu = 1008] [ut = 4]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 13924] [nf = 516] [nu = 1032] [ut = 4]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 14512] [nf = 528] [nu = 1056] [ut = 4]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 15100] [nf = 540] [nu = 1080] [ut = 4]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 15688] [nf = 552] [nu = 1104] [ut = 4]
% Looking for a proof at depth = 23 ...
% t = 0 secs [nr = 16276] [nf = 564] [nu = 1128] [ut = 4]
% Looking for a proof at depth = 24 ...
% t = 0 secs [nr = 16864] [nf = 576] [nu = 1152] [ut = 4]
% Looking for a proof at depth = 25 ...
% t = 0 secs [nr = 17452] [nf = 588] [nu = 1176] [ut = 4]
% Looking for a proof at depth = 26 ...
% t = 0 secs [nr = 18040] [nf = 600] [nu = 1200] [ut = 4]
% Looking for a proof at depth = 27 ...
% t = 0 secs [nr = 18628] [nf = 612] [nu = 1224] [ut = 4]
% Looking for a proof at depth = 28 ...
% t = 0 secs [nr = 19216] [nf = 624] [nu = 1248] [ut = 4]
% Looking for a proof at depth = 29 ...
% t = 0 secs [nr = 19804] [nf = 636] [nu = 1272] [ut = 4]
% Looking for a proof at depth = 30 ...
% t = 0 secs [nr = 20392] [nf = 648] [nu = 1296] [ut = 4]
% GIVE UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 21040
% resolvents: 20392 factors: 648
% Number of unit clauses generated: 1296
% % unit clauses generated to total clauses generated: 6.16
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 2 [4] = 2
% Total = 4
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 1296 [2] = 2160 [3] = 7336 [4] = 10248
% Average size of a generated clause: 4.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] big_f_1 (+)1 (-)0
% [1] big_g_1 (+)1 (-)0
% [2] big_h_1 (+)1 (-)0
% [3] big_j_1 (+)1 (-)0
% ------------------
% Total: (+)4 (-)0
% Total number of unit clauses retained: 4
% Number of clauses skipped because of their length: 2388
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 21040
% Number of unification failures: 49838
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 183616
% N base clause resolution failure due to lookup table: 25584
% 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: 46
% 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: 6
% Total number of terms of all unit clauses in table: 4
% 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.50
% Number of symbols (columns) in UCFA: 45
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 70878
% ConstructUnitClause() = 48
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.19 secs
%
%------------------------------------------------------------------------------