%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : SET834-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 05:47:15 EST 2010 % Result : Unsatisfiable 0.15s % Output : Refutation 0.15s % 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/SystemOnTPTP12531/SET/SET834-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 = 26] [nf = 0] [nu = 8] [ut = 5] % Looking for a proof at depth = 2 ... % t = 0 secs [nr = 248] [nf = 3] [nu = 100] [ut = 16] % Looking for a proof at depth = 3 ... % t = 0 secs [nr = 3920] [nf = 39] [nu = 1629] [ut = 30] % Looking for a proof at depth = 4 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: c_in_3(v_x_0(),v_X_0(),t_a_0()) % B1: ~c_in_3(v_x_0(),v_Z_0(),t_a_0()) % B4: ~c_in_3(x0,x1,x2) | c_in_3(x0,c_union_3(x1,x3,x2),x2) % B5: ~c_in_3(x0,x1,x2) | c_in_3(x0,c_union_3(x3,x1,x2),x2) % B6: c_in_3(c_Main_OsubsetI__1_3(x0,x1,x2),x0,x2) | c_lessequals_3(x0,x1,tc_set_1(x2)) % B8: ~c_in_3(x0,x1,x2) | ~c_lessequals_3(x1,x3,tc_set_1(x2)) | c_in_3(x0,x3,x2) % B9: ~c_in_3(x0,c_union_3(x1,x2,x3),x3) | c_in_3(x0,x2,x3) | c_in_3(x0,x1,x3) % Unit Clauses: % -------------- % U2: < d0 v0 dv0 f0 c3 t3 td1 b nc > ~c_in_3(v_x_0(),v_Y_0(),t_a_0()) % U10: < d2 v0 dv0 f1 c5 t6 td2 > ~c_in_3(v_x_0(),c_union_3(v_Y_0(),v_Z_0(),t_a_0()),t_a_0()) % U24: < d3 v5 dv3 f2 c0 t7 td2 > c_lessequals_3(x0,c_union_3(x0,x1,x2),tc_set_1(x2)) % U27: < d3 v5 dv3 f2 c0 t7 td2 > c_lessequals_3(x0,c_union_3(x1,x0,x2),tc_set_1(x2)) % U33: < d4 v0 dv0 f2 c5 t7 td2 > ~c_lessequals_3(v_Z_0(),c_union_3(v_Y_0(),v_Z_0(),t_a_0()),tc_set_1(t_a_0())) % --------------- Start of Proof --------------- % Derivation of unit clause U2: % ~c_in_3(v_x_0(),v_Y_0(),t_a_0()) ....... U2 % Derivation of unit clause U10: % ~c_in_3(v_x_0(),v_Z_0(),t_a_0()) ....... B1 % ~c_in_3(x0,c_union_3(x1,x2,x3),x3) | c_in_3(x0,x2,x3) | c_in_3(x0,x1,x3) ....... B9 % ~c_in_3(v_x_0(), c_union_3(x0, v_Z_0(), t_a_0()), t_a_0()) | c_in_3(v_x_0(), x0, t_a_0()) ....... R1 [B1:L0, B9:L1] % ~c_in_3(v_x_0(),v_Y_0(),t_a_0()) ....... U2 % ~c_in_3(v_x_0(), c_union_3(v_Y_0(), v_Z_0(), t_a_0()), t_a_0()) ....... R2 [R1:L1, U2:L0] % Derivation of unit clause U24: % ~c_in_3(x0,x1,x2) | c_in_3(x0,c_union_3(x1,x3,x2),x2) ....... B4 % c_in_3(c_Main_OsubsetI__1_3(x0,x1,x2),x0,x2) | c_lessequals_3(x0,x1,tc_set_1(x2)) ....... B6 % c_in_3(c_Main_OsubsetI__1_3(x0, x1, x2), c_union_3(x0, x3, x2), x2) | c_lessequals_3(x0, x1, tc_set_1(x2)) ....... R1 [B4:L0, B6:L0] % ~c_in_3(c_Main_OsubsetI__1_3(x0,x1,x2),x1,x2) | c_lessequals_3(x0,x1,tc_set_1(x2)) ....... B7 % c_lessequals_3(x0, c_union_3(x0, x1, x2), tc_set_1(x2)) | c_lessequals_3(x0, c_union_3(x0, x1, x2), tc_set_1(x2)) ....... R2 [R1:L0, B7:L0] % c_lessequals_3(x0, c_union_3(x0, x1, x2), tc_set_1(x2)) ....... R3 [R2:L0, R2:L1] % Derivation of unit clause U27: % ~c_in_3(x0,x1,x2) | c_in_3(x0,c_union_3(x3,x1,x2),x2) ....... B5 % c_in_3(c_Main_OsubsetI__1_3(x0,x1,x2),x0,x2) | c_lessequals_3(x0,x1,tc_set_1(x2)) ....... B6 % c_in_3(c_Main_OsubsetI__1_3(x0, x1, x2), c_union_3(x3, x0, x2), x2) | c_lessequals_3(x0, x1, tc_set_1(x2)) ....... R1 [B5:L0, B6:L0] % ~c_in_3(c_Main_OsubsetI__1_3(x0,x1,x2),x1,x2) | c_lessequals_3(x0,x1,tc_set_1(x2)) ....... B7 % c_lessequals_3(x0, c_union_3(x1, x0, x2), tc_set_1(x2)) | c_lessequals_3(x0, c_union_3(x1, x0, x2), tc_set_1(x2)) ....... R2 [R1:L0, B7:L0] % c_lessequals_3(x0, c_union_3(x1, x0, x2), tc_set_1(x2)) ....... R3 [R2:L0, R2:L1] % Derivation of unit clause U33: % c_in_3(v_x_0(),v_X_0(),t_a_0()) ....... B0 % ~c_in_3(x0,x1,x2) | ~c_lessequals_3(x1,x3,tc_set_1(x2)) | c_in_3(x0,x3,x2) ....... B8 % ~c_lessequals_3(v_X_0(), x0, tc_set_1(t_a_0())) | c_in_3(v_x_0(), x0, t_a_0()) ....... R1 [B0:L0, B8:L0] % ~c_lessequals_3(v_Y_0(),x0,tc_set_1(t_a_0())) | ~c_lessequals_3(v_Z_0(),x0,tc_set_1(t_a_0())) | c_lessequals_3(v_X_0(),x0,tc_set_1(t_a_0())) ....... B3 % c_in_3(v_x_0(), x0, t_a_0()) | ~c_lessequals_3(v_Y_0(), x0, tc_set_1(t_a_0())) | ~c_lessequals_3(v_Z_0(), x0, tc_set_1(t_a_0())) ....... R2 [R1:L0, B3:L2] % ~c_in_3(v_x_0(),c_union_3(v_Y_0(),v_Z_0(),t_a_0()),t_a_0()) ....... U10 % ~c_lessequals_3(v_Y_0(), c_union_3(v_Y_0(), v_Z_0(), t_a_0()), tc_set_1(t_a_0())) | ~c_lessequals_3(v_Z_0(), c_union_3(v_Y_0(), v_Z_0(), t_a_0()), tc_set_1(t_a_0())) ....... R3 [R2:L0, U10:L0] % c_lessequals_3(x0,c_union_3(x0,x1,x2),tc_set_1(x2)) ....... U24 % ~c_lessequals_3(v_Z_0(), c_union_3(v_Y_0(), v_Z_0(), t_a_0()), tc_set_1(t_a_0())) ....... R4 [R3:L0, U24:L0] % Derivation of the empty clause: % ~c_lessequals_3(v_Z_0(),c_union_3(v_Y_0(),v_Z_0(),t_a_0()),tc_set_1(t_a_0())) ....... U33 % c_lessequals_3(x0,c_union_3(x1,x0,x2),tc_set_1(x2)) ....... U27 % [] ....... R1 [U33:L0, U27:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 3993 % resolvents: 3954 factors: 39 % Number of unit clauses generated: 1645 % % unit clauses generated to total clauses generated: 41.20 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 3 [1] = 2 [2] = 11 [3] = 14 % [4] = 4 % Total = 34 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 1645 [2] = 2064 [3] = 284 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] c_in_3 (+)7 (-)10 % [1] c_lessequals_3 (+)3 (-)14 % ------------------ % Total: (+)10 (-)24 % Total number of unit clauses retained: 34 % Number of clauses skipped because of their length: 1428 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 4005 % Number of unification failures: 4758 % Number of unit to unit unification failures: 111 % N literal unification failure due to lookup root_id table: 5170 % N base clause resolution failure due to lookup table: 228 % N UC-BCL resolution dropped due to lookup table: 0 % Max entries in substitution set: 11 % N unit clauses dropped because they exceeded max values: 1431 % N unit clauses dropped because too much nesting: 48 % 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: 7 % Max term depth in a unit clause: 2 % Number of states in UCFA table: 128 % Total number of terms of all unit clauses in table: 197 % 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.65 % Number of symbols (columns) in UCFA: 44 % Profile 2: Number of calls to: % ============================== % PTUnify() = 8763 % ConstructUnitClause() = 1462 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.00 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 0 secs % CPU time: 0.15 secs % %------------------------------------------------------------------------------