%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : SET014-2 : TPTP v5.0.0. Bugfixed v2.1.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art04.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 04:48:19 EST 2010 % Result : Unsatisfiable 0.97s % Output : Refutation 0.97s % 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/SystemOnTPTP25472/SET/SET014-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 = 189] [nf = 0] [nu = 125] [ut = 73] % Looking for a proof at depth = 2 ... % t = 0 secs [nr = 4730] [nf = 53] [nu = 3194] [ut = 275] % Looking for a proof at depth = 3 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: ~subset_2(union_2(as_0(),bs_0()),cs_0()) % B3: ~member_2(x0,empty_set_0()) % B4: subset_2(bs_0(),cs_0()) % B5: subset_2(as_0(),cs_0()) % B6: ~member_2(x0,x1) | member_2(x0,union_2(x1,x2)) % B16: member_2(member_of_1_not_of_2_2(x0,x1),x0) | subset_2(x0,x1) % B17: ~member_2(member_of_1_not_of_2_2(x0,x1),x1) | subset_2(x0,x1) % B20: ~member_2(x0,x1) | ~subset_2(x1,x2) | member_2(x0,x2) % B22: ~member_2(x0,union_2(x1,x2)) | member_2(x0,x1) | member_2(x0,x2) % Unit Clauses: % -------------- % U3: < d0 v1 dv1 f0 c1 t2 td1 b > ~member_2(x0,empty_set_0()) % U8: < d1 v0 dv0 f3 c5 t8 td3 > member_2(member_of_1_not_of_2_2(union_2(as_0(),bs_0()),cs_0()),union_2(as_0(),bs_0())) % U9: < d1 v0 dv0 f2 c4 t6 td3 > ~member_2(member_of_1_not_of_2_2(union_2(as_0(),bs_0()),cs_0()),cs_0()) % U87: < d2 v1 dv1 f1 c2 t4 td2 > ~member_2(x0,union_2(empty_set_0(),empty_set_0())) % U115: < d2 v0 dv0 f2 c4 t6 td3 > ~member_2(member_of_1_not_of_2_2(union_2(as_0(),bs_0()),cs_0()),bs_0()) % U116: < d2 v0 dv0 f2 c4 t6 td3 > ~member_2(member_of_1_not_of_2_2(union_2(as_0(),bs_0()),cs_0()),as_0()) % U924: < d3 v1 dv1 f3 c4 t8 td3 > member_2(member_of_1_not_of_2_2(union_2(as_0(),bs_0()),cs_0()),union_2(as_0(),x0)) % U926: < d3 v0 dv0 f2 c4 t6 td3 > member_2(member_of_1_not_of_2_2(union_2(as_0(),bs_0()),cs_0()),as_0()) % --------------- Start of Proof --------------- % Derivation of unit clause U3: % ~member_2(x0,empty_set_0()) ....... U3 % Derivation of unit clause U8: % ~subset_2(union_2(as_0(),bs_0()),cs_0()) ....... B0 % member_2(member_of_1_not_of_2_2(x0,x1),x0) | subset_2(x0,x1) ....... B16 % member_2(member_of_1_not_of_2_2(union_2(as_0(), bs_0()), cs_0()), union_2(as_0(), bs_0())) ....... R1 [B0:L0, B16:L1] % Derivation of unit clause U9: % ~subset_2(union_2(as_0(),bs_0()),cs_0()) ....... B0 % ~member_2(member_of_1_not_of_2_2(x0,x1),x1) | subset_2(x0,x1) ....... B17 % ~member_2(member_of_1_not_of_2_2(union_2(as_0(), bs_0()), cs_0()), cs_0()) ....... R1 [B0:L0, B17:L1] % Derivation of unit clause U87: % ~member_2(x0,empty_set_0()) ....... B3 % ~member_2(x0,union_2(x1,x2)) | member_2(x0,x1) | member_2(x0,x2) ....... B22 % ~member_2(x0, union_2(empty_set_0(), x1)) | member_2(x0, x1) ....... R1 [B3:L0, B22:L1] % ~member_2(x0,empty_set_0()) ....... U3 % ~member_2(x0, union_2(empty_set_0(), empty_set_0())) ....... R2 [R1:L1, U3:L0] % Derivation of unit clause U115: % subset_2(bs_0(),cs_0()) ....... B4 % ~member_2(x0,x1) | ~subset_2(x1,x2) | member_2(x0,x2) ....... B20 % ~member_2(x0, bs_0()) | member_2(x0, cs_0()) ....... R1 [B4:L0, B20:L1] % ~member_2(member_of_1_not_of_2_2(union_2(as_0(),bs_0()),cs_0()),cs_0()) ....... U9 % ~member_2(member_of_1_not_of_2_2(union_2(as_0(), bs_0()), cs_0()), bs_0()) ....... R2 [R1:L1, U9:L0] % Derivation of unit clause U116: % subset_2(as_0(),cs_0()) ....... B5 % ~member_2(x0,x1) | ~subset_2(x1,x2) | member_2(x0,x2) ....... B20 % ~member_2(x0, as_0()) | member_2(x0, cs_0()) ....... R1 [B5:L0, B20:L1] % ~member_2(member_of_1_not_of_2_2(union_2(as_0(),bs_0()),cs_0()),cs_0()) ....... U9 % ~member_2(member_of_1_not_of_2_2(union_2(as_0(), bs_0()), cs_0()), as_0()) ....... R2 [R1:L1, U9:L0] % Derivation of unit clause U924: % ~member_2(x0,x1) | member_2(x0,union_2(x1,x2)) ....... B6 % ~member_2(x0,union_2(x1,x2)) | member_2(x0,x1) | member_2(x0,x2) ....... B22 % member_2(x0, union_2(x1, x2)) | ~member_2(x0, union_2(x1, x3)) | member_2(x0, x3) ....... R1 [B6:L0, B22:L1] % member_2(member_of_1_not_of_2_2(union_2(as_0(),bs_0()),cs_0()),union_2(as_0(),bs_0())) ....... U8 % member_2(member_of_1_not_of_2_2(union_2(as_0(), bs_0()), cs_0()), union_2(as_0(), x0)) | member_2(member_of_1_not_of_2_2(union_2(as_0(), bs_0()), cs_0()), bs_0()) ....... R2 [R1:L1, U8:L0] % ~member_2(member_of_1_not_of_2_2(union_2(as_0(),bs_0()),cs_0()),bs_0()) ....... U115 % member_2(member_of_1_not_of_2_2(union_2(as_0(), bs_0()), cs_0()), union_2(as_0(), x0)) ....... R3 [R2:L1, U115:L0] % Derivation of unit clause U926: % ~member_2(x0,x1) | member_2(x0,union_2(x1,x2)) ....... B6 % ~member_2(x0,union_2(x1,x2)) | member_2(x0,x1) | member_2(x0,x2) ....... B22 % member_2(x0, union_2(x1, x2)) | ~member_2(x0, union_2(x3, x1)) | member_2(x0, x3) ....... R1 [B6:L0, B22:L2] % ~member_2(x0,union_2(empty_set_0(),empty_set_0())) ....... U87 % ~member_2(x0, union_2(x1, empty_set_0())) | member_2(x0, x1) ....... R2 [R1:L0, U87:L0] % member_2(member_of_1_not_of_2_2(union_2(as_0(),bs_0()),cs_0()),union_2(as_0(),x0)) ....... U924 % member_2(member_of_1_not_of_2_2(union_2(as_0(), bs_0()), cs_0()), as_0()) ....... R3 [R2:L0, U924:L0] % Derivation of the empty clause: % member_2(member_of_1_not_of_2_2(union_2(as_0(),bs_0()),cs_0()),as_0()) ....... U926 % ~member_2(member_of_1_not_of_2_2(union_2(as_0(),bs_0()),cs_0()),as_0()) ....... U116 % [] ....... R1 [U926:L0, U116:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 296713 % resolvents: 296549 factors: 164 % Number of unit clauses generated: 266242 % % unit clauses generated to total clauses generated: 89.73 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 6 [1] = 67 [2] = 202 [3] = 652 % Total = 927 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 266242 [2] = 30121 [3] = 350 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] equal_elements_2 (+)1 (-)0 % [1] equal_sets_2 (+)13 (-)70 % [2] member_2 (+)115 (-)239 % [3] subset_2 (+)119 (-)370 % ------------------ % Total: (+)248 (-)679 % Total number of unit clauses retained: 927 % Number of clauses skipped because of their length: 15330 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 296727 % Number of unification failures: 315371 % Number of unit to unit unification failures: 72237 % N literal unification failure due to lookup root_id table: 178282 % N base clause resolution failure due to lookup table: 17764 % N UC-BCL resolution dropped due to lookup table: 885 % Max entries in substitution set: 9 % N unit clauses dropped because they exceeded max values: 263380 % N unit clauses dropped because too much nesting: 50441 % 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: 8 % Max term depth in a unit clause: 4 % Number of states in UCFA table: 1737 % Total number of terms of all unit clauses in table: 6365 % Max allowed number of states in UCFA: 80000 % Ratio n states used/total allowed states: 0.02 % Ratio n states used/total unit clauses terms: 0.27 % Number of symbols (columns) in UCFA: 46 % Profile 2: Number of calls to: % ============================== % PTUnify() = 612098 % ConstructUnitClause() = 264301 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.33 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 1 secs % CPU time: 0.96 secs % %------------------------------------------------------------------------------