%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : SET852-2 : TPTP v5.0.0. Released v3.2.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art01.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 05:50:10 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/SystemOnTPTP21379/SET/SET852-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 = 8] [nf = 0] [nu = 0] [ut = 2] % Looking for a proof at depth = 2 ... % t = 0 secs [nr = 35] [nf = 2] [nu = 8] [ut = 6] % Looking for a proof at depth = 3 ... % t = 0 secs [nr = 82] [nf = 4] [nu = 16] [ut = 6] % Looking for a proof at depth = 4 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: ~c_lessequals_3(c_Union_2(v_Y_0(),tc_set_1(t_a_0())),v_m_0(),tc_set_1(tc_set_1(t_a_0()))) % B3: c_in_3(c_Zorn_OUnion__lemma0__1_4(x0,x1,x2,x3),x2,tc_set_1(x3)) | c_lessequals_3(x1,c_Union_2(x2,x3),tc_set_1(x3)) | c_lessequals_3(c_Union_2(x2,x3),x0,tc_set_1(x3)) % B4: ~c_lessequals_3(x0,c_Zorn_OUnion__lemma0__1_4(x1,x0,x2,x3),tc_set_1(x3)) | c_lessequals_3(x0,c_Union_2(x2,x3),tc_set_1(x3)) | c_lessequals_3(c_Union_2(x2,x3),x1,tc_set_1(x3)) % B5: ~c_lessequals_3(c_Zorn_OUnion__lemma0__1_4(x0,x1,x2,x3),x0,tc_set_1(x3)) | c_lessequals_3(x1,c_Union_2(x2,x3),tc_set_1(x3)) | c_lessequals_3(c_Union_2(x2,x3),x0,tc_set_1(x3)) % Unit Clauses: % -------------- % U1: < d0 v0 dv0 f5 c6 t11 td3 b nc > ~c_lessequals_3(c_Zorn_Osucc_3(v_S_0(),v_m_0(),t_a_0()),c_Union_2(v_Y_0(),tc_set_1(t_a_0())),tc_set_1(tc_set_1(t_a_0()))) % U4: < d2 v0 dv0 f6 c10 t16 td3 > ~c_lessequals_3(c_Zorn_Osucc_3(v_S_0(),v_m_0(),t_a_0()),c_Zorn_OUnion__lemma0__1_4(v_m_0(),c_Zorn_Osucc_3(v_S_0(),v_m_0(),t_a_0()),v_Y_0(),tc_set_1(t_a_0())),tc_set_1(tc_set_1(t_a_0()))) % U5: < d2 v0 dv0 f5 c8 t13 td3 > ~c_lessequals_3(c_Zorn_OUnion__lemma0__1_4(v_m_0(),c_Zorn_Osucc_3(v_S_0(),v_m_0(),t_a_0()),v_Y_0(),tc_set_1(t_a_0())),v_m_0(),tc_set_1(tc_set_1(t_a_0()))) % U6: < d4 v0 dv0 f5 c8 t13 td3 > c_lessequals_3(c_Zorn_OUnion__lemma0__1_4(v_m_0(),c_Zorn_Osucc_3(v_S_0(),v_m_0(),t_a_0()),v_Y_0(),tc_set_1(t_a_0())),v_m_0(),tc_set_1(tc_set_1(t_a_0()))) % --------------- Start of Proof --------------- % Derivation of unit clause U1: % ~c_lessequals_3(c_Zorn_Osucc_3(v_S_0(),v_m_0(),t_a_0()),c_Union_2(v_Y_0(),tc_set_1(t_a_0())),tc_set_1(tc_set_1(t_a_0()))) ....... U1 % Derivation of unit clause U4: % ~c_lessequals_3(c_Union_2(v_Y_0(),tc_set_1(t_a_0())),v_m_0(),tc_set_1(tc_set_1(t_a_0()))) ....... B0 % ~c_lessequals_3(x0,c_Zorn_OUnion__lemma0__1_4(x1,x0,x2,x3),tc_set_1(x3)) | c_lessequals_3(x0,c_Union_2(x2,x3),tc_set_1(x3)) | c_lessequals_3(c_Union_2(x2,x3),x1,tc_set_1(x3)) ....... B4 % ~c_lessequals_3(x0, c_Zorn_OUnion__lemma0__1_4(v_m_0(), x0, v_Y_0(), tc_set_1(t_a_0())), tc_set_1(tc_set_1(t_a_0()))) | c_lessequals_3(x0, c_Union_2(v_Y_0(), tc_set_1(t_a_0())), tc_set_1(tc_set_1(t_a_0()))) ....... R1 [B0:L0, B4:L2] % ~c_lessequals_3(c_Zorn_Osucc_3(v_S_0(),v_m_0(),t_a_0()),c_Union_2(v_Y_0(),tc_set_1(t_a_0())),tc_set_1(tc_set_1(t_a_0()))) ....... U1 % ~c_lessequals_3(c_Zorn_Osucc_3(v_S_0(), v_m_0(), t_a_0()), c_Zorn_OUnion__lemma0__1_4(v_m_0(), c_Zorn_Osucc_3(v_S_0(), v_m_0(), t_a_0()), v_Y_0(), tc_set_1(t_a_0())), tc_set_1(tc_set_1(t_a_0()))) ....... R2 [R1:L1, U1:L0] % Derivation of unit clause U5: % ~c_lessequals_3(c_Union_2(v_Y_0(),tc_set_1(t_a_0())),v_m_0(),tc_set_1(tc_set_1(t_a_0()))) ....... B0 % ~c_lessequals_3(c_Zorn_OUnion__lemma0__1_4(x0,x1,x2,x3),x0,tc_set_1(x3)) | c_lessequals_3(x1,c_Union_2(x2,x3),tc_set_1(x3)) | c_lessequals_3(c_Union_2(x2,x3),x0,tc_set_1(x3)) ....... B5 % ~c_lessequals_3(c_Zorn_OUnion__lemma0__1_4(v_m_0(), x0, v_Y_0(), tc_set_1(t_a_0())), v_m_0(), tc_set_1(tc_set_1(t_a_0()))) | c_lessequals_3(x0, c_Union_2(v_Y_0(), tc_set_1(t_a_0())), tc_set_1(tc_set_1(t_a_0()))) ....... R1 [B0:L0, B5:L2] % ~c_lessequals_3(c_Zorn_Osucc_3(v_S_0(),v_m_0(),t_a_0()),c_Union_2(v_Y_0(),tc_set_1(t_a_0())),tc_set_1(tc_set_1(t_a_0()))) ....... U1 % ~c_lessequals_3(c_Zorn_OUnion__lemma0__1_4(v_m_0(), c_Zorn_Osucc_3(v_S_0(), v_m_0(), t_a_0()), v_Y_0(), tc_set_1(t_a_0())), v_m_0(), tc_set_1(tc_set_1(t_a_0()))) ....... R2 [R1:L1, U1:L0] % Derivation of unit clause U6: % ~c_lessequals_3(c_Union_2(v_Y_0(),tc_set_1(t_a_0())),v_m_0(),tc_set_1(tc_set_1(t_a_0()))) ....... B0 % c_in_3(c_Zorn_OUnion__lemma0__1_4(x0,x1,x2,x3),x2,tc_set_1(x3)) | c_lessequals_3(x1,c_Union_2(x2,x3),tc_set_1(x3)) | c_lessequals_3(c_Union_2(x2,x3),x0,tc_set_1(x3)) ....... B3 % c_in_3(c_Zorn_OUnion__lemma0__1_4(v_m_0(), x0, v_Y_0(), tc_set_1(t_a_0())), v_Y_0(), tc_set_1(tc_set_1(t_a_0()))) | c_lessequals_3(x0, c_Union_2(v_Y_0(), tc_set_1(t_a_0())), tc_set_1(tc_set_1(t_a_0()))) ....... R1 [B0:L0, B3:L2] % ~c_in_3(x0,v_Y_0(),tc_set_1(tc_set_1(t_a_0()))) | c_lessequals_3(c_Zorn_Osucc_3(v_S_0(),v_m_0(),t_a_0()),x0,tc_set_1(tc_set_1(t_a_0()))) | c_lessequals_3(x0,v_m_0(),tc_set_1(tc_set_1(t_a_0()))) ....... B2 % c_lessequals_3(x0, c_Union_2(v_Y_0(), tc_set_1(t_a_0())), tc_set_1(tc_set_1(t_a_0()))) | c_lessequals_3(c_Zorn_Osucc_3(v_S_0(), v_m_0(), t_a_0()), c_Zorn_OUnion__lemma0__1_4(v_m_0(), x0, v_Y_0(), tc_set_1(t_a_0())), tc_set_1(tc_set_1(t_a_0()))) | c_lessequals_3(c_Zorn_OUnion__lemma0__1_4(v_m_0(), x0, v_Y_0(), tc_set_1(t_a_0())), v_m_0(), tc_set_1(tc_set_1(t_a_0()))) ....... R2 [R1:L0, B2:L0] % ~c_lessequals_3(c_Zorn_Osucc_3(v_S_0(),v_m_0(),t_a_0()),c_Union_2(v_Y_0(),tc_set_1(t_a_0())),tc_set_1(tc_set_1(t_a_0()))) ....... U1 % c_lessequals_3(c_Zorn_Osucc_3(v_S_0(), v_m_0(), t_a_0()), c_Zorn_OUnion__lemma0__1_4(v_m_0(), c_Zorn_Osucc_3(v_S_0(), v_m_0(), t_a_0()), v_Y_0(), tc_set_1(t_a_0())), tc_set_1(tc_set_1(t_a_0()))) | c_lessequals_3(c_Zorn_OUnion__lemma0__1_4(v_m_0(), c_Zorn_Osucc_3(v_S_0(), v_m_0(), t_a_0()), v_Y_0(), tc_set_1(t_a_0())), v_m_0(), tc_set_1(tc_set_1(t_a_0()))) ....... R3 [R2:L0, U1:L0] % ~c_lessequals_3(c_Zorn_Osucc_3(v_S_0(),v_m_0(),t_a_0()),c_Zorn_OUnion__lemma0__1_4(v_m_0(),c_Zorn_Osucc_3(v_S_0(),v_m_0(),t_a_0()),v_Y_0(),tc_set_1(t_a_0())),tc_set_1(tc_set_1(t_a_0()))) ....... U4 % c_lessequals_3(c_Zorn_OUnion__lemma0__1_4(v_m_0(), c_Zorn_Osucc_3(v_S_0(), v_m_0(), t_a_0()), v_Y_0(), tc_set_1(t_a_0())), v_m_0(), tc_set_1(tc_set_1(t_a_0()))) ....... R4 [R3:L0, U4:L0] % Derivation of the empty clause: % c_lessequals_3(c_Zorn_OUnion__lemma0__1_4(v_m_0(),c_Zorn_Osucc_3(v_S_0(),v_m_0(),t_a_0()),v_Y_0(),tc_set_1(t_a_0())),v_m_0(),tc_set_1(tc_set_1(t_a_0()))) ....... U6 % ~c_lessequals_3(c_Zorn_OUnion__lemma0__1_4(v_m_0(),c_Zorn_Osucc_3(v_S_0(),v_m_0(),t_a_0()),v_Y_0(),tc_set_1(t_a_0())),v_m_0(),tc_set_1(tc_set_1(t_a_0()))) ....... U5 % [] ....... R1 [U6:L0, U5:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 93 % resolvents: 89 factors: 4 % Number of unit clauses generated: 19 % % unit clauses generated to total clauses generated: 20.43 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 2 [2] = 4 [4] = 1 % Total = 7 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 19 [2] = 53 [3] = 21 % Average size of a generated clause: 3.0 % Number of unit clauses per predicate list: % ========================================== % [0] c_in_3 (+)1 (-)1 % [1] c_lessequals_3 (+)1 (-)4 % ------------------ % Total: (+)2 (-)5 % Total number of unit clauses retained: 7 % Number of clauses skipped because of their length: 60 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 101 % Number of unification failures: 84 % Number of unit to unit unification failures: 4 % N literal unification failure due to lookup root_id table: 321 % N base clause resolution failure due to lookup table: 7 % N UC-BCL resolution dropped due to lookup table: 0 % Max entries in substitution set: 6 % N unit clauses dropped because they exceeded max values: 4 % 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: 16 % Max term depth in a unit clause: 3 % Number of states in UCFA table: 78 % Total number of terms of all unit clauses in table: 82 % Max allowed number of states in UCFA: 152000 % Ratio n states used/total allowed states: 0.00 % Ratio n states used/total unit clauses terms: 0.95 % Number of symbols (columns) in UCFA: 44 % Profile 2: Number of calls to: % ============================== % PTUnify() = 185 % ConstructUnitClause() = 9 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.00 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 1 secs % CPU time: 0.17 secs % %------------------------------------------------------------------------------