TSTP Solution File: SYN086-1.003 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN086-1.003 : TPTP v5.0.0. Bugfixed v1.2.1.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art07.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 08:30:19 EST 2010
% Result : Timeout 300.03s
% 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/SystemOnTPTP23154/SYN/SYN086-1.003+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 = 2] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 34] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 74] [nf = 0] [nu = 0] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 186] [nf = 4] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 400] [nf = 26] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 758] [nf = 54] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 1196] [nf = 82] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 2078] [nf = 142] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 3624] [nf = 346] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 6314] [nf = 594] [nu = 0] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 9628] [nf = 842] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 16494] [nf = 1346] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 28636] [nf = 2998] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 49890] [nf = 4990] [nu = 0] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 76072] [nf = 6982] [nu = 0] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 130646] [nf = 11022] [nu = 0] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 227228] [nf = 24222] [nu = 0] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 1 secs [nr = 396482] [nf = 40078] [nu = 0] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 1 secs [nr = 604808] [nf = 55934] [nu = 0] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 2 secs [nr = 1040126] [nf = 88174] [nu = 0] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 5 secs [nr = 1810380] [nf = 193558] [nu = 0] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 8 secs [nr = 3160746] [nf = 319830] [nu = 0] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 13 secs [nr = 4821704] [nf = 446102] [nu = 0] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 23 secs [nr = 8297782] [nf = 703446] [nu = 0] [ut = 1]
% Looking for a proof at depth = 25 ...
% Entering time slice 2
% Updating parameters ... done.
% Looking for a proof at depth = 1 ...
% t = 31 secs [nr = 11050825] [nf = 1085190] [nu = 0] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 31 secs [nr = 11050857] [nf = 1085190] [nu = 0] [ut = 1]
% Looking for a proof at depth = 3 ...
% t = 31 secs [nr = 11050897] [nf = 1085190] [nu = 0] [ut = 1]
% Looking for a proof at depth = 4 ...
% t = 31 secs [nr = 11051009] [nf = 1085194] [nu = 0] [ut = 1]
% Looking for a proof at depth = 5 ...
% t = 31 secs [nr = 11051223] [nf = 1085216] [nu = 0] [ut = 1]
% Looking for a proof at depth = 6 ...
% t = 31 secs [nr = 11051581] [nf = 1085244] [nu = 0] [ut = 1]
% Looking for a proof at depth = 7 ...
% t = 31 secs [nr = 11052019] [nf = 1085272] [nu = 0] [ut = 1]
% Looking for a proof at depth = 8 ...
% t = 31 secs [nr = 11052901] [nf = 1085332] [nu = 0] [ut = 1]
% Looking for a proof at depth = 9 ...
% t = 31 secs [nr = 11054447] [nf = 1085536] [nu = 0] [ut = 1]
% Looking for a proof at depth = 10 ...
% t = 31 secs [nr = 11057137] [nf = 1085784] [nu = 0] [ut = 1]
% Looking for a proof at depth = 11 ...
% t = 31 secs [nr = 11060451] [nf = 1086032] [nu = 0] [ut = 1]
% Looking for a proof at depth = 12 ...
% t = 31 secs [nr = 11067317] [nf = 1086536] [nu = 0] [ut = 1]
% Looking for a proof at depth = 13 ...
% t = 31 secs [nr = 11079459] [nf = 1088188] [nu = 0] [ut = 1]
% Looking for a proof at depth = 14 ...
% t = 31 secs [nr = 11100713] [nf = 1090180] [nu = 0] [ut = 1]
% Looking for a proof at depth = 15 ...
% t = 31 secs [nr = 1112
% 6895] [nf = 1092172] [nu = 0] [ut = 1]
% Looking for a proof at depth = 16 ...
% t = 32 secs [nr = 11181469] [nf = 1096212] [nu = 0] [ut = 1]
% Looking for a proof at depth = 17 ...
% t = 32 secs [nr = 11278051] [nf = 1109412] [nu = 0] [ut = 1]
% Looking for a proof at depth = 18 ...
% t = 32 secs [nr = 11447305] [nf = 1125268] [nu = 0] [ut = 1]
% Looking for a proof at depth = 19 ...
% t = 33 secs [nr = 11655631] [nf = 1141124] [nu = 0] [ut = 1]
% Looking for a proof at depth = 20 ...
% t = 34 secs [nr = 12090949] [nf = 1173364] [nu = 0] [ut = 1]
% Looking for a proof at depth = 21 ...
% t = 36 secs [nr = 12861203] [nf = 1278748] [nu = 0] [ut = 1]
% Looking for a proof at depth = 22 ...
% t = 40 secs [nr = 14211569] [nf = 1405020] [nu = 0] [ut = 1]
% Looking for a proof at depth = 23 ...
% t = 45 secs [nr = 15872527] [nf = 1531292] [nu = 0] [ut = 1]
% Looking for a proof at depth = 24 ...
% t = 54 secs [nr = 19348605] [nf = 1788636] [nu = 0] [ut = 1]
% Looking for a proof at depth = 25 ...
% t = 73 secs [nr = 25497803] [nf = 2630364] [nu = 0] [ut = 1]
% Looking for a proof at depth = 26 ...
% t = 105 secs [nr = 36280761] [nf = 3637164] [nu = 0] [ut = 1]
% Looking for a proof at depth = 27 ...
% t = 146 secs [nr = 49537255] [nf = 4643964] [nu = 0] [ut = 1]
% Looking for a proof at depth = 28 ...
% t = 224 secs [nr = 77310101] [nf = 6699340] [nu = 0] [ut = 1]
% Looking for a proof at depth = 29 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 111926217
% resolvents: 101843732 factors: 10082485
% 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:
% ------------------------------------------------
% [2] = 17012295 [3] = 94913922
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] p_1_1 (+)0 (-)0
% [1] p_1_2 (+)0 (-)0
% [2] p_1_3 (+)0 (-)1
% [3] p_2_2 (+)0 (-)0
% [4] p_2_3 (+)0 (-)0
% [5] p_3_3 (+)0 (-)0
% [6] q_1_1 (+)0 (-)0
% [7] q_1_2 (+)0 (-)0
% [8] q_1_3 (+)0 (-)0
% [9] q_2_2 (+)0 (-)0
% [10] q_2_3 (+)0 (-)0
% [11] q_3_3 (+)0 (-)0
% ------------------
% Total: (+)0 (-)1
% Total number of unit clauses retained: 1
% Number of clauses skipped because of their length: 75805968
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 229407960
% Number of successful unifications: 111926217
% Number of unification failures: 0
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 373067024
% N base clause resolution failure due to lookup table: 902672551
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 0
% 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: 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: 46
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 111926217
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 373087
% | |
% --------------------------------------------------------
% Elapsed time: 304 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------