%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : MGT003-1 : TPTP v5.0.0. Released v2.4.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 01:53:53 EST 2010 % Result : Unsatisfiable 32.98s % Output : Refutation 32.98s % 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/SystemOnTPTP13988/MGT/MGT003-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 = 1 secs [nr = 14] [nf = 0] [nu = 8] [ut = 9] % Looking for a proof at depth = 2 ... % t = 1 secs [nr = 70] [nf = 0] [nu = 34] [ut = 9] % Looking for a proof at depth = 3 ... % t = 1 secs [nr = 294] [nf = 0] [nu = 132] [ut = 9] % Looking for a proof at depth = 4 ... % t = 1 secs [nr = 1190] [nf = 0] [nu = 518] [ut = 9] % Looking for a proof at depth = 5 ... % t = 1 secs [nr = 4774] [nf = 0] [nu = 2056] [ut = 9] % Looking for a proof at depth = 6 ... % t = 1 secs [nr = 19110] [nf = 0] [nu = 8202] [ut = 9] % Looking for a proof at depth = 7 ... % t = 1 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 = 3 secs [nr = 1223334] [nf = 0] [nu = 524304] [ut = 9] % Looking for a proof at depth = 10 ... % t = 9 secs [nr = 4893350] [nf = 0] [nu = 2097170] [ut = 9] % Looking for a proof at depth = 11 ... % Entering time slice 2 % Updating parameters ... done. % Looking for a proof at depth = 1 ... % t = 31 secs [nr = 18893805] [nf = 30] [nu = 8097370] [ut = 11] % Looking for a proof at depth = 2 ... % t = 31 secs [nr = 18893865] [nf = 30] [nu = 8097400] [ut = 11] % Looking for a proof at depth = 3 ... % t = 31 secs [nr = 18894093] [nf = 30] [nu = 8097502] [ut = 11] % Looking for a proof at depth = 4 ... % t = 31 secs [nr = 18894993] [nf = 30] [nu = 8097892] [ut = 11] % Looking for a proof at depth = 5 ... % t = 31 secs [nr = 18898588] [nf = 40] [nu = 8099434] [ut = 11] % Looking for a proof at depth = 6 ... % t = 32 secs [nr = 18916902] [nf = 258] [nu = 8106064] [ut = 12] % Looking for a proof at depth = 7 ... % t = 32 secs [nr = 19014154] [nf = 1044] [nu = 8135626] [ut = 12] % Looking for a proof at depth = 8 ... % t = 33 secs [nr = 19438156] [nf = 1522] [nu = 8243980] [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()) % B3: 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) | inertia_3(x0,sk1_2(x1,x0),x1) % B10: ~greater_2(x2,x1) | ~organization_2(x0,x2) | ~organization_2(x0,x1) | ~inertia_3(x0,x4,x2) | ~inertia_3(x0,x3,x1) | ~reorganization_free_3(x0,x1,x2) | greater_2(x4,x3) % B11: ~greater_2(x5,x4) | ~organization_2(x2,x3) | ~organization_2(x0,x1) | ~inertia_3(x2,x5,x3) | ~inertia_3(x0,x4,x1) | ~reorganization_free_3(x2,x3,x3) | ~reorganization_free_3(x0,x1,x1) | ~survival_chance_3(x2,x7,x3) | ~survival_chance_3(x0,x6,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 > reorganization_free_3(sk2_0(),sk5_0(),sk6_0()) % U4: < d0 v0 dv0 f0 c3 t3 td1 b nc > survival_chance_3(sk2_0(),sk3_0(),sk5_0()) % U5: < d0 v0 dv0 f0 c3 t3 td1 b nc > survival_chance_3(sk2_0(),sk4_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 > inertia_3(sk2_0(),sk1_2(sk5_0(),sk2_0()),sk5_0()) % U10: < d1 v0 dv0 f1 c4 t5 td2 > inertia_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: % reorganization_free_3(sk2_0(),sk5_0(),sk6_0()) ....... U3 % Derivation of unit clause U4: % survival_chance_3(sk2_0(),sk3_0(),sk5_0()) ....... U4 % Derivation of unit clause U5: % survival_chance_3(sk2_0(),sk4_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()) ....... B3 % ~reorganization_free_3(x0,x1,x2) | reorganization_free_3(x0,x1,x1) ....... B7 % reorganization_free_3(sk2_0(), sk5_0(), sk5_0()) ....... R1 [B3:L0, B7:L0] % Derivation of unit clause U8: % reorganization_free_3(sk2_0(),sk5_0(),sk6_0()) ....... B3 % ~reorganization_free_3(x0,x1,x2) | reorganization_free_3(x0,x2,x2) ....... B8 % reorganization_free_3(sk2_0(), sk6_0(), sk6_0()) ....... R1 [B3:L0, B8:L0] % Derivation of unit clause U9: % organization_2(sk2_0(),sk5_0()) ....... B1 % ~organization_2(x0,x1) | inertia_3(x0,sk1_2(x1,x0),x1) ....... B9 % inertia_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) | inertia_3(x0,sk1_2(x1,x0),x1) ....... B9 % inertia_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) | ~inertia_3(x0,x4,x2) | ~inertia_3(x0,x3,x1) | ~reorganization_free_3(x0,x1,x2) | greater_2(x4,x3) ....... B10 % ~organization_2(x0, sk6_0()) | ~organization_2(x0, sk5_0()) | ~inertia_3(x0, x1, sk6_0()) | ~inertia_3(x0, x2, sk5_0()) | ~reorganization_free_3(x0, sk5_0(), sk6_0()) | greater_2(x1, x2) ....... R1 [B0:L0, B10:L0] % organization_2(sk2_0(),sk6_0()) ....... U2 % ~organization_2(sk2_0(), sk5_0()) | ~inertia_3(sk2_0(), x0, sk6_0()) | ~inertia_3(sk2_0(), x1, sk5_0()) | ~reorganization_free_3(sk2_0(), sk5_0(), sk6_0()) | greater_2(x0, x1) ....... R2 [R1:L0, U2:L0] % organization_2(sk2_0(),sk5_0()) ....... U1 % ~inertia_3(sk2_0(), x0, sk6_0()) | ~inertia_3(sk2_0(), x1, sk5_0()) | ~reorganization_free_3(sk2_0(), sk5_0(), sk6_0()) | greater_2(x0, x1) ....... R3 [R2:L0, U1:L0] % inertia_3(sk2_0(),sk1_2(sk6_0(),sk2_0()),sk6_0()) ....... U10 % ~inertia_3(sk2_0(), x0, sk5_0()) | ~reorganization_free_3(sk2_0(), sk5_0(), sk6_0()) | greater_2(sk1_2(sk6_0(), sk2_0()), x0) ....... R4 [R3:L0, U10:L0] % inertia_3(sk2_0(),sk1_2(sk5_0(),sk2_0()),sk5_0()) ....... U9 % ~reorganization_free_3(sk2_0(), sk5_0(), sk6_0()) | greater_2(sk1_2(sk6_0(), sk2_0()), sk1_2(sk5_0(), sk2_0())) ....... R5 [R4:L0, U9:L0] % reorganization_free_3(sk2_0(),sk5_0(),sk6_0()) ....... U3 % greater_2(sk1_2(sk6_0(), sk2_0()), sk1_2(sk5_0(), sk2_0())) ....... R6 [R5:L0, U3: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,x5,x3) | ~inertia_3(x0,x4,x1) | ~reorganization_free_3(x2,x3,x3) | ~reorganization_free_3(x0,x1,x1) | ~survival_chance_3(x2,x7,x3) | ~survival_chance_3(x0,x6,x1) | greater_2(x7,x6) ....... B11 % ~greater_2(x0, x1) | ~organization_2(x2, x3) | ~inertia_3(x2, x0, x3) | ~inertia_3(sk2_0(), x1, sk5_0()) | ~reorganization_free_3(x2, x3, x3) | ~reorganization_free_3(sk2_0(), sk5_0(), sk5_0()) | ~survival_chance_3(x2, x4, x3) | ~survival_chance_3(sk2_0(), x5, 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, sk1_2(sk6_0(), sk2_0()), x1) | ~inertia_3(sk2_0(), sk1_2(sk5_0(), sk2_0()), sk5_0()) | ~reorganization_free_3(x0, x1, x1) | ~reorganization_free_3(sk2_0(), sk5_0(), sk5_0()) | ~survival_chance_3(x0, x2, x1) | ~survival_chance_3(sk2_0(), x3, sk5_0()) | greater_2(x2, x3) ....... R2 [R1:L0, U11:L0] % organization_2(sk2_0(),sk6_0()) ....... U2 % ~inertia_3(sk2_0(), sk1_2(sk6_0(), sk2_0()), sk6_0()) | ~inertia_3(sk2_0(), sk1_2(sk5_0(), sk2_0()), sk5_0()) | ~reorganization_free_3(sk2_0(), sk6_0(), sk6_0()) | ~reorganization_free_3(sk2_0(), sk5_0(), sk5_0()) | ~survival_chance_3(sk2_0(), x0, sk6_0()) | ~survival_chance_3(sk2_0(), x1, sk5_0()) | greater_2(x0, x1) ....... R3 [R2:L0, U2:L0] % inertia_3(sk2_0(),sk1_2(sk6_0(),sk2_0()),sk6_0()) ....... U10 % ~inertia_3(sk2_0(), sk1_2(sk5_0(), sk2_0()), sk5_0()) | ~reorganization_free_3(sk2_0(), sk6_0(), sk6_0()) | ~reorganization_free_3(sk2_0(), sk5_0(), sk5_0()) | ~survival_chance_3(sk2_0(), x0, sk6_0()) | ~survival_chance_3(sk2_0(), x1, sk5_0()) | greater_2(x0, x1) ....... R4 [R3:L0, U10:L0] % inertia_3(sk2_0(),sk1_2(sk5_0(),sk2_0()),sk5_0()) ....... U9 % ~reorganization_free_3(sk2_0(), sk6_0(), sk6_0()) | ~reorganization_free_3(sk2_0(), sk5_0(), sk5_0()) | ~survival_chance_3(sk2_0(), x0, sk6_0()) | ~survival_chance_3(sk2_0(), x1, sk5_0()) | greater_2(x0, x1) ....... R5 [R4:L0, U9:L0] % reorganization_free_3(sk2_0(),sk6_0(),sk6_0()) ....... U8 % ~reorganization_free_3(sk2_0(), sk5_0(), sk5_0()) | ~survival_chance_3(sk2_0(), x0, sk6_0()) | ~survival_chance_3(sk2_0(), x1, sk5_0()) | greater_2(x0, x1) ....... R6 [R5:L0, U8:L0] % reorganization_free_3(sk2_0(),sk5_0(),sk5_0()) ....... U7 % ~survival_chance_3(sk2_0(), x0, sk6_0()) | ~survival_chance_3(sk2_0(), x1, sk5_0()) | greater_2(x0, x1) ....... R7 [R6:L0, U7:L0] % survival_chance_3(sk2_0(),sk4_0(),sk6_0()) ....... U5 % ~survival_chance_3(sk2_0(), x0, sk5_0()) | greater_2(sk4_0(), x0) ....... R8 [R7:L0, U5:L0] % survival_chance_3(sk2_0(),sk3_0(),sk5_0()) ....... U4 % greater_2(sk4_0(), sk3_0()) ....... R9 [R8:L0, U4: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: 19803182 % resolvents: 19791047 factors: 12135 % Number of unit clauses generated: 8248062 % % unit clauses generated to total clauses generated: 41.65 % 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] = 8248062 [2] = 11124643 [3] = 238333 [4] = 131551 [5] = 47354 [6] = 11022 % [7] = 1853 [8] = 317 [9] = 45 [10] = 2 % 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] survival_chance_3 (+)2 (-)0 % ------------------ % Total: (+)12 (-)1 % Total number of unit clauses retained: 13 % Number of clauses skipped because of their length: 203801 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 107992 % Number of successful unifications: 19803201 % Number of unification failures: 1691467 % Number of unit to unit unification failures: 2 % N literal unification failure due to lookup root_id table: 16288120 % N base clause resolution failure due to lookup table: 197545 % N UC-BCL resolution dropped due to lookup table: 0 % Max entries in substitution set: 33 % N unit clauses dropped because they exceeded max values: 6181539 % 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() = 21494668 % ConstructUnitClause() = 6181545 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 7.44 secs % -------------------------------------------------------- % | | % Inferences per sec: 618849 % | | % -------------------------------------------------------- % Elapsed time: 33 secs % CPU time: 32.98 secs % %------------------------------------------------------------------------------