TSTP Solution File: SYN783-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN783-1 : TPTP v5.0.0. Released v2.5.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art09.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:48:54 EST 2010
% Result : Timeout 300.05s
% 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/SystemOnTPTP15139/SYN/SYN783-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 = 0] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 0] [nf = 0] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 12] [nf = 6] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 614] [nf = 96] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 3352] [nf = 272] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 21592] [nf = 552] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 133316] [nf = 954] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 245040] [nf = 1356] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 356764] [nf = 1758] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 468488] [nf = 2160] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 580212] [nf = 2562] [nu = 0] [ut = 2]
% Looking for a proof at depth = 14 ...
% t = 1 secs [nr = 691936] [nf = 2964] [nu = 0] [ut = 2]
% Looking for a proof at depth = 15 ...
% t = 2 secs [nr = 803660] [nf = 3366] [nu = 0] [ut = 2]
% Looking for a proof at depth = 16 ...
% t = 2 secs [nr = 915384] [nf = 3768] [nu = 0] [ut = 2]
% Looking for a proof at depth = 17 ...
% t = 2 secs [nr = 1027108] [nf = 4170] [nu = 0] [ut = 2]
% Looking for a proof at depth = 18 ...
% t = 2 secs [nr = 1138832] [nf = 4572] [nu = 0] [ut = 2]
% Looking for a proof at depth = 19 ...
% t = 3 secs [nr = 1250556] [nf = 4974] [nu = 0] [ut = 2]
% Looking for a proof at depth = 20 ...
% t = 3 secs [nr = 1362280] [nf = 5376] [nu = 0] [ut = 2]
% Looking for a proof at depth = 21 ...
% t = 3 secs [nr = 1474004] [nf = 5778] [nu = 0] [ut = 2]
% Looking for a proof at depth = 22 ...
% t = 3 secs [nr = 1585728] [nf = 6180] [nu = 0] [ut = 2]
% Looking for a proof at depth = 23 ...
% t = 4 secs [nr = 1697452] [nf = 6582] [nu = 0] [ut = 2]
% Looking for a proof at depth = 24 ...
% t = 4 secs [nr = 1809176] [nf = 6984] [nu = 0] [ut = 2]
% Looking for a proof at depth = 25 ...
% t = 4 secs [nr = 1920900] [nf = 7386] [nu = 0] [ut = 2]
% Looking for a proof at depth = 26 ...
% t = 4 secs [nr = 2032624] [nf = 7788] [nu = 0] [ut = 2]
% Looking for a proof at depth = 27 ...
% t = 5 secs [nr = 2144348] [nf = 8190] [nu = 0] [ut = 2]
% Looking for a proof at depth = 28 ...
% t = 5 secs [nr = 2256072] [nf = 8592] [nu = 0] [ut = 2]
% Looking for a proof at depth = 29 ...
% t = 5 secs [nr = 2367796] [nf = 8994] [nu = 0] [ut = 2]
% Looking for a proof at depth = 30 ...
% t = 5 secs [nr = 2479520] [nf = 9396] [nu = 0] [ut = 2]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 5 secs [nr = 2479520] [nf = 9396] [nu = 0] [ut = 2]
% Looking for a proof at depth = 2 ...
% t = 5 secs [nr = 2479520] [nf = 9396] [nu = 0] [ut = 2]
% Looking for a proof at depth = 3 ...
% t = 5 secs [nr = 2479520] [nf = 9396] [nu = 0] [ut = 2]
% Looking for a proof at depth = 4 ...
% t = 5 secs [nr = 2479532] [nf = 9396] [nu = 0] [ut = 2]
% Looking for a proof at depth = 5 ...
% t = 5 secs [nr = 2479640] [nf = 9606] [nu = 0] [ut = 2]
% Looking for a proof at depth = 6 ...
% t = 5 secs [nr = 2481174] [nf = 10216] [nu = 0] [ut = 2]
% Looking for a proof at depth = 7 ...
% t = 5 secs [nr = 2488744] [nf = 11520] [nu = 0] [ut = 2]
% Looking for a proof at depth = 8 ...
% t = 6 secs [nr = 2537488] [nf = 13880] [nu = 0] [ut = 2]
% Looking for a proof at depth = 9 ...
% t = 6 secs [nr = 2838484] [nf = 16530] [nu = 0] [ut = 2]
% Looking for a proof at depth = 10 ...
% t = 7 secs [nr = 3142294] [nf = 30
% 192] [nu = 0] [ut = 2]
% Looking for a proof at depth = 11 ...
% t = 8 secs [nr = 3495074] [nf = 74448] [nu = 0] [ut = 2]
% Looking for a proof at depth = 12 ...
% t = 9 secs [nr = 3996272] [nf = 332944] [nu = 0] [ut = 2]
% Looking for a proof at depth = 13 ...
% t = 15 secs [nr = 5409734] [nf = 1960544] [nu = 0] [ut = 2]
% Looking for a proof at depth = 14 ...
% t = 30 secs [nr = 9381848] [nf = 3588144] [nu = 0] [ut = 2]
% Looking for a proof at depth = 15 ...
% t = 46 secs [nr = 13367522] [nf = 5255140] [nu = 0] [ut = 2]
% Looking for a proof at depth = 16 ...
% t = 62 secs [nr = 17407364] [nf = 7003352] [nu = 0] [ut = 2]
% Looking for a proof at depth = 17 ...
% t = 78 secs [nr = 21564638] [nf = 8751564] [nu = 0] [ut = 2]
% Looking for a proof at depth = 18 ...
% t = 96 secs [nr = 26254136] [nf = 11697280] [nu = 0] [ut = 2]
% Looking for a proof at depth = 19 ...
% t = 119 secs [nr = 31513874] [nf = 14642996] [nu = 0] [ut = 2]
% Looking for a proof at depth = 20 ...
% t = 141 secs [nr = 36773612] [nf = 17588712] [nu = 0] [ut = 2]
% Looking for a proof at depth = 21 ...
% t = 164 secs [nr = 42033350] [nf = 20534428] [nu = 0] [ut = 2]
% Looking for a proof at depth = 22 ...
% t = 187 secs [nr = 47293088] [nf = 23480144] [nu = 0] [ut = 2]
% Looking for a proof at depth = 23 ...
% t = 210 secs [nr = 52552826] [nf = 26425860] [nu = 0] [ut = 2]
% Looking for a proof at depth = 24 ...
% t = 232 secs [nr = 57812564] [nf = 29371576] [nu = 0] [ut = 2]
% Looking for a proof at depth = 25 ...
% t = 255 secs [nr = 63072302] [nf = 32317292] [nu = 0] [ut = 2]
% Looking for a proof at depth = 26 ...
% t = 277 secs [nr = 68332040] [nf = 35263008] [nu = 0] [ut = 2]
% Looking for a proof at depth = 27 ...
% t = 300 secs [nr = 73591778] [nf = 38208724] [nu = 0] [ut = 2]
% Looking for a proof at depth = 28 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 113042895
% resolvents: 74394588 factors: 38648307
% 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] = 2
% Total = 2
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [4] = 1968169 [5] = 5909893 [6] = 20150153 [7] = 33915760 [8] = 38667419 [9] = 12431501
% 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 (+)2 (-)0
% ------------------
% Total: (+)2 (-)0
% Total number of unit clauses retained: 2
% Number of clauses skipped because of their length: 6348390
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 113042895
% Number of unification failures: 219099421
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 242750934
% N base clause resolution failure due to lookup table: 3055343
% 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: 7
% Total number of terms of all unit clauses in table: 6
% 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.17
% Number of symbols (columns) in UCFA: 45
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 332142316
% ConstructUnitClause() = 0
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 376810
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------