%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : LCL441-2 : TPTP v5.0.0. Released v3.2.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art07.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:36:00 EST 2010 % Result : Unsatisfiable 0.39s % Output : Refutation 0.39s % 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/SystemOnTPTP2717/LCL/LCL441-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 = 1 secs [nr = 14] [nf = 0] [nu = 10] [ut = 9] % Looking for a proof at depth = 2 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: ~c_in_3(c_PropLog_Opl_Ovar_2(v_a_0(),t_a_0()),c_PropLog_Othms_2(c_insert_3(c_PropLog_Opl_Ovar_2(v_a_0(),t_a_0()),c_emptyset_0(),tc_PropLog_Opl_1(t_a_0())),t_a_0()),tc_PropLog_Opl_1(t_a_0())) | ~c_in_3(c_PropLog_Opl_Oop_A_N_62_3(c_PropLog_Opl_Ovar_2(v_a_0(),t_a_0()),c_PropLog_Opl_Ofalse_0(),t_a_0()),c_PropLog_Othms_2(c_insert_3(c_PropLog_Opl_Oop_A_N_62_3(c_PropLog_Opl_Ovar_2(v_a_0(),t_a_0()),c_PropLog_Opl_Ofalse_0(),t_a_0()),c_emptyset_0(),tc_PropLog_Opl_1(t_a_0())),t_a_0()),tc_PropLog_Opl_1(t_a_0())) % B1: c_in_3(x0,c_insert_3(x0,x1,x2),x2) % B2: ~c_in_3(x0,x1,tc_PropLog_Opl_1(x2)) | c_in_3(x0,c_PropLog_Othms_2(x1,x2),tc_PropLog_Opl_1(x2)) % Unit Clauses: % -------------- % U0: < d0 v5 dv3 f1 c0 t6 td2 b > c_in_3(x0,c_insert_3(x0,x1,x2),x2) % U1: < d1 v6 dv3 f4 c0 t10 td4 > c_in_3(x0,c_PropLog_Othms_2(c_insert_3(x0,x1,tc_PropLog_Opl_1(x2)),x2),tc_PropLog_Opl_1(x2)) % U9: < d2 v0 dv0 f5 c7 t12 td3 > ~c_in_3(c_PropLog_Opl_Ovar_2(v_a_0(),t_a_0()),c_insert_3(c_PropLog_Opl_Ovar_2(v_a_0(),t_a_0()),c_emptyset_0(),tc_PropLog_Opl_1(t_a_0())),tc_PropLog_Opl_1(t_a_0())) % --------------- Start of Proof --------------- % Derivation of unit clause U0: % c_in_3(x0,c_insert_3(x0,x1,x2),x2) ....... U0 % Derivation of unit clause U1: % c_in_3(x0,c_insert_3(x0,x1,x2),x2) ....... B1 % ~c_in_3(x0,x1,tc_PropLog_Opl_1(x2)) | c_in_3(x0,c_PropLog_Othms_2(x1,x2),tc_PropLog_Opl_1(x2)) ....... B2 % c_in_3(x0, c_PropLog_Othms_2(c_insert_3(x0, x1, tc_PropLog_Opl_1(x2)), x2), tc_PropLog_Opl_1(x2)) ....... R1 [B1:L0, B2:L0] % Derivation of unit clause U9: % ~c_in_3(c_PropLog_Opl_Ovar_2(v_a_0(),t_a_0()),c_PropLog_Othms_2(c_insert_3(c_PropLog_Opl_Ovar_2(v_a_0(),t_a_0()),c_emptyset_0(),tc_PropLog_Opl_1(t_a_0())),t_a_0()),tc_PropLog_Opl_1(t_a_0())) | ~c_in_3(c_PropLog_Opl_Oop_A_N_62_3(c_PropLog_Opl_Ovar_2(v_a_0(),t_a_0()),c_PropLog_Opl_Ofalse_0(),t_a_0()),c_PropLog_Othms_2(c_insert_3(c_PropLog_Opl_Oop_A_N_62_3(c_PropLog_Opl_Ovar_2(v_a_0(),t_a_0()),c_PropLog_Opl_Ofalse_0(),t_a_0()),c_emptyset_0(),tc_PropLog_Opl_1(t_a_0())),t_a_0()),tc_PropLog_Opl_1(t_a_0())) ....... B0 % ~c_in_3(x0,x1,tc_PropLog_Opl_1(x2)) | c_in_3(x0,c_PropLog_Othms_2(x1,x2),tc_PropLog_Opl_1(x2)) ....... B2 % ~c_in_3(c_PropLog_Opl_Oop_A_N_62_3(c_PropLog_Opl_Ovar_2(v_a_0(), t_a_0()), c_PropLog_Opl_Ofalse_0(), t_a_0()), c_PropLog_Othms_2(c_insert_3(c_PropLog_Opl_Oop_A_N_62_3(c_PropLog_Opl_Ovar_2(v_a_0(), t_a_0()), c_PropLog_Opl_Ofalse_0(), t_a_0()), c_emptyset_0(), tc_PropLog_Opl_1(t_a_0())), t_a_0()), tc_PropLog_Opl_1(t_a_0())) | ~c_in_3(c_PropLog_Opl_Ovar_2(v_a_0(), t_a_0()), c_insert_3(c_PropLog_Opl_Ovar_2(v_a_0(), t_a_0()), c_emptyset_0(), tc_PropLog_Opl_1(t_a_0())), tc_PropLog_Opl_1(t_a_0())) ....... R1 [B0:L0, B2:L1] % c_in_3(x0,c_PropLog_Othms_2(c_insert_3(x0,x1,tc_PropLog_Opl_1(x2)),x2),tc_PropLog_Opl_1(x2)) ....... U1 % ~c_in_3(c_PropLog_Opl_Ovar_2(v_a_0(), t_a_0()), c_insert_3(c_PropLog_Opl_Ovar_2(v_a_0(), t_a_0()), c_emptyset_0(), tc_PropLog_Opl_1(t_a_0())), tc_PropLog_Opl_1(t_a_0())) ....... R2 [R1:L0, U1:L0] % Derivation of the empty clause: % ~c_in_3(c_PropLog_Opl_Ovar_2(v_a_0(),t_a_0()),c_insert_3(c_PropLog_Opl_Ovar_2(v_a_0(),t_a_0()),c_emptyset_0(),tc_PropLog_Opl_1(t_a_0())),tc_PropLog_Opl_1(t_a_0())) ....... U9 % c_in_3(x0,c_insert_3(x0,x1,x2),x2) ....... U0 % [] ....... R1 [U9:L0, U0:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 18 % resolvents: 18 factors: 0 % Number of unit clauses generated: 13 % % unit clauses generated to total clauses generated: 72.22 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 1 [1] = 8 [2] = 1 % Total = 10 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 13 [2] = 5 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] c_in_3 (+)9 (-)1 % ------------------ % Total: (+)9 (-)1 % 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: 21 % Number of unification failures: 15 % Number of unit to unit unification failures: 0 % N literal unification failure due to lookup root_id table: 16 % N base clause resolution failure due to lookup table: 2 % 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: 2 % N unit clauses dropped because too much nesting: 1 % 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: 24 % Max term depth in a unit clause: 11 % Number of states in UCFA table: 113 % Total number of terms of all unit clauses in table: 154 % Max allowed number of states in UCFA: 528000 % 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: 44 % Profile 2: Number of calls to: % ============================== % PTUnify() = 36 % ConstructUnitClause() = 11 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.00 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 1 secs % CPU time: 0.38 secs % %------------------------------------------------------------------------------