TSTP Solution File: KRS011-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : KRS011-1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : add_equality
% Format : carine
% Command : carine %s t=%d xo=off uct=32000
% Computer : art06.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 : Sat Nov 27 22:43:56 EST 2010
% Result : Timeout 300.04s
% 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/SystemOnTPTP15107/KRS/KRS011-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 = 41] [nf = 0] [nu = 15] [ut = 12]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 160] [nf = 0] [nu = 68] [ut = 21]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 415] [nf = 2] [nu = 167] [ut = 24]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 954] [nf = 4] [nu = 310] [ut = 24]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 2117] [nf = 6] [nu = 553] [ut = 24]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 4572] [nf = 8] [nu = 1008] [ut = 24]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 9439] [nf = 10] [nu = 1863] [ut = 24]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 18904] [nf = 12] [nu = 3434] [ut = 24]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 36151] [nf = 14] [nu = 6233] [ut = 24]
% Looking for a proof at depth = 10 ...
% t = 1 secs [nr = 67908] [nf = 16] [nu = 11074] [ut = 24]
% Looking for a proof at depth = 11 ...
% t = 1 secs [nr = 123461] [nf = 18] [nu = 19249] [ut = 24]
% Looking for a proof at depth = 12 ...
% t = 1 secs [nr = 223890] [nf = 20] [nu = 32838] [ut = 24]
% Looking for a proof at depth = 13 ...
% t = 2 secs [nr = 400165] [nf = 22] [nu = 55281] [ut = 24]
% Looking for a proof at depth = 14 ...
% t = 3 secs [nr = 722752] [nf = 24] [nu = 92468] [ut = 24]
% Looking for a proof at depth = 15 ...
% t = 5 secs [nr = 1307431] [nf = 26] [nu = 154859] [ut = 24]
% Looking for a proof at depth = 16 ...
% t = 9 secs [nr = 2407176] [nf = 28] [nu = 261658] [ut = 24]
% Looking for a proof at depth = 17 ...
% t = 17 secs [nr = 4478111] [nf = 30] [nu = 449089] [ut = 24]
% Looking for a proof at depth = 18 ...
% t = 32 secs [nr = 8477520] [nf = 32] [nu = 786870] [ut = 24]
% Looking for a proof at depth = 19 ...
% t = 62 secs [nr = 16230133] [nf = 34] [nu = 1411077] [ut = 24]
% Looking for a proof at depth = 20 ...
% t = 121 secs [nr = 31469530] [nf = 36] [nu = 2589782] [ut = 24]
% Looking for a proof at depth = 21 ...
% Entering time slice 2
% Updating parameters ... done.
% Looking for a proof at depth = 1 ...
% t = 122 secs [nr = 31769101] [nf = 74] [nu = 2639793] [ut = 27]
% Looking for a proof at depth = 2 ...
% t = 122 secs [nr = 31769244] [nf = 74] [nu = 2639858] [ut = 30]
% Looking for a proof at depth = 3 ...
% t = 122 secs [nr = 31769540] [nf = 84] [nu = 2639975] [ut = 30]
% Looking for a proof at depth = 4 ...
% t = 122 secs [nr = 31771688] [nf = 118] [nu = 2640346] [ut = 36]
% Looking for a proof at depth = 5 ...
% t = 122 secs [nr = 31792191] [nf = 494] [nu = 2642353] [ut = 36]
% Looking for a proof at depth = 6 ...
% t = 123 secs [nr = 31926086] [nf = 2628] [nu = 2652102] [ut = 36]
% Looking for a proof at depth = 7 ...
% t = 125 secs [nr = 32706208] [nf = 24062] [nu = 2698521] [ut = 36]
% Looking for a proof at depth = 8 ...
% t = 138 secs [nr = 36420956] [nf = 164694] [nu = 2879252] [ut = 36]
% Looking for a proof at depth = 9 ...
% t = 196 secs [nr = 51574487] [nf = 915174] [nu = 3468923] [ut = 36]
% Looking for a proof at depth = 10 ...
% TIME IS UP!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 82857787
% resolvents: 80449451 factors: 2408336
% Number of unit clauses generated: 5964833
% % unit clauses generated to total clauses generated: 7.20
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 2 [1] = 13 [2] = 12 [3] = 3
% [4] = 6
% Total = 36
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 5964833 [2] = 39180354 [3] = 28766968 [4] = 6815512 [5] = 1874806 [6] = 255314
% Average size of a generated clause: 3.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] c_1 (+)1 (-)2
% [1] d_1 (+)1 (-)2
% [2] e_1 (+)1 (-)2
% [3] f1_1 (+)1 (-)0
% [4] f2_1 (+)1 (-)0
% [5] f3_1 (+)1 (-)0
% [6] f_1 (+)1 (-)0
% [7] g_1 (+)0 (-)1
% [8] r2least_1 (+)0 (-)1
% [9] equalish_2 (+)9 (-)0
% [10] r1_2 (+)1 (-)0
% [11] r2_2 (+)1 (-)0
% [12] r3_2 (+)1 (-)0
% [13] r_2 (+)3 (-)0
% [14] t1_2 (+)1 (-)0
% [15] t2_2 (+)1 (-)0
% [16] t3_2 (+)1 (-)0
% [17] t_2 (+)3 (-)0
% ------------------
% Total: (+)28 (-)8
% Total number of unit clauses retained: 36
% Number of clauses skipped because of their length: 41609030
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 74227485
% Number of successful unifications: 82857787
% Number of unification failures: 113528694
% Number of unit to unit unification failures: 6
% N literal unification failure due to lookup root_id table: 506933133
% N base clause resolution failure due to lookup table: 2084574890
% 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: 3663742
% 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: 4
% Max term depth in a unit clause: 2
% Number of states in UCFA table: 76
% Total number of terms of all unit clauses in table: 102
% 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: 0.75
% Number of symbols (columns) in UCFA: 70
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 196386481
% ConstructUnitClause() = 3663776
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 3.92 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 276193
% | |
% --------------------------------------------------------
% Elapsed time: 303 secs
% CPU time: 300.00 secs
%
%------------------------------------------------------------------------------