TSTP Solution File: SYN435-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN435-1 : TPTP v5.0.0. Released v2.1.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art04.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 09:12:11 EST 2010
% Result : Timeout 300.06s
% 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/SystemOnTPTP8688/SYN/SYN435-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 = 8] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 120] [nf = 0] [nu = 0] [ut = 0]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 232] [nf = 2] [nu = 2] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 1065] [nf = 40] [nu = 4] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 4217] [nf = 402] [nu = 42] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 7369] [nf = 764] [nu = 80] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 10564] [nf = 1154] [nu = 118] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 13759] [nf = 1544] [nu = 156] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 16972] [nf = 1950] [nu = 194] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 20185] [nf = 2356] [nu = 232] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 23398] [nf = 2762] [nu = 270] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 26611] [nf = 3168] [nu = 308] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 29824] [nf = 3574] [nu = 346] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 33037] [nf = 3980] [nu = 384] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 1 secs [nr = 36250] [nf = 4386] [nu = 422] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 1 secs [nr = 39463] [nf = 4792] [nu = 460] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 1 secs [nr = 42676] [nf = 5198] [nu = 498] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 1 secs [nr = 45889] [nf = 5604] [nu = 536] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 1 secs [nr = 49102] [nf = 6010] [nu = 574] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 1 secs [nr = 52315] [nf = 6416] [nu = 612] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 1 secs [nr = 55528] [nf = 6822] [nu = 650] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 1 secs [nr = 58741] [nf = 7228] [nu = 688] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 2 secs [nr = 61954] [nf = 7634] [nu = 726] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 2 secs [nr = 65167] [nf = 8040] [nu = 764] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 2 secs [nr = 68380] [nf = 8446] [nu = 802] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 2 secs [nr = 71593] [nf = 8852] [nu = 840] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 2 secs [nr = 74806] [nf = 9258] [nu = 878] [ut = 1]
% Looking for a proof at depth = 28 ...
% t = 2 secs [nr = 78019] [nf = 9664] [nu = 916] [ut = 1]
% Looking for a proof at depth = 29 ...
% t = 2 secs [nr = 81232] [nf = 10070] [nu = 954] [ut = 1]
% Looking for a proof at depth = 30 ...
% t = 2 secs [nr = 84445] [nf = 10476] [nu = 992] [ut = 1]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 2 secs [nr = 84453] [nf = 10476] [nu = 992] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 2 secs [nr = 84565] [nf = 10476] [nu = 992] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 2 secs [nr = 84677] [nf = 10478] [nu = 994] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 2 secs [nr = 85621] [nf = 10516] [nu = 996] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 2 secs [nr = 94780] [nf = 10986] [nu = 1034] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 3 secs [nr = 192176] [nf = 15215] [nu = 1072] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 7 secs [nr = 993406] [nf = 65155] [nu = 1110] [ut = 1]
% Lo
% oking for a proof at depth = 8 ...
% t = 46 secs [nr = 5627857] [nf = 507221] [nu = 1148] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 291 secs [nr = 26717987] [nf = 3276855] [nu = 1186] [ut = 1]
% Looking for a proof at depth = 10 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 31124547
% resolvents: 27714502 factors: 3410045
% Number of unit clauses generated: 1188
% % unit clauses generated to total clauses generated: 0.00
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [3] = 1
% Total = 1
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 1188 [2] = 16828 [3] = 119902 [4] = 629181 [5] = 5830922 [6] = 17812022
% [7] = 4295843 [8] = 2411871 [9] = 6790
% Average size of a generated clause: 7.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] hskp0 (+)0 (-)0
% [1] hskp1 (+)0 (-)0
% [2] hskp10 (+)0 (-)0
% [3] hskp11 (+)0 (-)0
% [4] hskp12 (+)0 (-)0
% [5] hskp13 (+)0 (-)0
% [6] hskp14 (+)0 (-)0
% [7] hskp15 (+)0 (-)0
% [8] hskp16 (+)0 (-)0
% [9] hskp17 (+)0 (-)0
% [10] hskp18 (+)0 (-)0
% [11] hskp19 (+)0 (-)0
% [12] hskp2 (+)0 (-)0
% [13] hskp20 (+)0 (-)0
% [14] hskp21 (+)0 (-)0
% [15] hskp22 (+)0 (-)0
% [16] hskp23 (+)0 (-)0
% [17] hskp24 (+)0 (-)0
% [18] hskp25 (+)0 (-)0
% [19] hskp26 (+)0 (-)0
% [20] hskp27 (+)0 (-)0
% [21] hskp28 (+)0 (-)0
% [22] hskp29 (+)0 (-)0
% [23] hskp3 (+)0 (-)0
% [24] hskp30 (+)0 (-)0
% [25] hskp31 (+)0 (-)0
% [26] hskp32 (+)0 (-)0
% [27] hskp33 (+)0 (-)0
% [28] hskp34 (+)0 (-)0
% [29] hskp35 (+)0 (-)0
% [30] hskp36 (+)0 (-)0
% [31] hskp37 (+)0 (-)0
% [32] hskp38 (+)0 (-)0
% [33] hskp39 (+)0 (-)0
% [34] hskp4 (+)0 (-)0
% [35] hskp40 (+)0 (-)0
% [36] hskp41 (+)0 (-)0
% [37] hskp42 (+)0 (-)0
% [38] hskp43 (+)0 (-)0
% [39] hskp44 (+)0 (-)0
% [40] hskp45 (+)0 (-)0
% [41] hskp46 (+)0 (-)0
% [42] hskp47 (+)0 (-)0
% [43] hskp48 (+)0 (-)0
% [44] hskp49 (+)0 (-)0
% [45] hskp5 (+)0 (-)0
% [46] hskp50 (+)0 (-)0
% [47] hskp51 (+)0 (-)0
% [48] hskp52 (+)0 (-)0
% [49] hskp6 (+)0 (-)0
% [50] hskp7 (+)0 (-)0
% [51] hskp8 (+)0 (-)0
% [52] hskp9 (+)0 (-)0
% [53] ndr1_0 (+)1 (-)0
% [54] c0_1_1 (+)0 (-)0
% [55] c1_1_1 (+)0 (-)0
% [56] c2_1_1 (+)0 (-)0
% [57] c3_1_1 (+)0 (-)0
% ------------------
% Total: (+)1 (-)0
% Total number of unit clauses retained: 1
% Number of clauses skipped because of their length: 137349547
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 2315778359
% Number of successful unifications: 31124547
% Number of unification failures: 126595384
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 2335286593
% N base clause resolution failure due to lookup table: 3169159969
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 2
% N unit clauses dropped because they exceeded max values: 75
% 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: 0
% Max term depth in a unit clause: 0
% Number of states in UCFA table: 2
% Total number of terms of all unit clauses in table: 0
% 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: inf
% Number of symbols (columns) in UCFA: 145
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 157719931
% ConstructUnitClause() = 76
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 103748
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------