TSTP Solution File: MGT036-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : MGT036-1 : TPTP v5.0.0. Released v2.4.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 01:57:11 EST 2010
% Result : Unsatisfiable 0.71s
% Output : Refutation 0.71s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Command entered:
% /home/graph/tptp/Systems/CARINE---0.734/carine /tmp/SystemOnTPTP9915/MGT/MGT036-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 = 2] [nf = 0] [nu = 0] [ut = 4]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 20] [nf = 0] [nu = 2] [ut = 5]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 136] [nf = 1] [nu = 19] [ut = 7]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 962] [nf = 17] [nu = 287] [ut = 13]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 2728] [nf = 93] [nu = 959] [ut = 13]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 6198] [nf = 225] [nu = 2238] [ut = 13]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 11960] [nf = 699] [nu = 4181] [ut = 13]
% Looking for a proof at depth = 8 ...
% t = 0 secs [nr = 19902] [nf = 1464] [nu = 6736] [ut = 13]
% Looking for a proof at depth = 9 ...
% t = 0 secs [nr = 29618] [nf = 2500] [nu = 9670] [ut = 13]
% Looking for a proof at depth = 10 ...
% t = 0 secs [nr = 40392] [nf = 3832] [nu = 12736] [ut = 13]
% Looking for a proof at depth = 11 ...
% t = 0 secs [nr = 51402] [nf = 5254] [nu = 15802] [ut = 13]
% Looking for a proof at depth = 12 ...
% t = 0 secs [nr = 62412] [nf = 6676] [nu = 18868] [ut = 13]
% Looking for a proof at depth = 13 ...
% t = 0 secs [nr = 73422] [nf = 8098] [nu = 21934] [ut = 13]
% Looking for a proof at depth = 14 ...
% t = 0 secs [nr = 84432] [nf = 9520] [nu = 25000] [ut = 13]
% Looking for a proof at depth = 15 ...
% t = 0 secs [nr = 95442] [nf = 10942] [nu = 28066] [ut = 13]
% Looking for a proof at depth = 16 ...
% t = 0 secs [nr = 106452] [nf = 12364] [nu = 31132] [ut = 13]
% Looking for a proof at depth = 17 ...
% t = 0 secs [nr = 117462] [nf = 13786] [nu = 34198] [ut = 13]
% Looking for a proof at depth = 18 ...
% t = 0 secs [nr = 128472] [nf = 15208] [nu = 37264] [ut = 13]
% Looking for a proof at depth = 19 ...
% t = 0 secs [nr = 139482] [nf = 16630] [nu = 40330] [ut = 13]
% Looking for a proof at depth = 20 ...
% t = 0 secs [nr = 150492] [nf = 18052] [nu = 43396] [ut = 13]
% Looking for a proof at depth = 21 ...
% t = 0 secs [nr = 161502] [nf = 19474] [nu = 46462] [ut = 13]
% Looking for a proof at depth = 22 ...
% t = 0 secs [nr = 172512] [nf = 20896] [nu = 49528] [ut = 13]
% Looking for a proof at depth = 23 ...
% t = 1 secs [nr = 183522] [nf = 22318] [nu = 52594] [ut = 13]
% Looking for a proof at depth = 24 ...
% t = 1 secs [nr = 194532] [nf = 23740] [nu = 55660] [ut = 13]
% Looking for a proof at depth = 25 ...
% t = 1 secs [nr = 205542] [nf = 25162] [nu = 58726] [ut = 13]
% Looking for a proof at depth = 26 ...
% t = 1 secs [nr = 216552] [nf = 26584] [nu = 61792] [ut = 13]
% Looking for a proof at depth = 27 ...
% t = 1 secs [nr = 227562] [nf = 28006] [nu = 64858] [ut = 13]
% Looking for a proof at depth = 28 ...
% t = 1 secs [nr = 238572] [nf = 29428] [nu = 67924] [ut = 13]
% Looking for a proof at depth = 29 ...
% t = 1 secs [nr = 249582] [nf = 30850] [nu = 70990] [ut = 13]
% Looking for a proof at depth = 30 ...
% t = 1 secs [nr = 260592] [nf = 32272] [nu = 74056] [ut = 13]
% Restarting search with different parameters.
% Looking for a proof at depth = 1 ...
% t = 1 secs [nr = 260600] [nf = 32272] [nu = 74060] [ut = 13]
% Looking for a proof at depth = 2 ...
% t = 1 secs [nr = 260636] [nf = 32272] [nu = 74070] [ut = 14]
% Looking for a proof at depth = 3 ...
% t = 1 secs [nr = 260923] [nf = 32276] [nu = 74134] [ut = 14]
% Looking for a proof at depth = 4 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: environment_1(sk1_0())
% B7: ~environment_1(x0) | ~subpopulations_4(first_movers_0(),efficient_producers_0(),x0,x1) | in_environment_2(x0,x1)
% B8: ~environment_1(x0) | ~subpopulations_4(first_movers_0(),efficient_producers_0(),x0,x1) | subpopulations_4(efficient_producers_0(),first_movers_0(),x0,x1)
% B9: ~environment_1(x0) | ~outcompetes_3(x2,x1,x3) | ~subpopulations_4(x1,x2,x0,x3) | greater_2(zero_0(),growth_rate_2(x1,x3))
% B10: ~environment_1(x0) | ~outcompetes_3(x2,x1,x3) | ~subpopulations_4(x1,x2,x0,x3) | greater_or_equal_2(growth_rate_2(x2,x3),zero_0())
% B12: ~environment_1(x0) | ~greater_2(zero_0(),growth_rate_2(x3,x1)) | ~greater_2(resilience_1(x3),resilience_1(x2)) | ~in_environment_2(x0,x1) | greater_2(zero_0(),growth_rate_2(x2,x1))
% Unit Clauses:
% --------------
% U1: < d0 v0 dv0 f0 c4 t4 td1 b nc > subpopulations_4(first_movers_0(),efficient_producers_0(),sk1_0(),sk2_0())
% U2: < d0 v0 dv0 f0 c3 t3 td1 b nc > outcompetes_3(first_movers_0(),efficient_producers_0(),sk2_0())
% U3: < d0 v0 dv0 f2 c2 t4 td2 b > greater_2(resilience_1(efficient_producers_0()),resilience_1(first_movers_0()))
% U4: < d2 v0 dv0 f0 c4 t4 td1 > subpopulations_4(efficient_producers_0(),first_movers_0(),sk1_0(),sk2_0())
% U5: < d3 v0 dv0 f1 c3 t4 td2 > greater_2(zero_0(),growth_rate_2(efficient_producers_0(),sk2_0()))
% U11: < d4 v0 dv0 f1 c3 t4 td2 > ~greater_2(zero_0(),growth_rate_2(first_movers_0(),sk2_0()))
% U13: < d2 v0 dv0 f0 c2 t2 td1 > in_environment_2(sk1_0(),sk2_0())
% U14: < d4 v0 dv0 f1 c3 t4 td2 > greater_2(zero_0(),growth_rate_2(first_movers_0(),sk2_0()))
% --------------- Start of Proof ---------------
% Derivation of unit clause U1:
% subpopulations_4(first_movers_0(),efficient_producers_0(),sk1_0(),sk2_0()) ....... U1
% Derivation of unit clause U2:
% outcompetes_3(first_movers_0(),efficient_producers_0(),sk2_0()) ....... U2
% Derivation of unit clause U3:
% greater_2(resilience_1(efficient_producers_0()),resilience_1(first_movers_0())) ....... U3
% Derivation of unit clause U4:
% environment_1(sk1_0()) ....... B0
% ~environment_1(x0) | ~subpopulations_4(first_movers_0(),efficient_producers_0(),x0,x1) | subpopulations_4(efficient_producers_0(),first_movers_0(),x0,x1) ....... B8
% ~subpopulations_4(first_movers_0(), efficient_producers_0(), sk1_0(), x0) | subpopulations_4(efficient_producers_0(), first_movers_0(), sk1_0(), x0) ....... R1 [B0:L0, B8:L0]
% subpopulations_4(first_movers_0(),efficient_producers_0(),sk1_0(),sk2_0()) ....... U1
% subpopulations_4(efficient_producers_0(), first_movers_0(), sk1_0(), sk2_0()) ....... R2 [R1:L0, U1:L0]
% Derivation of unit clause U5:
% environment_1(sk1_0()) ....... B0
% ~environment_1(x0) | ~outcompetes_3(x2,x1,x3) | ~subpopulations_4(x1,x2,x0,x3) | greater_2(zero_0(),growth_rate_2(x1,x3)) ....... B9
% ~outcompetes_3(x0, x1, x2) | ~subpopulations_4(x1, x0, sk1_0(), x2) | greater_2(zero_0(), growth_rate_2(x1, x2)) ....... R1 [B0:L0, B9:L0]
% outcompetes_3(first_movers_0(),efficient_producers_0(),sk2_0()) ....... U2
% ~subpopulations_4(efficient_producers_0(), first_movers_0(), sk1_0(), sk2_0()) | greater_2(zero_0(), growth_rate_2(efficient_producers_0(), sk2_0())) ....... R2 [R1:L0, U2:L0]
% subpopulations_4(efficient_producers_0(),first_movers_0(),sk1_0(),sk2_0()) ....... U4
% greater_2(zero_0(), growth_rate_2(efficient_producers_0(), sk2_0())) ....... R3 [R2:L0, U4:L0]
% Derivation of unit clause U11:
% environment_1(sk1_0()) ....... B0
% ~environment_1(x0) | ~outcompetes_3(x2,x1,x3) | ~subpopulations_4(x1,x2,x0,x3) | greater_or_equal_2(growth_rate_2(x2,x3),zero_0()) ....... B10
% ~outcompetes_3(x0, x1, x2) | ~subpopulations_4(x1, x0, sk1_0(), x2) | greater_or_equal_2(growth_rate_2(x0, x2), zero_0()) ....... R1 [B0:L0, B10:L0]
% outcompetes_3(first_movers_0(),efficient_producers_0(),sk2_0()) ....... U2
% ~subpopulations_4(efficient_producers_0(), first_movers_0(), sk1_0(), sk2_0()) | greater_or_equal_2(growth_rate_2(first_movers_0(), sk2_0()), zero_0()) ....... R2 [R1:L0, U2:L0]
% ~greater_2(zero_0(),growth_rate_2(x0,x1)) | ~greater_or_equal_2(growth_rate_2(x0,x1),zero_0()) ....... B6
% ~subpopulations_4(efficient_producers_0(), first_movers_0(), sk1_0(), sk2_0()) | ~greater_2(zero_0(), growth_rate_2(first_movers_0(), sk2_0())) ....... R3 [R2:L1, B6:L1]
% subpopulations_4(efficient_producers_0(),first_movers_0(),sk1_0(),sk2_0()) ....... U4
% ~greater_2(zero_0(), growth_rate_2(first_movers_0(), sk2_0())) ....... R4 [R3:L0, U4:L0]
% Derivation of unit clause U13:
% environment_1(sk1_0()) ....... B0
% ~environment_1(x0) | ~subpopulations_4(first_movers_0(),efficient_producers_0(),x0,x1) | in_environment_2(x0,x1) ....... B7
% ~subpopulations_4(first_movers_0(), efficient_producers_0(), sk1_0(), x0) | in_environment_2(sk1_0(), x0) ....... R1 [B0:L0, B7:L0]
% subpopulations_4(first_movers_0(),efficient_producers_0(),sk1_0(),sk2_0()) ....... U1
% in_environment_2(sk1_0(), sk2_0()) ....... R2 [R1:L0, U1:L0]
% Derivation of unit clause U14:
% environment_1(sk1_0()) ....... B0
% ~environment_1(x0) | ~greater_2(zero_0(),growth_rate_2(x3,x1)) | ~greater_2(resilience_1(x3),resilience_1(x2)) | ~in_environment_2(x0,x1) | greater_2(zero_0(),growth_rate_2(x2,x1)) ....... B12
% ~greater_2(zero_0(), growth_rate_2(x0, x1)) | ~greater_2(resilience_1(x0), resilience_1(x2)) | ~in_environment_2(sk1_0(), x1) | greater_2(zero_0(), growth_rate_2(x2, x1)) ....... R1 [B0:L0, B12:L0]
% greater_2(zero_0(),growth_rate_2(efficient_producers_0(),sk2_0())) ....... U5
% ~greater_2(resilience_1(efficient_producers_0()), resilience_1(x0)) | ~in_environment_2(sk1_0(), sk2_0()) | greater_2(zero_0(), growth_rate_2(x0, sk2_0())) ....... R2 [R1:L0, U5:L0]
% greater_2(resilience_1(efficient_producers_0()),resilience_1(first_movers_0())) ....... U3
% ~in_environment_2(sk1_0(), sk2_0()) | greater_2(zero_0(), growth_rate_2(first_movers_0(), sk2_0())) ....... R3 [R2:L0, U3:L0]
% in_environment_2(sk1_0(),sk2_0()) ....... U13
% greater_2(zero_0(), growth_rate_2(first_movers_0(), sk2_0())) ....... R4 [R3:L0, U13:L0]
% Derivation of the empty clause:
% greater_2(zero_0(),growth_rate_2(first_movers_0(),sk2_0())) ....... U14
% ~greater_2(zero_0(),growth_rate_2(first_movers_0(),sk2_0())) ....... U11
% [] ....... R1 [U14:L0, U11:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 293547
% resolvents: 261267 factors: 32280
% Number of unit clauses generated: 74247
% % unit clauses generated to total clauses generated: 25.29
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 4 [2] = 2 [3] = 2
% [4] = 7
% Total = 15
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 74247 [2] = 154998 [3] = 64280 [4] = 22
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] environment_1 (+)2 (-)0
% [1] greater_2 (+)3 (-)1
% [2] greater_or_equal_2 (+)1 (-)1
% [3] in_environment_2 (+)1 (-)0
% [4] outcompetes_3 (+)1 (-)2
% [5] subpopulations_4 (+)3 (-)0
% ------------------
% Total: (+)11 (-)4
% Total number of unit clauses retained: 15
% Number of clauses skipped because of their length: 9899
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 17
% Number of successful unifications: 293562
% Number of unification failures: 263647
% Number of unit to unit unification failures: 5
% N literal unification failure due to lookup root_id table: 1483255
% N base clause resolution failure due to lookup table: 1104933
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 23
% N unit clauses dropped because they exceeded max values: 3165
% 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: 42
% Total number of terms of all unit clauses in table: 49
% 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.86
% Number of symbols (columns) in UCFA: 47
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 557209
% ConstructUnitClause() = 3176
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 1 secs
% CPU time: 0.71 secs
%
%------------------------------------------------------------------------------