%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : GRP029-2 : TPTP v5.0.0. Released v1.0.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art07.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 20:42:52 EST 2010 % Result : Unsatisfiable 0.34s % Output : Refutation 0.34s % 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/SystemOnTPTP2061/GRP/GRP029-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 = 69] [nf = 0] [nu = 26] [ut = 12] % Looking for a proof at depth = 2 ... % t = 0 secs [nr = 1907] [nf = 62] [nu = 1128] [ut = 81] % 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(not_right_identity_1(x0),x0,not_right_identity_1(x0)) % B1: product_3(x0,x1,multiply_2(x0,x1)) % B2: product_3(identity_0(),x0,x0) % B10: ~equalish_2(x0,x1) | ~product_3(x2,x0,x3) | product_3(x2,x1,x3) % B12: ~product_3(x0,x1,x3) | ~product_3(x0,x1,x2) | equalish_2(x2,x3) % B14: ~product_3(x0,x4,x5) | ~product_3(x1,x3,x4) | ~product_3(x0,x1,x2) | product_3(x2,x3,x5) % B15: ~product_3(x2,x3,x5) | ~product_3(x1,x3,x4) | ~product_3(x0,x1,x2) | product_3(x0,x4,x5) % Unit Clauses: % -------------- % U2: < d0 v2 dv1 f0 c1 t3 td1 b > product_3(identity_0(),x0,x0) % U3: < d0 v2 dv1 f1 c1 t4 td2 b > product_3(inverse_1(x0),x0,identity_0()) % U16: < d2 v2 dv1 f1 c1 t4 td2 > equalish_2(x0,multiply_2(identity_0(),x0)) % U25: < d2 v2 dv1 f1 c2 t5 td2 > product_3(identity_0(),multiply_2(identity_0(),x0),x0) % U89: < d3 v1 dv1 f1 c2 t4 td2 > ~product_3(x0,identity_0(),not_right_identity_1(identity_0())) % U314: < d3 v1 dv1 f2 c3 t6 td3 > ~product_3(x0,identity_0(),multiply_2(identity_0(),not_right_identity_1(identity_0()))) % U339: < d3 v2 dv1 f3 c2 t7 td3 > product_3(inverse_1(inverse_1(x0)),identity_0(),multiply_2(identity_0(),x0)) % --------------- Start of Proof --------------- % Derivation of unit clause U2: % product_3(identity_0(),x0,x0) ....... U2 % Derivation of unit clause U3: % product_3(inverse_1(x0),x0,identity_0()) ....... U3 % Derivation of unit clause U16: % product_3(x0,x1,multiply_2(x0,x1)) ....... B1 % ~product_3(x0,x1,x3) | ~product_3(x0,x1,x2) | equalish_2(x2,x3) ....... B12 % ~product_3(x0, x1, x2) | equalish_2(x2, multiply_2(x0, x1)) ....... R1 [B1:L0, B12:L0] % product_3(identity_0(),x0,x0) ....... U2 % equalish_2(x0, multiply_2(identity_0(), x0)) ....... R2 [R1:L0, U2:L0] % Derivation of unit clause U25: % product_3(identity_0(),x0,x0) ....... B2 % ~equalish_2(x0,x1) | ~product_3(x2,x0,x3) | product_3(x2,x1,x3) ....... B10 % ~equalish_2(x0, x1) | product_3(identity_0(), x1, x0) ....... R1 [B2:L0, B10:L1] % equalish_2(x0,multiply_2(identity_0(),x0)) ....... U16 % product_3(identity_0(), multiply_2(identity_0(), x0), x0) ....... R2 [R1:L0, U16:L0] % Derivation of unit clause U89: % ~product_3(not_right_identity_1(x0),x0,not_right_identity_1(x0)) ....... B0 % ~product_3(x0,x4,x5) | ~product_3(x1,x3,x4) | ~product_3(x0,x1,x2) | product_3(x2,x3,x5) ....... B14 % ~product_3(x0, x1, not_right_identity_1(x2)) | ~product_3(x3, x2, x1) | ~product_3(x0, x3, not_right_identity_1(x2)) ....... R1 [B0:L0, B14:L3] % ~product_3(x0, x1, not_right_identity_1(x2)) | ~product_3(x1, x2, x1) ....... R2 [R1:L2, R1:L0] % product_3(identity_0(),x0,x0) ....... U2 % ~product_3(x0, identity_0(), not_right_identity_1(identity_0())) ....... R3 [R2:L1, U2:L0] % Derivation of unit clause U314: % product_3(x0,x1,multiply_2(x0,x1)) ....... B1 % ~product_3(x0,x4,x5) | ~product_3(x1,x3,x4) | ~product_3(x0,x1,x2) | product_3(x2,x3,x5) ....... B14 % ~product_3(x0, x1, x2) | ~product_3(x3, x4, x1) | product_3(multiply_2(x0, x3), x4, x2) ....... R1 [B1:L0, B14:L2] % product_3(identity_0(),multiply_2(identity_0(),x0),x0) ....... U25 % ~product_3(x0, x1, multiply_2(identity_0(), x2)) | product_3(multiply_2(identity_0(), x0), x1, x2) ....... R2 [R1:L0, U25:L0] % ~product_3(x0,identity_0(),not_right_identity_1(identity_0())) ....... U89 % ~product_3(x0, identity_0(), multiply_2(identity_0(), not_right_identity_1(identity_0()))) ....... R3 [R2:L1, U89:L0] % Derivation of unit clause U339: % product_3(x0,x1,multiply_2(x0,x1)) ....... B1 % ~product_3(x2,x3,x5) | ~product_3(x1,x3,x4) | ~product_3(x0,x1,x2) | product_3(x0,x4,x5) ....... B15 % ~product_3(x0, x1, x2) | ~product_3(x3, x0, x4) | product_3(x3, x2, multiply_2(x4, x1)) ....... R1 [B1:L0, B15:L0] % product_3(inverse_1(x0),x0,identity_0()) ....... U3 % ~product_3(x0, inverse_1(x1), x2) | product_3(x0, identity_0(), multiply_2(x2, x1)) ....... R2 [R1:L0, U3:L0] % product_3(inverse_1(x0),x0,identity_0()) ....... U3 % product_3(inverse_1(inverse_1(x0)), identity_0(), multiply_2(identity_0(), x0)) ....... R3 [R2:L0, U3:L0] % Derivation of the empty clause: % product_3(inverse_1(inverse_1(x0)),identity_0(),multiply_2(identity_0(),x0)) ....... U339 % ~product_3(x0,identity_0(),multiply_2(identity_0(),not_right_identity_1(identity_0()))) ....... U314 % [] ....... R1 [U339:L0, U314:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 63728 % resolvents: 63609 factors: 119 % Number of unit clauses generated: 61781 % % unit clauses generated to total clauses generated: 96.94 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 5 [1] = 7 [2] = 69 [3] = 259 % Total = 340 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 61781 [2] = 1841 [3] = 106 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] equalish_2 (+)78 (-)16 % [1] product_3 (+)160 (-)86 % ------------------ % Total: (+)238 (-)102 % Total number of unit clauses retained: 340 % Number of clauses skipped because of their length: 4880 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 63741 % Number of unification failures: 104923 % Number of unit to unit unification failures: 14996 % N literal unification failure due to lookup root_id table: 1292 % N base clause resolution failure due to lookup table: 3591 % 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: 61004 % N unit clauses dropped because too much nesting: 16117 % 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: 1057 % Total number of terms of all unit clauses in table: 2438 % Max allowed number of states in UCFA: 80000 % Ratio n states used/total allowed states: 0.01 % Ratio n states used/total unit clauses terms: 0.43 % Number of symbols (columns) in UCFA: 40 % Profile 2: Number of calls to: % ============================== % PTUnify() = 168664 % ConstructUnitClause() = 61339 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.09 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 0 secs % CPU time: 0.34 secs % %------------------------------------------------------------------------------