%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : GRP135-1.002 : TPTP v5.0.0. Released v1.2.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 : Sat Nov 27 21:39:37 EST 2010 % Result : Unsatisfiable 31.00s % Output : Refutation 31.00s % 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/SystemOnTPTP5706/GRP/GRP135-1.002+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 = 6] [nf = 0] [nu = 0] [ut = 4] % Looking for a proof at depth = 2 ... % t = 0 secs [nr = 22] [nf = 8] [nu = 0] [ut = 4] % Looking for a proof at depth = 3 ... % t = 0 secs [nr = 90] [nf = 94] [nu = 0] [ut = 4] % Looking for a proof at depth = 4 ... % t = 0 secs [nr = 374] [nf = 200] [nu = 0] [ut = 4] % Looking for a proof at depth = 5 ... % t = 0 secs [nr = 1034] [nf = 646] [nu = 0] [ut = 4] % Looking for a proof at depth = 6 ... % t = 0 secs [nr = 3266] [nf = 1552] [nu = 0] [ut = 4] % Looking for a proof at depth = 7 ... % t = 0 secs [nr = 18294] [nf = 5555] [nu = 2794] [ut = 14] % Looking for a proof at depth = 8 ... % t = 0 secs [nr = 65576] [nf = 45037] [nu = 7638] [ut = 14] % Looking for a proof at depth = 9 ... % t = 0 secs [nr = 139438] [nf = 112967] [nu = 17922] [ut = 14] % Looking for a proof at depth = 10 ... % t = 1 secs [nr = 313716] [nf = 366685] [nu = 30254] [ut = 14] % Looking for a proof at depth = 11 ... % t = 2 secs [nr = 601066] [nf = 833611] [nu = 59650] [ut = 14] % Looking for a proof at depth = 12 ... % t = 6 secs [nr = 1370592] [nf = 2492201] [nu = 97238] [ut = 14] % Looking for a proof at depth = 13 ... % t = 13 secs [nr = 2762590] [nf = 5792879] [nu = 193842] [ut = 14] % Looking for a proof at depth = 14 ... % Entering time slice 2 % Updating parameters ... done. % Looking for a proof at depth = 1 ... % t = 31 secs [nr = 6153398] [nf = 15350381] [nu = 303202] [ut = 14] % Looking for a proof at depth = 2 ... % t = 31 secs [nr = 6153432] [nf = 15350389] [nu = 303210] [ut = 14] % Looking for a proof at depth = 3 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: ~product_3(x2,x0,x3) | ~product_3(x0,x1,x2) | product_3(x3,x0,x1) % B1: group_element_1(e_1_0()) % B2: group_element_1(e_2_0()) % B8: ~group_element_1(x1) | ~group_element_1(x0) | product_3(x0,x1,e_1_0()) | product_3(x0,x1,e_2_0()) % Unit Clauses: % -------------- % U0: < d0 v0 dv0 f0 c1 t1 td1 b > group_element_1(e_1_0()) % U1: < d0 v0 dv0 f0 c1 t1 td1 b > group_element_1(e_2_0()) % U2: < d0 v0 dv0 f0 c2 t2 td1 b > ~equalish_2(e_1_0(),e_2_0()) % U3: < d0 v0 dv0 f0 c2 t2 td1 b > ~equalish_2(e_2_0(),e_1_0()) % U4: < d7 v0 dv0 f0 c3 t3 td1 > ~product_3(e_2_0(),e_1_0(),e_1_0()) % U7: < d7 v0 dv0 f0 c3 t3 td1 > ~product_3(e_1_0(),e_2_0(),e_2_0()) % U11: < d7 v1 dv1 f0 c2 t3 td1 > ~product_3(e_1_0(),e_1_0(),x0) % U14: < d3 v0 dv0 f0 c3 t3 td1 > product_3(e_1_0(),e_1_0(),e_2_0()) % --------------- Start of Proof --------------- % Derivation of unit clause U0: % group_element_1(e_1_0()) ....... U0 % Derivation of unit clause U1: % group_element_1(e_2_0()) ....... U1 % Derivation of unit clause U2: % ~equalish_2(e_1_0(),e_2_0()) ....... U2 % Derivation of unit clause U3: % ~equalish_2(e_2_0(),e_1_0()) ....... U3 % Derivation of unit clause U4: % group_element_1(e_1_0()) ....... B1 % ~group_element_1(x1) | ~group_element_1(x0) | product_3(x0,x1,e_1_0()) | product_3(x0,x1,e_2_0()) ....... B8 % ~group_element_1(x0) | product_3(x0, e_1_0(), e_1_0()) | product_3(x0, e_1_0(), e_2_0()) ....... R1 [B1:L0, B8:L0] % group_element_1(e_1_0()) ....... U0 % product_3(e_1_0(), e_1_0(), e_1_0()) | product_3(e_1_0(), e_1_0(), e_2_0()) ....... R2 [R1:L0, U0:L0] % ~product_3(x2,x0,x3) | ~product_3(x0,x1,x2) | product_3(x3,x0,x1) ....... B0 % product_3(e_1_0(), e_1_0(), e_1_0()) | ~product_3(e_2_0(), e_1_0(), x0) | product_3(x0, e_1_0(), e_1_0()) ....... R3 [R2:L1, B0:L1] % ~product_3(e_2_0(), e_1_0(), e_1_0()) | product_3(e_1_0(), e_1_0(), e_1_0()) ....... R4 [R3:L0, R3:L2] % ~product_3(x3,x1,x2) | ~product_3(x0,x1,x2) | equalish_2(x0,x3) ....... B7 % ~product_3(e_2_0(), e_1_0(), e_1_0()) | ~product_3(x0, e_1_0(), e_1_0()) | equalish_2(x0, e_1_0()) ....... R5 [R4:L1, B7:L0] % ~product_3(e_2_0(), e_1_0(), e_1_0()) | equalish_2(e_2_0(), e_1_0()) ....... R6 [R5:L0, R5:L1] % ~equalish_2(e_2_0(),e_1_0()) ....... U3 % ~product_3(e_2_0(), e_1_0(), e_1_0()) ....... R7 [R6:L1, U3:L0] % Derivation of unit clause U7: % group_element_1(e_2_0()) ....... B2 % ~group_element_1(x1) | ~group_element_1(x0) | product_3(x0,x1,e_1_0()) | product_3(x0,x1,e_2_0()) ....... B8 % ~group_element_1(x0) | product_3(x0, e_2_0(), e_1_0()) | product_3(x0, e_2_0(), e_2_0()) ....... R1 [B2:L0, B8:L0] % group_element_1(e_2_0()) ....... U1 % product_3(e_2_0(), e_2_0(), e_1_0()) | product_3(e_2_0(), e_2_0(), e_2_0()) ....... R2 [R1:L0, U1:L0] % ~product_3(x2,x0,x3) | ~product_3(x0,x1,x2) | product_3(x3,x0,x1) ....... B0 % product_3(e_2_0(), e_2_0(), e_2_0()) | ~product_3(e_1_0(), e_2_0(), x0) | product_3(x0, e_2_0(), e_2_0()) ....... R3 [R2:L0, B0:L1] % ~product_3(e_1_0(), e_2_0(), e_2_0()) | product_3(e_2_0(), e_2_0(), e_2_0()) ....... R4 [R3:L0, R3:L2] % ~product_3(x3,x1,x2) | ~product_3(x0,x1,x2) | equalish_2(x0,x3) ....... B7 % ~product_3(e_1_0(), e_2_0(), e_2_0()) | ~product_3(x0, e_2_0(), e_2_0()) | equalish_2(x0, e_2_0()) ....... R5 [R4:L1, B7:L0] % ~product_3(e_1_0(), e_2_0(), e_2_0()) | equalish_2(e_1_0(), e_2_0()) ....... R6 [R5:L0, R5:L1] % ~equalish_2(e_1_0(),e_2_0()) ....... U2 % ~product_3(e_1_0(), e_2_0(), e_2_0()) ....... R7 [R6:L1, U2:L0] % Derivation of unit clause U11: % group_element_1(e_2_0()) ....... B2 % ~group_element_1(x1) | ~group_element_1(x0) | product_3(x0,x1,e_1_0()) | product_3(x0,x1,e_2_0()) ....... B8 % ~group_element_1(x0) | product_3(x0, e_2_0(), e_1_0()) | product_3(x0, e_2_0(), e_2_0()) ....... R1 [B2:L0, B8:L0] % ~product_3(e_1_0(),e_2_0(),e_2_0()) ....... U7 % ~group_element_1(e_1_0()) | product_3(e_1_0(), e_2_0(), e_1_0()) ....... R2 [R1:L2, U7:L0] % ~product_3(x2,x0,x3) | ~product_3(x0,x1,x2) | product_3(x3,x0,x1) ....... B0 % ~group_element_1(e_1_0()) | ~product_3(e_1_0(), e_1_0(), x0) | product_3(x0, e_1_0(), e_2_0()) ....... R3 [R2:L1, B0:L1] % group_element_1(e_1_0()) ....... U0 % ~product_3(e_1_0(), e_1_0(), x0) | product_3(x0, e_1_0(), e_2_0()) ....... R4 [R3:L0, U0:L0] % ~product_3(x2,x0,x3) | ~product_3(x0,x1,x2) | product_3(x3,x0,x1) ....... B0 % ~product_3(e_1_0(), e_1_0(), x0) | ~product_3(e_1_0(), x1, x0) | product_3(e_2_0(), e_1_0(), x1) ....... R5 [R4:L1, B0:L0] % ~product_3(e_1_0(), e_1_0(), x0) | product_3(e_2_0(), e_1_0(), e_1_0()) ....... R6 [R5:L0, R5:L1] % ~product_3(e_2_0(),e_1_0(),e_1_0()) ....... U4 % ~product_3(e_1_0(), e_1_0(), x0) ....... R7 [R6:L1, U4:L0] % Derivation of unit clause U14: % group_element_1(e_1_0()) ....... B1 % ~group_element_1(x1) | ~group_element_1(x0) | product_3(x0,x1,e_1_0()) | product_3(x0,x1,e_2_0()) ....... B8 % ~group_element_1(x0) | product_3(x0, e_1_0(), e_1_0()) | product_3(x0, e_1_0(), e_2_0()) ....... R1 [B1:L0, B8:L0] % group_element_1(e_1_0()) ....... U0 % product_3(e_1_0(), e_1_0(), e_1_0()) | product_3(e_1_0(), e_1_0(), e_2_0()) ....... R2 [R1:L0, U0:L0] % ~product_3(e_1_0(),e_1_0(),x0) ....... U11 % product_3(e_1_0(), e_1_0(), e_2_0()) ....... R3 [R2:L0, U11:L0] % Derivation of the empty clause: % product_3(e_1_0(),e_1_0(),e_2_0()) ....... U14 % ~product_3(e_1_0(),e_1_0(),x0) ....... U11 % [] ....... R1 [U14:L0, U11:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 21503916 % resolvents: 6153481 factors: 15350435 % Number of unit clauses generated: 303219 % % unit clauses generated to total clauses generated: 1.41 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 4 [3] = 1 % [7] = 10 % Total = 15 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 303219 [2] = 15901316 [3] = 5299319 [4] = 57 [5] = 5 % Average size of a generated clause: 3.0 % Number of unit clauses per predicate list: % ========================================== % [0] group_element_1 (+)2 (-)0 % [1] equalish_2 (+)0 (-)2 % [2] product_3 (+)1 (-)10 % ------------------ % Total: (+)3 (-)12 % Total number of unit clauses retained: 15 % Number of clauses skipped because of their length: 17299590 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 21503940 % Number of unification failures: 6247816 % Number of unit to unit unification failures: 7 % N literal unification failure due to lookup root_id table: 50414787 % N base clause resolution failure due to lookup table: 1288720 % N UC-BCL resolution dropped due to lookup table: 0 % Max entries in substitution set: 29 % N unit clauses dropped because they exceeded max values: 126460 % 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: 3 % Max term depth in a unit clause: 1 % Number of states in UCFA table: 17 % Total number of terms of all unit clauses in table: 39 % 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.44 % Number of symbols (columns) in UCFA: 39 % Profile 2: Number of calls to: % ============================== % PTUnify() = 27751756 % ConstructUnitClause() = 126471 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.15 secs % -------------------------------------------------------- % | | % Inferences per sec: 693675 % | | % -------------------------------------------------------- % Elapsed time: 31 secs % CPU time: 31.00 secs % %------------------------------------------------------------------------------