TSTP Solution File: SYN322-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : SYN322-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:54:27 EST 2010
% Result : Timeout 300.01s
% 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/SystemOnTPTP18770/SYN/SYN322-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 = 4] [nf = 2] [nu = 2] [ut = 1]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 23] [nf = 6] [nu = 9] [ut = 2]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 85] [nf = 18] [nu = 35] [ut = 2]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 243] [nf = 54] [nu = 101] [ut = 2]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 625] [nf = 154] [nu = 263] [ut = 2]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 1519] [nf = 414] [nu = 649] [ut = 2]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 3565] [nf = 1058] [nu = 1547] [ut = 2]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 8171] [nf = 2598] [nu = 3597] [ut = 2]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 18409] [nf = 6186] [nu = 8207] [ut = 2]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 40935] [nf = 14382] [nu = 18449] [ut = 2]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 90085] [nf = 32818] [nu = 40979] [ut = 2]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 196579] [nf = 73782] [nu = 90133] [ut = 2]
% Looking for a proof at depth = 13 ...
% t = 1 secs [nr = 425953] [nf = 163898] [nu = 196631] [ut = 2]
% Looking for a proof at depth = 14 ...
% t = 2 secs [nr = 917471] [nf = 360510] [nu = 426009] [ut = 2]
% Looking for a proof at depth = 15 ...
% t = 4 secs [nr = 1966045] [nf = 786498] [nu = 917531] [ut = 2]
% Looking for a proof at depth = 16 ...
% t = 8 secs [nr = 4194267] [nf = 1704006] [nu = 1966109] [ut = 2]
% Looking for a proof at depth = 17 ...
% t = 18 secs [nr = 8912857] [nf = 3670090] [nu = 4194335] [ut = 2]
% Looking for a proof at depth = 18 ...
% Entering time slice 2
% Updating parameters ... done.
% Looking for a proof at depth = 1 ...
% t = 32 secs [nr = 15671079] [nf = 6459390] [nu = 7376853] [ut = 2]
% Looking for a proof at depth = 2 ...
% t = 32 secs [nr = 15671101] [nf = 6459394] [nu = 7376863] [ut = 2]
% Looking for a proof at depth = 3 ...
% t = 32 secs [nr = 15671163] [nf = 6459406] [nu = 7376889] [ut = 2]
% Looking for a proof at depth = 4 ...
% t = 32 secs [nr = 15671321] [nf = 6459442] [nu = 7376955] [ut = 2]
% Looking for a proof at depth = 5 ...
% t = 32 secs [nr = 15671703] [nf = 6459542] [nu = 7377117] [ut = 2]
% Looking for a proof at depth = 6 ...
% t = 32 secs [nr = 15672597] [nf = 6459802] [nu = 7377503] [ut = 2]
% Looking for a proof at depth = 7 ...
% t = 32 secs [nr = 15674643] [nf = 6460446] [nu = 7378401] [ut = 2]
% Looking for a proof at depth = 8 ...
% t = 32 secs [nr = 15679249] [nf = 6461986] [nu = 7380451] [ut = 2]
% Looking for a proof at depth = 9 ...
% t = 32 secs [nr = 15689487] [nf = 6465574] [nu = 7385061] [ut = 2]
% Looking for a proof at depth = 10 ...
% t = 32 secs [nr = 15712013] [nf = 6473770] [nu = 7395303] [ut = 2]
% Looking for a proof at depth = 11 ...
% t = 32 secs [nr = 15761163] [nf = 6492206] [nu = 7417833] [ut = 2]
% Looking for a proof at depth = 12 ...
% t = 32 secs [nr = 15867657] [nf = 6533170] [nu = 7466987] [ut = 2]
% Looking for a proof at depth = 13 ...
% t = 33 secs [nr = 16097031] [nf = 6623286] [nu = 7573485] [ut = 2]
% Looking for a proof at depth = 14 ...
% t = 33 secs [nr = 16588549] [nf = 6819898] [nu = 7802863] [ut = 2]
% Looking for a proof at depth = 15 ...
% t = 36 secs [nr = 17637123] [nf = 7245886] [nu = 8294385] [ut = 2]
% Looking for a proof at depth = 16 ...
% t = 40 secs [nr = 19865345] [nf = 8163394] [nu = 9342963] [ut = 2]
% Looking for a proof at depth = 17 ...
% t = 49 secs [nr = 24583935] [nf = 10129478] [nu = 11571189] [ut = 2]
% Looking for a proof at depth = 18 ...
% t = 69 secs [nr = 34545405] [nf = 14323786] [nu = 16289783] [ut = 2]
% Looking for a proof at depth = 19 ...
% t = 112 secs [nr = 55516923] [nf = 23236686] [nu = 26251257] [ut = 2]
% Looking for a proof at depth = 20 ...
% t = 202 se
% cs [nr = 99557113] [nf = 42111058] [nu = 47222779] [ut = 2]
% Looking for a proof at depth = 21 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 213348819
% resolvents: 149801808 factors: 63547011
% Number of unit clauses generated: 71116338
% % unit clauses generated to total clauses generated: 33.33
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [1] = 1 [2] = 1
% Total = 2
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 71116338 [2] = 142232481
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] f_2 (+)0 (-)2
% ------------------
% Total: (+)0 (-)2
% Total number of unit clauses retained: 2
% Number of clauses skipped because of their length: 0
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 213348819
% Number of unification failures: 0
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 381283580
% N base clause resolution failure due to lookup table: 7568309
% 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: 37450458
% 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: 2
% 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: 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.25
% Number of symbols (columns) in UCFA: 36
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 213348819
% ConstructUnitClause() = 37450460
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 39.38 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 711163
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------