%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : GRP130-4.003 : TPTP v5.0.0. Bugfixed v1.2.1. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art03.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:28:57 EST 2010 % Result : Unsatisfiable 31.01s % Output : Refutation 31.01s % 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/SystemOnTPTP5506/GRP/GRP130-4.003+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 = 18] [nf = 0] [nu = 0] [ut = 9] % Looking for a proof at depth = 2 ... % t = 0 secs [nr = 54] [nf = 12] [nu = 0] [ut = 9] % Looking for a proof at depth = 3 ... % t = 0 secs [nr = 306] [nf = 504] [nu = 0] [ut = 9] % Looking for a proof at depth = 4 ... % t = 0 secs [nr = 1002] [nf = 996] [nu = 84] [ut = 15] % Looking for a proof at depth = 5 ... % t = 0 secs [nr = 7284] [nf = 12936] [nu = 180] [ut = 15] % Looking for a proof at depth = 6 ... % t = 0 secs [nr = 19362] [nf = 25500] [nu = 744] [ut = 21] % Looking for a proof at depth = 7 ... % t = 1 secs [nr = 148890] [nf = 252168] [nu = 1416] [ut = 21] % Looking for a proof at depth = 8 ... % t = 1 secs [nr = 339654] [nf = 478836] [nu = 7164] [ut = 21] % Looking for a proof at depth = 9 ... % t = 9 secs [nr = 2207730] [nf = 3681648] [nu = 12912] [ut = 21] % Looking for a proof at depth = 10 ... % t = 20 secs [nr = 4782378] [nf = 6884460] [nu = 68412] [ut = 21] % Looking for a proof at depth = 11 ... % Entering time slice 2 % Updating parameters ... done. % Looking for a proof at depth = 1 ... % t = 32 secs [nr = 7502880] [nf = 11569842] [nu = 76110] [ut = 21] % Looking for a proof at depth = 2 ... % t = 32 secs [nr = 7502964] [nf = 11569854] [nu = 76122] [ut = 21] % Looking for a proof at depth = 3 ... % t = 32 secs [nr = 7503324] [nf = 11570454] [nu = 76134] [ut = 21] % Looking for a proof at depth = 4 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: ~product_3(x0,x2,x3) | ~product_3(x3,x1,x0) | product_3(x0,x1,x2) % B2: ~product_3(x0,x2,x3) | ~product_3(x0,x1,x2) | product_3(x3,x1,x0) % B3: group_element_1(e_1_0()) % B4: group_element_1(e_2_0()) % B6: ~equalish_2(e_1_0(),e_2_0()) % B12: ~product_3(x0,x1,x3) | ~product_3(x0,x1,x2) | equalish_2(x2,x3) % B15: ~group_element_1(x1) | ~group_element_1(x0) | product_3(x0,x1,e_1_0()) | product_3(x0,x1,e_2_0()) | product_3(x0,x1,e_3_0()) % Unit Clauses: % -------------- % U1: < d0 v0 dv0 f0 c1 t1 td1 b > group_element_1(e_2_0()) % U2: < d0 v0 dv0 f0 c1 t1 td1 b > group_element_1(e_3_0()) % U3: < d0 v0 dv0 f0 c2 t2 td1 b > ~equalish_2(e_1_0(),e_2_0()) % U8: < d0 v0 dv0 f0 c2 t2 td1 b > ~equalish_2(e_3_0(),e_2_0()) % U9: < d4 v0 dv0 f0 c3 t3 td1 > ~product_3(e_1_0(),e_2_0(),e_1_0()) % U14: < d4 v0 dv0 f0 c3 t3 td1 > ~product_3(e_3_0(),e_2_0(),e_3_0()) % U15: < d6 v0 dv0 f0 c3 t3 td1 > ~product_3(e_1_0(),e_2_0(),e_2_0()) % U20: < d6 v0 dv0 f0 c3 t3 td1 > ~product_3(e_3_0(),e_2_0(),e_2_0()) % U23: < d4 v0 dv0 f0 c3 t3 td1 > product_3(e_1_0(),e_2_0(),e_3_0()) % U26: < d4 v0 dv0 f0 c3 t3 td1 > product_3(e_3_0(),e_2_0(),e_1_0()) % U30: < d4 v0 dv0 f0 c3 t3 td1 > ~product_3(e_1_0(),e_2_0(),e_3_0()) % --------------- Start of Proof --------------- % Derivation of unit clause U1: % group_element_1(e_2_0()) ....... U1 % Derivation of unit clause U2: % group_element_1(e_3_0()) ....... U2 % Derivation of unit clause U3: % ~equalish_2(e_1_0(),e_2_0()) ....... U3 % Derivation of unit clause U8: % ~equalish_2(e_3_0(),e_2_0()) ....... U8 % Derivation of unit clause U9: % ~product_3(x0,x2,x3) | ~product_3(x3,x1,x0) | product_3(x0,x1,x2) ....... B0 % ~product_3(x0, x1, x0) | product_3(x0, x1, x1) ....... R1 [B0:L0, B0:L1] % ~product_3(x0,x1,x3) | ~product_3(x0,x1,x2) | equalish_2(x2,x3) ....... B12 % ~product_3(x0, x1, x0) | ~product_3(x0, x1, x2) | equalish_2(x2, x1) ....... R2 [R1:L1, B12:L0] % ~product_3(x0, x1, x0) | equalish_2(x0, x1) ....... R3 [R2:L0, R2:L1] % ~equalish_2(e_1_0(),e_2_0()) ....... U3 % ~product_3(e_1_0(), e_2_0(), e_1_0()) ....... R4 [R3:L1, U3:L0] % Derivation of unit clause U14: % ~product_3(x0,x2,x3) | ~product_3(x3,x1,x0) | product_3(x0,x1,x2) ....... B0 % ~product_3(x0, x1, x0) | product_3(x0, x1, x1) ....... R1 [B0:L0, B0:L1] % ~product_3(x0,x1,x3) | ~product_3(x0,x1,x2) | equalish_2(x2,x3) ....... B12 % ~product_3(x0, x1, x0) | ~product_3(x0, x1, x2) | equalish_2(x2, x1) ....... R2 [R1:L1, B12:L0] % ~product_3(x0, x1, x0) | equalish_2(x0, x1) ....... R3 [R2:L0, R2:L1] % ~equalish_2(e_3_0(),e_2_0()) ....... U8 % ~product_3(e_3_0(), e_2_0(), e_3_0()) ....... R4 [R3:L1, U8:L0] % Derivation of unit clause U15: % ~product_3(x0,x2,x3) | ~product_3(x0,x1,x2) | product_3(x3,x1,x0) ....... B2 % ~product_3(x0, x1, x1) | product_3(x1, x1, x0) ....... R1 [B2:L0, B2:L1] % ~product_3(x0,x2,x3) | ~product_3(x3,x1,x0) | product_3(x0,x1,x2) ....... B0 % ~product_3(x0, x1, x1) | ~product_3(x0, x2, x1) | product_3(x1, x2, x1) ....... R2 [R1:L1, B0:L0] % ~product_3(x0, x1, x1) | product_3(x1, x1, x1) ....... R3 [R2:L0, R2:L1] % ~product_3(x3,x1,x2) | ~product_3(x0,x1,x2) | equalish_2(x0,x3) ....... B14 % ~product_3(x0, x1, x1) | ~product_3(x2, x1, x1) | equalish_2(x2, x1) ....... R4 [R3:L1, B14:L0] % ~product_3(x0, x1, x1) | equalish_2(x0, x1) ....... R5 [R4:L0, R4:L1] % ~equalish_2(e_1_0(),e_2_0()) ....... U3 % ~product_3(e_1_0(), e_2_0(), e_2_0()) ....... R6 [R5:L1, U3:L0] % Derivation of unit clause U20: % ~product_3(x0,x2,x3) | ~product_3(x0,x1,x2) | product_3(x3,x1,x0) ....... B2 % ~product_3(x0, x1, x1) | product_3(x1, x1, x0) ....... R1 [B2:L0, B2:L1] % ~product_3(x0,x2,x3) | ~product_3(x3,x1,x0) | product_3(x0,x1,x2) ....... B0 % ~product_3(x0, x1, x1) | ~product_3(x0, x2, x1) | product_3(x1, x2, x1) ....... R2 [R1:L1, B0:L0] % ~product_3(x0, x1, x1) | product_3(x1, x1, x1) ....... R3 [R2:L0, R2:L1] % ~product_3(x3,x1,x2) | ~product_3(x0,x1,x2) | equalish_2(x0,x3) ....... B14 % ~product_3(x0, x1, x1) | ~product_3(x2, x1, x1) | equalish_2(x2, x1) ....... R4 [R3:L1, B14:L0] % ~product_3(x0, x1, x1) | equalish_2(x0, x1) ....... R5 [R4:L0, R4:L1] % ~equalish_2(e_3_0(),e_2_0()) ....... U8 % ~product_3(e_3_0(), e_2_0(), e_2_0()) ....... R6 [R5:L1, U8:L0] % Derivation of unit clause U23: % group_element_1(e_1_0()) ....... B3 % ~group_element_1(x1) | ~group_element_1(x0) | product_3(x0,x1,e_1_0()) | product_3(x0,x1,e_2_0()) | product_3(x0,x1,e_3_0()) ....... B15 % ~group_element_1(x0) | product_3(e_1_0(), x0, e_1_0()) | product_3(e_1_0(), x0, e_2_0()) | product_3(e_1_0(), x0, e_3_0()) ....... R1 [B3:L0, B15:L1] % group_element_1(e_2_0()) ....... U1 % product_3(e_1_0(), e_2_0(), e_1_0()) | product_3(e_1_0(), e_2_0(), e_2_0()) | product_3(e_1_0(), e_2_0(), e_3_0()) ....... R2 [R1:L0, U1:L0] % ~product_3(e_1_0(),e_2_0(),e_1_0()) ....... U9 % product_3(e_1_0(), e_2_0(), e_2_0()) | product_3(e_1_0(), e_2_0(), e_3_0()) ....... R3 [R2:L0, U9:L0] % ~product_3(e_1_0(),e_2_0(),e_2_0()) ....... U15 % product_3(e_1_0(), e_2_0(), e_3_0()) ....... R4 [R3:L0, U15:L0] % Derivation of unit clause U26: % group_element_1(e_2_0()) ....... B4 % ~group_element_1(x1) | ~group_element_1(x0) | product_3(x0,x1,e_1_0()) | product_3(x0,x1,e_2_0()) | product_3(x0,x1,e_3_0()) ....... B15 % ~group_element_1(x0) | product_3(x0, e_2_0(), e_1_0()) | product_3(x0, e_2_0(), e_2_0()) | product_3(x0, e_2_0(), e_3_0()) ....... R1 [B4:L0, B15:L0] % group_element_1(e_3_0()) ....... U2 % product_3(e_3_0(), e_2_0(), e_1_0()) | product_3(e_3_0(), e_2_0(), e_2_0()) | product_3(e_3_0(), e_2_0(), e_3_0()) ....... R2 [R1:L0, U2:L0] % ~product_3(e_3_0(),e_2_0(),e_2_0()) ....... U20 % product_3(e_3_0(), e_2_0(), e_1_0()) | product_3(e_3_0(), e_2_0(), e_3_0()) ....... R3 [R2:L1, U20:L0] % ~product_3(e_3_0(),e_2_0(),e_3_0()) ....... U14 % product_3(e_3_0(), e_2_0(), e_1_0()) ....... R4 [R3:L1, U14:L0] % Derivation of unit clause U30: % ~equalish_2(e_1_0(),e_2_0()) ....... B6 % ~product_3(x0,x1,x3) | ~product_3(x0,x1,x2) | equalish_2(x2,x3) ....... B12 % ~product_3(x0, x1, e_2_0()) | ~product_3(x0, x1, e_1_0()) ....... R1 [B6:L0, B12:L2] % ~product_3(x0,x2,x3) | ~product_3(x3,x1,x0) | product_3(x0,x1,x2) ....... B0 % ~product_3(x0, x1, e_1_0()) | ~product_3(x0, e_2_0(), x2) | ~product_3(x2, x1, x0) ....... R2 [R1:L0, B0:L2] % ~product_3(x0, e_2_0(), e_1_0()) | ~product_3(e_1_0(), e_2_0(), x0) ....... R3 [R2:L0, R2:L1] % product_3(e_3_0(),e_2_0(),e_1_0()) ....... U26 % ~product_3(e_1_0(), e_2_0(), e_3_0()) ....... R4 [R3:L0, U26:L0] % Derivation of the empty clause: % ~product_3(e_1_0(),e_2_0(),e_3_0()) ....... U30 % product_3(e_1_0(),e_2_0(),e_3_0()) ....... U23 % [] ....... R1 [U30:L0, U23:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 19076332 % resolvents: 7505655 factors: 11570677 % Number of unit clauses generated: 76429 % % unit clauses generated to total clauses generated: 0.40 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 9 [4] = 16 [6] = 6 % Total = 31 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 76429 [2] = 12527264 [3] = 6472507 [4] = 132 % Average size of a generated clause: 3.0 % Number of unit clauses per predicate list: % ========================================== % [0] group_element_1 (+)3 (-)0 % [1] equalish_2 (+)0 (-)6 % [2] product_3 (+)9 (-)13 % ------------------ % Total: (+)12 (-)19 % Total number of unit clauses retained: 31 % Number of clauses skipped because of their length: 27770566 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 19076364 % Number of unification failures: 16834879 % Number of unit to unit unification failures: 110 % N literal unification failure due to lookup root_id table: 27965529 % N base clause resolution failure due to lookup table: 859812 % N UC-BCL resolution dropped due to lookup table: 0 % Max entries in substitution set: 24 % N unit clauses dropped because they exceeded max values: 55611 % 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: 31 % Total number of terms of all unit clauses in table: 81 % 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.38 % Number of symbols (columns) in UCFA: 40 % Profile 2: Number of calls to: % ============================== % PTUnify() = 35911243 % ConstructUnitClause() = 55633 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.05 secs % -------------------------------------------------------- % | | % Inferences per sec: 615366 % | | % -------------------------------------------------------- % Elapsed time: 32 secs % CPU time: 31.00 secs % %------------------------------------------------------------------------------