TSTP Solution File: MGT032-2 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : MGT032-2 : TPTP v5.0.0. Released v2.4.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 01:56:03 EST 2010
% Result : Unsatisfiable 0.16s
% Output : Refutation 0.16s
% 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/SystemOnTPTP10279/MGT/MGT032-2+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 = 2]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 21] [nf = 0] [nu = 5] [ut = 3]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 73] [nf = 0] [nu = 24] [ut = 7]
% 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(sk2_0())
% B5: ~environment_1(x0) | ~stable_1(x0) | in_environment_2(x0,sk1_1(x0))
% B6: ~environment_1(x0) | ~greater_2(growth_rate_2(x2,x3),growth_rate_2(x1,x3)) | ~subpopulations_4(x1,x2,x0,x3) | selection_favors_3(x2,x1,x3)
% B7: ~environment_1(x0) | ~stable_1(x0) | ~greater_or_equal_2(x1,sk1_1(x0)) | ~subpopulations_4(first_movers_0(),efficient_producers_0(),x0,x1) | greater_2(growth_rate_2(efficient_producers_0(),x1),growth_rate_2(first_movers_0(),x1))
% Unit Clauses:
% --------------
% U1: < d0 v0 dv0 f0 c1 t1 td1 b nc > stable_1(sk2_0())
% U3: < d3 v0 dv0 f3 c2 t5 td3 > greater_or_equal_2(sk3_1(sk1_1(sk2_0())),sk1_1(sk2_0()))
% U4: < d3 v0 dv0 f2 c4 t6 td3 > subpopulations_4(first_movers_0(),efficient_producers_0(),sk2_0(),sk3_1(sk1_1(sk2_0())))
% U5: < d3 v0 dv0 f2 c3 t5 td3 > ~selection_favors_3(efficient_producers_0(),first_movers_0(),sk3_1(sk1_1(sk2_0())))
% U6: < d3 v0 dv0 f6 c4 t10 td4 > ~greater_2(growth_rate_2(efficient_producers_0(),sk3_1(sk1_1(sk2_0()))),growth_rate_2(first_movers_0(),sk3_1(sk1_1(sk2_0()))))
% U7: < d4 v0 dv0 f6 c4 t10 td4 > greater_2(growth_rate_2(efficient_producers_0(),sk3_1(sk1_1(sk2_0()))),growth_rate_2(first_movers_0(),sk3_1(sk1_1(sk2_0()))))
% --------------- Start of Proof ---------------
% Derivation of unit clause U1:
% stable_1(sk2_0()) ....... U1
% Derivation of unit clause U3:
% environment_1(sk2_0()) ....... B0
% ~environment_1(x0) | ~stable_1(x0) | in_environment_2(x0,sk1_1(x0)) ....... B5
% ~stable_1(sk2_0()) | in_environment_2(sk2_0(), sk1_1(sk2_0())) ....... R1 [B0:L0, B5:L0]
% ~in_environment_2(sk2_0(),x0) | greater_or_equal_2(sk3_1(x0),x0) ....... B2
% ~stable_1(sk2_0()) | greater_or_equal_2(sk3_1(sk1_1(sk2_0())), sk1_1(sk2_0())) ....... R2 [R1:L1, B2:L0]
% stable_1(sk2_0()) ....... U1
% greater_or_equal_2(sk3_1(sk1_1(sk2_0())), sk1_1(sk2_0())) ....... R3 [R2:L0, U1:L0]
% Derivation of unit clause U4:
% environment_1(sk2_0()) ....... B0
% ~environment_1(x0) | ~stable_1(x0) | in_environment_2(x0,sk1_1(x0)) ....... B5
% ~stable_1(sk2_0()) | in_environment_2(sk2_0(), sk1_1(sk2_0())) ....... R1 [B0:L0, B5:L0]
% ~in_environment_2(sk2_0(),x0) | subpopulations_4(first_movers_0(),efficient_producers_0(),sk2_0(),sk3_1(x0)) ....... B3
% ~stable_1(sk2_0()) | subpopulations_4(first_movers_0(), efficient_producers_0(), sk2_0(), sk3_1(sk1_1(sk2_0()))) ....... R2 [R1:L1, B3:L0]
% stable_1(sk2_0()) ....... U1
% subpopulations_4(first_movers_0(), efficient_producers_0(), sk2_0(), sk3_1(sk1_1(sk2_0()))) ....... R3 [R2:L0, U1:L0]
% Derivation of unit clause U5:
% environment_1(sk2_0()) ....... B0
% ~environment_1(x0) | ~stable_1(x0) | in_environment_2(x0,sk1_1(x0)) ....... B5
% ~stable_1(sk2_0()) | in_environment_2(sk2_0(), sk1_1(sk2_0())) ....... R1 [B0:L0, B5:L0]
% ~in_environment_2(sk2_0(),x0) | ~selection_favors_3(efficient_producers_0(),first_movers_0(),sk3_1(x0)) ....... B4
% ~stable_1(sk2_0()) | ~selection_favors_3(efficient_producers_0(), first_movers_0(), sk3_1(sk1_1(sk2_0()))) ....... R2 [R1:L1, B4:L0]
% stable_1(sk2_0()) ....... U1
% ~selection_favors_3(efficient_producers_0(), first_movers_0(), sk3_1(sk1_1(sk2_0()))) ....... R3 [R2:L0, U1:L0]
% Derivation of unit clause U6:
% environment_1(sk2_0()) ....... B0
% ~environment_1(x0) | ~greater_2(growth_rate_2(x2,x3),growth_rate_2(x1,x3)) | ~subpopulations_4(x1,x2,x0,x3) | selection_favors_3(x2,x1,x3) ....... B6
% ~greater_2(growth_rate_2(x0, x1), growth_rate_2(x2, x1)) | ~subpopulations_4(x2, x0, sk2_0(), x1) | selection_favors_3(x0, x2, x1) ....... R1 [B0:L0, B6:L0]
% subpopulations_4(first_movers_0(),efficient_producers_0(),sk2_0(),sk3_1(sk1_1(sk2_0()))) ....... U4
% ~greater_2(growth_rate_2(efficient_producers_0(), sk3_1(sk1_1(sk2_0()))), growth_rate_2(first_movers_0(), sk3_1(sk1_1(sk2_0())))) | selection_favors_3(efficient_producers_0(), first_movers_0(), sk3_1(sk1_1(sk2_0()))) ....... R2 [R1:L1, U4:L0]
% ~selection_favors_3(efficient_producers_0(),first_movers_0(),sk3_1(sk1_1(sk2_0()))) ....... U5
% ~greater_2(growth_rate_2(efficient_producers_0(), sk3_1(sk1_1(sk2_0()))), growth_rate_2(first_movers_0(), sk3_1(sk1_1(sk2_0())))) ....... R3 [R2:L1, U5:L0]
% Derivation of unit clause U7:
% environment_1(sk2_0()) ....... B0
% ~environment_1(x0) | ~stable_1(x0) | ~greater_or_equal_2(x1,sk1_1(x0)) | ~subpopulations_4(first_movers_0(),efficient_producers_0(),x0,x1) | greater_2(growth_rate_2(efficient_producers_0(),x1),growth_rate_2(first_movers_0(),x1)) ....... B7
% ~stable_1(sk2_0()) | ~greater_or_equal_2(x0, sk1_1(sk2_0())) | ~subpopulations_4(first_movers_0(), efficient_producers_0(), sk2_0(), x0) | greater_2(growth_rate_2(efficient_producers_0(), x0), growth_rate_2(first_movers_0(), x0)) ....... R1 [B0:L0, B7:L0]
% stable_1(sk2_0()) ....... U1
% ~greater_or_equal_2(x0, sk1_1(sk2_0())) | ~subpopulations_4(first_movers_0(), efficient_producers_0(), sk2_0(), x0) | greater_2(growth_rate_2(efficient_producers_0(), x0), growth_rate_2(first_movers_0(), x0)) ....... R2 [R1:L0, U1:L0]
% greater_or_equal_2(sk3_1(sk1_1(sk2_0())),sk1_1(sk2_0())) ....... U3
% ~subpopulations_4(first_movers_0(), efficient_producers_0(), sk2_0(), sk3_1(sk1_1(sk2_0()))) | greater_2(growth_rate_2(efficient_producers_0(), sk3_1(sk1_1(sk2_0()))), growth_rate_2(first_movers_0(), sk3_1(sk1_1(sk2_0())))) ....... R3 [R2:L0, U3:L0]
% subpopulations_4(first_movers_0(),efficient_producers_0(),sk2_0(),sk3_1(sk1_1(sk2_0()))) ....... U4
% greater_2(growth_rate_2(efficient_producers_0(), sk3_1(sk1_1(sk2_0()))), growth_rate_2(first_movers_0(), sk3_1(sk1_1(sk2_0())))) ....... R4 [R3:L0, U4:L0]
% Derivation of the empty clause:
% greater_2(growth_rate_2(efficient_producers_0(),sk3_1(sk1_1(sk2_0()))),growth_rate_2(first_movers_0(),sk3_1(sk1_1(sk2_0())))) ....... U7
% ~greater_2(growth_rate_2(efficient_producers_0(),sk3_1(sk1_1(sk2_0()))),growth_rate_2(first_movers_0(),sk3_1(sk1_1(sk2_0())))) ....... U6
% [] ....... R1 [U7:L0, U6:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 110
% resolvents: 108 factors: 2
% Number of unit clauses generated: 37
% % unit clauses generated to total clauses generated: 33.64
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 2 [2] = 1 [3] = 4
% [4] = 1
% Total = 8
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 37 [2] = 49 [3] = 19 [4] = 5
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] environment_1 (+)1 (-)0
% [1] stable_1 (+)1 (-)0
% [2] greater_2 (+)1 (-)1
% [3] greater_or_equal_2 (+)1 (-)0
% [4] in_environment_2 (+)1 (-)0
% [5] selection_favors_3 (+)0 (-)1
% [6] subpopulations_4 (+)1 (-)0
% ------------------
% Total: (+)6 (-)2
% Total number of unit clauses retained: 8
% Number of clauses skipped because of their length: 78
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 0
% Number of successful unifications: 126
% Number of unification failures: 0
% Number of unit to unit unification failures: 0
% N literal unification failure due to lookup root_id table: 347
% N base clause resolution failure due to lookup table: 138
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 6
% N unit clauses dropped because they exceeded max values: 17
% 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: 10
% Max term depth in a unit clause: 4
% Number of states in UCFA table: 44
% Total number of terms of all unit clauses in table: 41
% Max allowed number of states in UCFA: 112000
% Ratio n states used/total allowed states: 0.00
% Ratio n states used/total unit clauses terms: 1.07
% Number of symbols (columns) in UCFA: 47
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 126
% ConstructUnitClause() = 23
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 0.00 secs
% --------------------------------------------------------
% | |
% Inferences per sec: inf
% | |
% --------------------------------------------------------
% Elapsed time: 0 secs
% CPU time: 0.16 secs
%
%------------------------------------------------------------------------------