%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : SWV259-2 : TPTP v5.0.0. Released v3.2.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art02.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:42:44 EST 2010 % Result : Unsatisfiable 0.32s % Output : Refutation 0.32s % 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/SystemOnTPTP17297/SWV/SWV259-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 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: ~c_lessequals_3(c_Message_Oparts_1(v_H_0()),c_Message_Oparts_1(c_insert_3(v_X_0(),v_H_0(),tc_Message_Omsg_0())),tc_set_1(tc_Message_Omsg_0())) % B1: c_lessequals_3(x0,x0,tc_set_1(x1)) % B2: ~c_lessequals_3(c_insert_3(x0,x1,x2),x3,tc_set_1(x2)) | c_lessequals_3(x1,x3,tc_set_1(x2)) % B3: ~c_lessequals_3(x0,c_Message_Oparts_1(x1),tc_set_1(tc_Message_Omsg_0())) | c_lessequals_3(c_Message_Oparts_1(x0),c_Message_Oparts_1(x1),tc_set_1(tc_Message_Omsg_0())) % B4: ~c_lessequals_3(c_Message_Oparts_1(x0),c_Message_Oparts_1(x1),tc_set_1(tc_Message_Omsg_0())) | c_lessequals_3(x0,c_Message_Oparts_1(x1),tc_set_1(tc_Message_Omsg_0())) % Unit Clauses: % -------------- % U3: < d1 v0 dv0 f3 c5 t8 td3 > ~c_lessequals_3(v_H_0(),c_Message_Oparts_1(c_insert_3(v_X_0(),v_H_0(),tc_Message_Omsg_0())),tc_set_1(tc_Message_Omsg_0())) % U7: < d1 v2 dv1 f2 c1 t5 td2 > c_lessequals_3(x0,c_Message_Oparts_1(x0),tc_set_1(tc_Message_Omsg_0())) % U9: < d1 v3 dv2 f3 c2 t8 td3 > c_lessequals_3(x0,c_Message_Oparts_1(c_insert_3(x1,x0,tc_Message_Omsg_0())),tc_set_1(tc_Message_Omsg_0())) % --------------- Start of Proof --------------- % Derivation of unit clause U3: % ~c_lessequals_3(c_Message_Oparts_1(v_H_0()),c_Message_Oparts_1(c_insert_3(v_X_0(),v_H_0(),tc_Message_Omsg_0())),tc_set_1(tc_Message_Omsg_0())) ....... B0 % ~c_lessequals_3(x0,c_Message_Oparts_1(x1),tc_set_1(tc_Message_Omsg_0())) | c_lessequals_3(c_Message_Oparts_1(x0),c_Message_Oparts_1(x1),tc_set_1(tc_Message_Omsg_0())) ....... B3 % ~c_lessequals_3(v_H_0(), c_Message_Oparts_1(c_insert_3(v_X_0(), v_H_0(), tc_Message_Omsg_0())), tc_set_1(tc_Message_Omsg_0())) ....... R1 [B0:L0, B3:L1] % Derivation of unit clause U7: % c_lessequals_3(x0,x0,tc_set_1(x1)) ....... B1 % ~c_lessequals_3(c_Message_Oparts_1(x0),c_Message_Oparts_1(x1),tc_set_1(tc_Message_Omsg_0())) | c_lessequals_3(x0,c_Message_Oparts_1(x1),tc_set_1(tc_Message_Omsg_0())) ....... B4 % c_lessequals_3(x0, c_Message_Oparts_1(x0), tc_set_1(tc_Message_Omsg_0())) ....... R1 [B1:L0, B4:L0] % Derivation of unit clause U9: % ~c_lessequals_3(c_insert_3(x0,x1,x2),x3,tc_set_1(x2)) | c_lessequals_3(x1,x3,tc_set_1(x2)) ....... B2 % c_lessequals_3(x0,c_Message_Oparts_1(x0),tc_set_1(tc_Message_Omsg_0())) ....... U7 % c_lessequals_3(x0, c_Message_Oparts_1(c_insert_3(x1, x0, tc_Message_Omsg_0())), tc_set_1(tc_Message_Omsg_0())) ....... R1 [B2:L0, U7:L0] % Derivation of the empty clause: % c_lessequals_3(x0,c_Message_Oparts_1(c_insert_3(x1,x0,tc_Message_Omsg_0())),tc_set_1(tc_Message_Omsg_0())) ....... U9 % ~c_lessequals_3(v_H_0(),c_Message_Oparts_1(c_insert_3(v_X_0(),v_H_0(),tc_Message_Omsg_0())),tc_set_1(tc_Message_Omsg_0())) ....... U3 % [] ....... R1 [U9:L0, U3:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 9 % resolvents: 9 factors: 0 % Number of unit clauses generated: 9 % % unit clauses generated to total clauses generated: 100.00 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 2 [1] = 8 % Total = 10 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 9 % Average size of a generated clause: 1.0 % Number of unit clauses per predicate list: % ========================================== % [0] c_lessequals_3 (+)6 (-)4 % ------------------ % Total: (+)6 (-)4 % Total number of unit clauses retained: 10 % Number of clauses skipped because of their length: 0 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 12 % Number of unification failures: 0 % Number of unit to unit unification failures: 22 % N literal unification failure due to lookup root_id table: 7 % N base clause resolution failure due to lookup table: 0 % N UC-BCL resolution dropped due to lookup table: 0 % Max entries in substitution set: 3 % N unit clauses dropped because they exceeded max values: 1 % 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: 12 % Max term depth in a unit clause: 3 % Number of states in UCFA table: 67 % Total number of terms of all unit clauses in table: 80 % Max allowed number of states in UCFA: 448000 % Ratio n states used/total allowed states: 0.00 % Ratio n states used/total unit clauses terms: 0.84 % Number of symbols (columns) in UCFA: 41 % Profile 2: Number of calls to: % ============================== % PTUnify() = 12 % ConstructUnitClause() = 9 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.00 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 0 secs % CPU time: 0.32 secs % %------------------------------------------------------------------------------