TSTP Solution File: MGT002-1 by CARINE---0.734
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CARINE---0.734
% Problem : MGT002-1 : TPTP v5.0.0. Released v2.4.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 : Sun Nov 28 01:52:01 EST 2010
% Result : Unsatisfiable 122.97s
% Output : Refutation 122.97s
% 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/SystemOnTPTP4593/MGT/MGT002-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 = 14] [nf = 0] [nu = 8] [ut = 9]
% Looking for a proof at depth = 2 ...
% t = 0 secs [nr = 70] [nf = 0] [nu = 34] [ut = 9]
% Looking for a proof at depth = 3 ...
% t = 0 secs [nr = 294] [nf = 0] [nu = 132] [ut = 9]
% Looking for a proof at depth = 4 ...
% t = 0 secs [nr = 1190] [nf = 0] [nu = 518] [ut = 9]
% Looking for a proof at depth = 5 ...
% t = 0 secs [nr = 4774] [nf = 0] [nu = 2056] [ut = 9]
% Looking for a proof at depth = 6 ...
% t = 0 secs [nr = 19110] [nf = 0] [nu = 8202] [ut = 9]
% Looking for a proof at depth = 7 ...
% t = 0 secs [nr = 76454] [nf = 0] [nu = 32780] [ut = 9]
% Looking for a proof at depth = 8 ...
% t = 1 secs [nr = 305830] [nf = 0] [nu = 131086] [ut = 9]
% Looking for a proof at depth = 9 ...
% t = 2 secs [nr = 1223334] [nf = 0] [nu = 524304] [ut = 9]
% Looking for a proof at depth = 10 ...
% t = 8 secs [nr = 4893350] [nf = 0] [nu = 2097170] [ut = 9]
% Looking for a proof at depth = 11 ...
% t = 32 secs [nr = 19573414] [nf = 0] [nu = 8388628] [ut = 9]
% Looking for a proof at depth = 12 ...
% Entering time slice 2
% Updating parameters ... done.
% Looking for a proof at depth = 1 ...
% t = 122 secs [nr = 75538206] [nf = 52] [nu = 32373543] [ut = 11]
% Looking for a proof at depth = 2 ...
% t = 122 secs [nr = 75538266] [nf = 52] [nu = 32373573] [ut = 11]
% Looking for a proof at depth = 3 ...
% t = 122 secs [nr = 75538494] [nf = 52] [nu = 32373675] [ut = 11]
% Looking for a proof at depth = 4 ...
% t = 122 secs [nr = 75539394] [nf = 52] [nu = 32374065] [ut = 11]
% Looking for a proof at depth = 5 ...
% t = 122 secs [nr = 75542989] [nf = 62] [nu = 32375607] [ut = 11]
% Looking for a proof at depth = 6 ...
% t = 122 secs [nr = 75561303] [nf = 280] [nu = 32382237] [ut = 12]
% Looking for a proof at depth = 7 ...
% t = 123 secs [nr = 75658555] [nf = 1066] [nu = 32411799] [ut = 12]
% Looking for a proof at depth = 8 ...
% t = 123 secs [nr = 76082567] [nf = 1604] [nu = 32520153] [ut = 12]
% Looking for a proof at depth = 9 ...
% +================================================+
% | |
% | Congratulations!!! ........ A proof was found. |
% | |
% +================================================+
% Base Clauses and Unit Clauses used in proof:
% ============================================
% Base Clauses:
% -------------
% B0: greater_2(sk6_0(),sk5_0())
% B1: organization_2(sk2_0(),sk5_0())
% B2: organization_2(sk2_0(),sk6_0())
% B5: reorganization_free_3(sk2_0(),sk5_0(),sk6_0())
% B7: ~reorganization_free_3(x0,x1,x2) | reorganization_free_3(x0,x1,x1)
% B8: ~reorganization_free_3(x0,x1,x2) | reorganization_free_3(x0,x2,x2)
% B9: ~organization_2(x0,x1) | reproducibility_3(x0,sk1_2(x1,x0),x1)
% B10: ~greater_2(x2,x1) | ~organization_2(x0,x2) | ~organization_2(x0,x1) | ~reorganization_free_3(x0,x1,x2) | ~reproducibility_3(x0,x4,x2) | ~reproducibility_3(x0,x3,x1) | greater_2(x4,x3)
% B11: ~greater_2(x5,x4) | ~organization_2(x2,x3) | ~organization_2(x0,x1) | ~inertia_3(x2,x7,x3) | ~inertia_3(x0,x6,x1) | ~reorganization_free_3(x2,x3,x3) | ~reorganization_free_3(x0,x1,x1) | ~reproducibility_3(x2,x5,x3) | ~reproducibility_3(x0,x4,x1) | greater_2(x7,x6)
% Unit Clauses:
% --------------
% U1: < d0 v0 dv0 f0 c2 t2 td1 b nc > organization_2(sk2_0(),sk5_0())
% U2: < d0 v0 dv0 f0 c2 t2 td1 b nc > organization_2(sk2_0(),sk6_0())
% U3: < d0 v0 dv0 f0 c3 t3 td1 b nc > inertia_3(sk2_0(),sk3_0(),sk5_0())
% U4: < d0 v0 dv0 f0 c3 t3 td1 b nc > inertia_3(sk2_0(),sk4_0(),sk6_0())
% U5: < d0 v0 dv0 f0 c3 t3 td1 b nc > reorganization_free_3(sk2_0(),sk5_0(),sk6_0())
% U6: < d0 v0 dv0 f0 c2 t2 td1 b nc > ~greater_2(sk4_0(),sk3_0())
% U7: < d1 v0 dv0 f0 c3 t3 td1 > reorganization_free_3(sk2_0(),sk5_0(),sk5_0())
% U8: < d1 v0 dv0 f0 c3 t3 td1 > reorganization_free_3(sk2_0(),sk6_0(),sk6_0())
% U9: < d1 v0 dv0 f1 c4 t5 td2 > reproducibility_3(sk2_0(),sk1_2(sk5_0(),sk2_0()),sk5_0())
% U10: < d1 v0 dv0 f1 c4 t5 td2 > reproducibility_3(sk2_0(),sk1_2(sk6_0(),sk2_0()),sk6_0())
% U11: < d6 v0 dv0 f2 c4 t6 td2 > greater_2(sk1_2(sk6_0(),sk2_0()),sk1_2(sk5_0(),sk2_0()))
% U12: < d9 v0 dv0 f0 c2 t2 td1 > greater_2(sk4_0(),sk3_0())
% --------------- Start of Proof ---------------
% Derivation of unit clause U1:
% organization_2(sk2_0(),sk5_0()) ....... U1
% Derivation of unit clause U2:
% organization_2(sk2_0(),sk6_0()) ....... U2
% Derivation of unit clause U3:
% inertia_3(sk2_0(),sk3_0(),sk5_0()) ....... U3
% Derivation of unit clause U4:
% inertia_3(sk2_0(),sk4_0(),sk6_0()) ....... U4
% Derivation of unit clause U5:
% reorganization_free_3(sk2_0(),sk5_0(),sk6_0()) ....... U5
% Derivation of unit clause U6:
% ~greater_2(sk4_0(),sk3_0()) ....... U6
% Derivation of unit clause U7:
% reorganization_free_3(sk2_0(),sk5_0(),sk6_0()) ....... B5
% ~reorganization_free_3(x0,x1,x2) | reorganization_free_3(x0,x1,x1) ....... B7
% reorganization_free_3(sk2_0(), sk5_0(), sk5_0()) ....... R1 [B5:L0, B7:L0]
% Derivation of unit clause U8:
% reorganization_free_3(sk2_0(),sk5_0(),sk6_0()) ....... B5
% ~reorganization_free_3(x0,x1,x2) | reorganization_free_3(x0,x2,x2) ....... B8
% reorganization_free_3(sk2_0(), sk6_0(), sk6_0()) ....... R1 [B5:L0, B8:L0]
% Derivation of unit clause U9:
% organization_2(sk2_0(),sk5_0()) ....... B1
% ~organization_2(x0,x1) | reproducibility_3(x0,sk1_2(x1,x0),x1) ....... B9
% reproducibility_3(sk2_0(), sk1_2(sk5_0(), sk2_0()), sk5_0()) ....... R1 [B1:L0, B9:L0]
% Derivation of unit clause U10:
% organization_2(sk2_0(),sk6_0()) ....... B2
% ~organization_2(x0,x1) | reproducibility_3(x0,sk1_2(x1,x0),x1) ....... B9
% reproducibility_3(sk2_0(), sk1_2(sk6_0(), sk2_0()), sk6_0()) ....... R1 [B2:L0, B9:L0]
% Derivation of unit clause U11:
% greater_2(sk6_0(),sk5_0()) ....... B0
% ~greater_2(x2,x1) | ~organization_2(x0,x2) | ~organization_2(x0,x1) | ~reorganization_free_3(x0,x1,x2) | ~reproducibility_3(x0,x4,x2) | ~reproducibility_3(x0,x3,x1) | greater_2(x4,x3) ....... B10
% ~organization_2(x0, sk6_0()) | ~organization_2(x0, sk5_0()) | ~reorganization_free_3(x0, sk5_0(), sk6_0()) | ~reproducibility_3(x0, x1, sk6_0()) | ~reproducibility_3(x0, x2, sk5_0()) | greater_2(x1, x2) ....... R1 [B0:L0, B10:L0]
% organization_2(sk2_0(),sk6_0()) ....... U2
% ~organization_2(sk2_0(), sk5_0()) | ~reorganization_free_3(sk2_0(), sk5_0(), sk6_0()) | ~reproducibility_3(sk2_0(), x0, sk6_0()) | ~reproducibility_3(sk2_0(), x1, sk5_0()) | greater_2(x0, x1) ....... R2 [R1:L0, U2:L0]
% organization_2(sk2_0(),sk5_0()) ....... U1
% ~reorganization_free_3(sk2_0(), sk5_0(), sk6_0()) | ~reproducibility_3(sk2_0(), x0, sk6_0()) | ~reproducibility_3(sk2_0(), x1, sk5_0()) | greater_2(x0, x1) ....... R3 [R2:L0, U1:L0]
% reorganization_free_3(sk2_0(),sk5_0(),sk6_0()) ....... U5
% ~reproducibility_3(sk2_0(), x0, sk6_0()) | ~reproducibility_3(sk2_0(), x1, sk5_0()) | greater_2(x0, x1) ....... R4 [R3:L0, U5:L0]
% reproducibility_3(sk2_0(),sk1_2(sk6_0(),sk2_0()),sk6_0()) ....... U10
% ~reproducibility_3(sk2_0(), x0, sk5_0()) | greater_2(sk1_2(sk6_0(), sk2_0()), x0) ....... R5 [R4:L0, U10:L0]
% reproducibility_3(sk2_0(),sk1_2(sk5_0(),sk2_0()),sk5_0()) ....... U9
% greater_2(sk1_2(sk6_0(), sk2_0()), sk1_2(sk5_0(), sk2_0())) ....... R6 [R5:L0, U9:L0]
% Derivation of unit clause U12:
% organization_2(sk2_0(),sk5_0()) ....... B1
% ~greater_2(x5,x4) | ~organization_2(x2,x3) | ~organization_2(x0,x1) | ~inertia_3(x2,x7,x3) | ~inertia_3(x0,x6,x1) | ~reorganization_free_3(x2,x3,x3) | ~reorganization_free_3(x0,x1,x1) | ~reproducibility_3(x2,x5,x3) | ~reproducibility_3(x0,x4,x1) | greater_2(x7,x6) ....... B11
% ~greater_2(x0, x1) | ~organization_2(x2, x3) | ~inertia_3(x2, x4, x3) | ~inertia_3(sk2_0(), x5, sk5_0()) | ~reorganization_free_3(x2, x3, x3) | ~reorganization_free_3(sk2_0(), sk5_0(), sk5_0()) | ~reproducibility_3(x2, x0, x3) | ~reproducibility_3(sk2_0(), x1, sk5_0()) | greater_2(x4, x5) ....... R1 [B1:L0, B11:L2]
% greater_2(sk1_2(sk6_0(),sk2_0()),sk1_2(sk5_0(),sk2_0())) ....... U11
% ~organization_2(x0, x1) | ~inertia_3(x0, x2, x1) | ~inertia_3(sk2_0(), x3, sk5_0()) | ~reorganization_free_3(x0, x1, x1) | ~reorganization_free_3(sk2_0(), sk5_0(), sk5_0()) | ~reproducibility_3(x0, sk1_2(sk6_0(), sk2_0()), x1) | ~reproducibility_3(sk2_0(), sk1_2(sk5_0(), sk2_0()), sk5_0()) | greater_2(x2, x3) ....... R2 [R1:L0, U11:L0]
% organization_2(sk2_0(),sk6_0()) ....... U2
% ~inertia_3(sk2_0(), x0, sk6_0()) | ~inertia_3(sk2_0(), x1, sk5_0()) | ~reorganization_free_3(sk2_0(), sk6_0(), sk6_0()) | ~reorganization_free_3(sk2_0(), sk5_0(), sk5_0()) | ~reproducibility_3(sk2_0(), sk1_2(sk6_0(), sk2_0()), sk6_0()) | ~reproducibility_3(sk2_0(), sk1_2(sk5_0(), sk2_0()), sk5_0()) | greater_2(x0, x1) ....... R3 [R2:L0, U2:L0]
% inertia_3(sk2_0(),sk4_0(),sk6_0()) ....... U4
% ~inertia_3(sk2_0(), x0, sk5_0()) | ~reorganization_free_3(sk2_0(), sk6_0(), sk6_0()) | ~reorganization_free_3(sk2_0(), sk5_0(), sk5_0()) | ~reproducibility_3(sk2_0(), sk1_2(sk6_0(), sk2_0()), sk6_0()) | ~reproducibility_3(sk2_0(), sk1_2(sk5_0(), sk2_0()), sk5_0()) | greater_2(sk4_0(), x0) ....... R4 [R3:L0, U4:L0]
% inertia_3(sk2_0(),sk3_0(),sk5_0()) ....... U3
% ~reorganization_free_3(sk2_0(), sk6_0(), sk6_0()) | ~reorganization_free_3(sk2_0(), sk5_0(), sk5_0()) | ~reproducibility_3(sk2_0(), sk1_2(sk6_0(), sk2_0()), sk6_0()) | ~reproducibility_3(sk2_0(), sk1_2(sk5_0(), sk2_0()), sk5_0()) | greater_2(sk4_0(), sk3_0()) ....... R5 [R4:L0, U3:L0]
% reorganization_free_3(sk2_0(),sk6_0(),sk6_0()) ....... U8
% ~reorganization_free_3(sk2_0(), sk5_0(), sk5_0()) | ~reproducibility_3(sk2_0(), sk1_2(sk6_0(), sk2_0()), sk6_0()) | ~reproducibility_3(sk2_0(), sk1_2(sk5_0(), sk2_0()), sk5_0()) | greater_2(sk4_0(), sk3_0()) ....... R6 [R5:L0, U8:L0]
% reorganization_free_3(sk2_0(),sk5_0(),sk5_0()) ....... U7
% ~reproducibility_3(sk2_0(), sk1_2(sk6_0(), sk2_0()), sk6_0()) | ~reproducibility_3(sk2_0(), sk1_2(sk5_0(), sk2_0()), sk5_0()) | greater_2(sk4_0(), sk3_0()) ....... R7 [R6:L0, U7:L0]
% reproducibility_3(sk2_0(),sk1_2(sk6_0(),sk2_0()),sk6_0()) ....... U10
% ~reproducibility_3(sk2_0(), sk1_2(sk5_0(), sk2_0()), sk5_0()) | greater_2(sk4_0(), sk3_0()) ....... R8 [R7:L0, U10:L0]
% reproducibility_3(sk2_0(),sk1_2(sk5_0(),sk2_0()),sk5_0()) ....... U9
% greater_2(sk4_0(), sk3_0()) ....... R9 [R8:L0, U9:L0]
% Derivation of the empty clause:
% greater_2(sk4_0(),sk3_0()) ....... U12
% ~greater_2(sk4_0(),sk3_0()) ....... U6
% [] ....... R1 [U12:L0, U6:L0]
% --------------- End of Proof ---------------
% PROOF FOUND!
% ---------------------------------------------
% | Statistics |
% ---------------------------------------------
% Profile 3: Performance Statistics:
% ==================================
% Total number of generated clauses: 76470515
% resolvents: 76457104 factors: 13411
% Number of unit clauses generated: 32524235
% % unit clauses generated to total clauses generated: 42.53
% Number of unit clauses constructed and retained at depth [x]:
% =============================================================
% [0] = 7 [1] = 4 [6] = 1 [9] = 1
% Total = 13
% Number of generated clauses having [x] literals:
% ------------------------------------------------
% [1] = 32524235 [2] = 43492869 [3] = 242653 [4] = 139807 [5] = 53914 [6] = 13846
% [7] = 2605 [8] = 498 [9] = 84 [10] = 4
% Average size of a generated clause: 2.0
% Number of unit clauses per predicate list:
% ==========================================
% [0] greater_2 (+)3 (-)1
% [1] organization_2 (+)2 (-)0
% [2] inertia_3 (+)2 (-)0
% [3] reorganization_free_3 (+)3 (-)0
% [4] reproducibility_3 (+)2 (-)0
% ------------------
% Total: (+)12 (-)1
% Total number of unit clauses retained: 13
% Number of clauses skipped because of their length: 214829
% N base clauses skippped in resolve-with-all-base-clauses
% because of the shortest resolvents table: 116712
% Number of successful unifications: 76470534
% Number of unification failures: 1773137
% Number of unit to unit unification failures: 2
% N literal unification failure due to lookup root_id table: 48890133
% N base clause resolution failure due to lookup table: 197556
% N UC-BCL resolution dropped due to lookup table: 0
% Max entries in substitution set: 36
% N unit clauses dropped because they exceeded max values: 24388671
% 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: 6
% Max term depth in a unit clause: 2
% Number of states in UCFA table: 30
% Total number of terms of all unit clauses in table: 41
% 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.73
% Number of symbols (columns) in UCFA: 45
% Profile 2: Number of calls to:
% ==============================
% PTUnify() = 78243671
% ConstructUnitClause() = 24388677
% Profile 1: Time spent in:
% =========================
% ConstructUnitClause() : 26.16 secs
% --------------------------------------------------------
% | |
% Inferences per sec: 626808
% | |
% --------------------------------------------------------
% Elapsed time: 124 secs
% CPU time: 122.94 secs
%
%------------------------------------------------------------------------------