%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : SWV279-2 : TPTP v5.0.0. Released v3.2.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art03.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 06:47:38 EST 2010 % Result : Unsatisfiable 0.18s % Output : Refutation 0.18s % 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/SystemOnTPTP11425/SWV/SWV279-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 = 50] [nf = 0] [nu = 36] [ut = 22] % Looking for a proof at depth = 2 ... % t = 0 secs [nr = 389] [nf = 0] [nu = 246] [ut = 23] % Looking for a proof at depth = 3 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: c_in_3(c_Message_Omsg_OMPair_2(v_X_0(),v_Y_0()),c_Event_Oused_1(v_H_0()),tc_Message_Omsg_0()) % B1: ~c_in_3(v_X_0(),c_Event_Oused_1(v_H_0()),tc_Message_Omsg_0()) | ~c_in_3(v_Y_0(),c_Event_Oused_1(v_H_0()),tc_Message_Omsg_0()) % B2: c_in_3(x0,c_insert_3(x0,x1,x2),x2) % B3: ~c_in_3(c_Message_Omsg_OMPair_2(x0,x1),c_Message_Oparts_1(x2),tc_Message_Omsg_0()) | c_in_3(x0,c_Message_Oparts_1(x2),tc_Message_Omsg_0()) % B4: ~c_in_3(c_Message_Omsg_OMPair_2(x0,x1),c_Message_Oparts_1(x2),tc_Message_Omsg_0()) | c_in_3(x1,c_Message_Oparts_1(x2),tc_Message_Omsg_0()) % B5: ~c_in_3(x0,x1,tc_Message_Omsg_0()) | c_in_3(x0,c_Message_Oparts_1(x1),tc_Message_Omsg_0()) % B6: ~c_in_3(x0,c_Event_Oused_1(x1),tc_Message_Omsg_0()) | c_lessequals_3(c_Message_Oparts_1(c_insert_3(x0,c_emptyset_0(),tc_Message_Omsg_0())),c_Event_Oused_1(x1),tc_set_1(tc_Message_Omsg_0())) % B7: ~c_in_3(x0,x1,x2) | ~c_lessequals_3(x1,x3,tc_set_1(x2)) | c_in_3(x0,x3,x2) % Unit Clauses: % -------------- % U3: < d1 v0 dv0 f5 c6 t11 td4 > c_lessequals_3(c_Message_Oparts_1(c_insert_3(c_Message_Omsg_OMPair_2(v_X_0(),v_Y_0()),c_emptyset_0(),tc_Message_Omsg_0())),c_Event_Oused_1(v_H_0()),tc_set_1(tc_Message_Omsg_0())) % U4: < d1 v3 dv2 f2 c2 t7 td3 > c_in_3(x0,c_Message_Oparts_1(c_insert_3(x0,x1,tc_Message_Omsg_0())),tc_Message_Omsg_0()) % U9: < d1 v4 dv3 f3 c2 t9 td4 > c_in_3(x0,c_Message_Oparts_1(c_insert_3(c_Message_Omsg_OMPair_2(x1,x0),x2,tc_Message_Omsg_0())),tc_Message_Omsg_0()) % U24: < d3 v0 dv0 f1 c3 t4 td2 > ~c_in_3(v_X_0(),c_Event_Oused_1(v_H_0()),tc_Message_Omsg_0()) % U26: < d3 v0 dv0 f1 c3 t4 td2 > c_in_3(v_X_0(),c_Event_Oused_1(v_H_0()),tc_Message_Omsg_0()) % --------------- Start of Proof --------------- % Derivation of unit clause U3: % c_in_3(c_Message_Omsg_OMPair_2(v_X_0(),v_Y_0()),c_Event_Oused_1(v_H_0()),tc_Message_Omsg_0()) ....... B0 % ~c_in_3(x0,c_Event_Oused_1(x1),tc_Message_Omsg_0()) | c_lessequals_3(c_Message_Oparts_1(c_insert_3(x0,c_emptyset_0(),tc_Message_Omsg_0())),c_Event_Oused_1(x1),tc_set_1(tc_Message_Omsg_0())) ....... B6 % c_lessequals_3(c_Message_Oparts_1(c_insert_3(c_Message_Omsg_OMPair_2(v_X_0(), v_Y_0()), c_emptyset_0(), tc_Message_Omsg_0())), c_Event_Oused_1(v_H_0()), tc_set_1(tc_Message_Omsg_0())) ....... R1 [B0:L0, B6:L0] % Derivation of unit clause U4: % c_in_3(x0,c_insert_3(x0,x1,x2),x2) ....... B2 % ~c_in_3(x0,x1,tc_Message_Omsg_0()) | c_in_3(x0,c_Message_Oparts_1(x1),tc_Message_Omsg_0()) ....... B5 % c_in_3(x0, c_Message_Oparts_1(c_insert_3(x0, x1, tc_Message_Omsg_0())), tc_Message_Omsg_0()) ....... R1 [B2:L0, B5:L0] % Derivation of unit clause U9: % ~c_in_3(c_Message_Omsg_OMPair_2(x0,x1),c_Message_Oparts_1(x2),tc_Message_Omsg_0()) | c_in_3(x1,c_Message_Oparts_1(x2),tc_Message_Omsg_0()) ....... B4 % c_in_3(x0,c_Message_Oparts_1(c_insert_3(x0,x1,tc_Message_Omsg_0())),tc_Message_Omsg_0()) ....... U4 % c_in_3(x0, c_Message_Oparts_1(c_insert_3(c_Message_Omsg_OMPair_2(x1, x0), x2, tc_Message_Omsg_0())), tc_Message_Omsg_0()) ....... R1 [B4:L0, U4:L0] % Derivation of unit clause U24: % ~c_in_3(v_X_0(),c_Event_Oused_1(v_H_0()),tc_Message_Omsg_0()) | ~c_in_3(v_Y_0(),c_Event_Oused_1(v_H_0()),tc_Message_Omsg_0()) ....... B1 % ~c_in_3(x0,x1,x2) | ~c_lessequals_3(x1,x3,tc_set_1(x2)) | c_in_3(x0,x3,x2) ....... B7 % ~c_in_3(v_X_0(), c_Event_Oused_1(v_H_0()), tc_Message_Omsg_0()) | ~c_in_3(v_Y_0(), x0, tc_Message_Omsg_0()) | ~c_lessequals_3(x0, c_Event_Oused_1(v_H_0()), tc_set_1(tc_Message_Omsg_0())) ....... R1 [B1:L1, B7:L2] % c_in_3(x0,c_Message_Oparts_1(c_insert_3(c_Message_Omsg_OMPair_2(x1,x0),x2,tc_Message_Omsg_0())),tc_Message_Omsg_0()) ....... U9 % ~c_in_3(v_X_0(), c_Event_Oused_1(v_H_0()), tc_Message_Omsg_0()) | ~c_lessequals_3(c_Message_Oparts_1(c_insert_3(c_Message_Omsg_OMPair_2(x0, v_Y_0()), x1, tc_Message_Omsg_0())), c_Event_Oused_1(v_H_0()), tc_set_1(tc_Message_Omsg_0())) ....... R2 [R1:L1, U9:L0] % c_lessequals_3(c_Message_Oparts_1(c_insert_3(c_Message_Omsg_OMPair_2(v_X_0(),v_Y_0()),c_emptyset_0(),tc_Message_Omsg_0())),c_Event_Oused_1(v_H_0()),tc_set_1(tc_Message_Omsg_0())) ....... U3 % ~c_in_3(v_X_0(), c_Event_Oused_1(v_H_0()), tc_Message_Omsg_0()) ....... R3 [R2:L1, U3:L0] % Derivation of unit clause U26: % ~c_in_3(c_Message_Omsg_OMPair_2(x0,x1),c_Message_Oparts_1(x2),tc_Message_Omsg_0()) | c_in_3(x0,c_Message_Oparts_1(x2),tc_Message_Omsg_0()) ....... B3 % ~c_in_3(x0,x1,x2) | ~c_lessequals_3(x1,x3,tc_set_1(x2)) | c_in_3(x0,x3,x2) ....... B7 % ~c_in_3(c_Message_Omsg_OMPair_2(x0, x1), c_Message_Oparts_1(x2), tc_Message_Omsg_0()) | ~c_lessequals_3(c_Message_Oparts_1(x2), x3, tc_set_1(tc_Message_Omsg_0())) | c_in_3(x0, x3, tc_Message_Omsg_0()) ....... R1 [B3:L1, B7:L0] % c_in_3(x0,c_Message_Oparts_1(c_insert_3(x0,x1,tc_Message_Omsg_0())),tc_Message_Omsg_0()) ....... U4 % ~c_lessequals_3(c_Message_Oparts_1(c_insert_3(c_Message_Omsg_OMPair_2(x0, x1), x2, tc_Message_Omsg_0())), x3, tc_set_1(tc_Message_Omsg_0())) | c_in_3(x0, x3, tc_Message_Omsg_0()) ....... R2 [R1:L0, U4:L0] % c_lessequals_3(c_Message_Oparts_1(c_insert_3(c_Message_Omsg_OMPair_2(v_X_0(),v_Y_0()),c_emptyset_0(),tc_Message_Omsg_0())),c_Event_Oused_1(v_H_0()),tc_set_1(tc_Message_Omsg_0())) ....... U3 % c_in_3(v_X_0(), c_Event_Oused_1(v_H_0()), tc_Message_Omsg_0()) ....... R3 [R2:L0, U3:L0] % Derivation of the empty clause: % c_in_3(v_X_0(),c_Event_Oused_1(v_H_0()),tc_Message_Omsg_0()) ....... U26 % ~c_in_3(v_X_0(),c_Event_Oused_1(v_H_0()),tc_Message_Omsg_0()) ....... U24 % [] ....... R1 [U26:L0, U24:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 1133 % resolvents: 1129 factors: 4 % Number of unit clauses generated: 620 % % unit clauses generated to total clauses generated: 54.72 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 2 [1] = 20 [2] = 1 [3] = 4 % Total = 27 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 620 [2] = 478 [3] = 35 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] c_in_3 (+)23 (-)2 % [1] c_lessequals_3 (+)1 (-)1 % ------------------ % Total: (+)24 (-)3 % Total number of unit clauses retained: 27 % Number of clauses skipped because of their length: 130 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 2 % Number of successful unifications: 1142 % Number of unification failures: 728 % Number of unit to unit unification failures: 46 % N literal unification failure due to lookup root_id table: 2030 % N base clause resolution failure due to lookup table: 458 % N UC-BCL resolution dropped due to lookup table: 43 % Max entries in substitution set: 8 % N unit clauses dropped because they exceeded max values: 457 % N unit clauses dropped because too much nesting: 403 % 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: 11 % Max term depth in a unit clause: 5 % Number of states in UCFA table: 123 % Total number of terms of all unit clauses in table: 208 % Max allowed number of states in UCFA: 136000 % Ratio n states used/total allowed states: 0.00 % Ratio n states used/total unit clauses terms: 0.59 % Number of symbols (columns) in UCFA: 46 % Profile 2: Number of calls to: % ============================== % PTUnify() = 1870 % ConstructUnitClause() = 482 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.00 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 1 secs % CPU time: 0.18 secs % %------------------------------------------------------------------------------