%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : GRP031-2 : TPTP v5.0.0. Released v1.0.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 : Sat Nov 27 20:43:04 EST 2010 % Result : Unsatisfiable 0.19s % Output : Refutation 0.19s % 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/SystemOnTPTP8799/GRP/GRP031-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 = 0] [nf = 0] [nu = 0] [ut = 4] % Looking for a proof at depth = 2 ... % t = 0 secs [nr = 20] [nf = 34] [nu = 0] [ut = 4] % 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(x0,a_0(),identity_0()) % B1: product_3(x0,x1,multiply_2(x0,x1)) % B5: ~product_3(x0,x4,x5) | ~product_3(x1,x3,x4) | ~product_3(x0,x1,x2) | product_3(x2,x3,x5) % B6: ~product_3(x2,x3,x5) | ~product_3(x1,x3,x4) | ~product_3(x0,x1,x2) | product_3(x0,x4,x5) % Unit Clauses: % -------------- % U1: < d0 v4 dv2 f1 c0 t5 td2 b > product_3(x0,x1,multiply_2(x0,x1)) % U2: < d0 v2 dv1 f0 c1 t3 td1 b > product_3(x0,identity_0(),x0) % U3: < d0 v2 dv1 f1 c1 t4 td2 b > product_3(x0,inverse_1(x0),identity_0()) % U19: < d3 v1 dv1 f1 c2 t4 td2 > ~product_3(identity_0(),inverse_1(x0),a_0()) % U79: < d3 v3 dv2 f3 c1 t7 td3 > ~product_3(x0,multiply_2(inverse_1(x0),inverse_1(x1)),a_0()) % U121: < d3 v4 dv2 f2 c0 t6 td2 > product_3(multiply_2(x0,x1),inverse_1(x1),x0) % U231: < d3 v4 dv2 f2 c0 t6 td3 > product_3(x0,multiply_2(x1,inverse_1(x1)),x0) % --------------- Start of Proof --------------- % Derivation of unit clause U1: % product_3(x0,x1,multiply_2(x0,x1)) ....... U1 % Derivation of unit clause U2: % product_3(x0,identity_0(),x0) ....... U2 % Derivation of unit clause U3: % product_3(x0,inverse_1(x0),identity_0()) ....... U3 % Derivation of unit clause U19: % ~product_3(x0,a_0(),identity_0()) ....... B0 % ~product_3(x2,x3,x5) | ~product_3(x1,x3,x4) | ~product_3(x0,x1,x2) | product_3(x0,x4,x5) ....... B6 % ~product_3(x0, x1, identity_0()) | ~product_3(x2, x1, a_0()) | ~product_3(x3, x2, x0) ....... R1 [B0:L0, B6:L3] % product_3(x0,inverse_1(x0),identity_0()) ....... U3 % ~product_3(x0, inverse_1(x1), a_0()) | ~product_3(x2, x0, x1) ....... R2 [R1:L0, U3:L0] % product_3(x0,identity_0(),x0) ....... U2 % ~product_3(identity_0(), inverse_1(x0), a_0()) ....... R3 [R2:L1, U2:L0] % Derivation of unit clause U79: % 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) ....... B5 % ~product_3(x0, multiply_2(x1, x2), x3) | ~product_3(x0, x1, x4) | product_3(x4, x2, x3) ....... R1 [B1:L0, B5:L1] % product_3(x0,inverse_1(x0),identity_0()) ....... U3 % ~product_3(x0, multiply_2(inverse_1(x0), x1), x2) | product_3(identity_0(), x1, x2) ....... R2 [R1:L1, U3:L0] % ~product_3(identity_0(),inverse_1(x0),a_0()) ....... U19 % ~product_3(x0, multiply_2(inverse_1(x0), inverse_1(x1)), a_0()) ....... R3 [R2:L1, U19:L0] % Derivation of unit clause U121: % 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) ....... B5 % ~product_3(x0, x1, x2) | ~product_3(x3, x4, x1) | product_3(multiply_2(x0, x3), x4, x2) ....... R1 [B1:L0, B5:L2] % product_3(x0,identity_0(),x0) ....... U2 % ~product_3(x0, x1, identity_0()) | product_3(multiply_2(x2, x0), x1, x2) ....... R2 [R1:L0, U2:L0] % product_3(x0,inverse_1(x0),identity_0()) ....... U3 % product_3(multiply_2(x0, x1), inverse_1(x1), x0) ....... R3 [R2:L0, U3:L0] % Derivation of unit clause U231: % 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) ....... B6 % ~product_3(x0, x1, x2) | ~product_3(x3, x4, x0) | product_3(x3, multiply_2(x4, x1), x2) ....... R1 [B1:L0, B6:L1] % product_3(multiply_2(x0,x1),inverse_1(x1),x0) ....... U121 % ~product_3(x0, x1, multiply_2(x2, x3)) | product_3(x0, multiply_2(x1, inverse_1(x3)), x2) ....... R2 [R1:L0, U121:L0] % product_3(x0,x1,multiply_2(x0,x1)) ....... U1 % product_3(x0, multiply_2(x1, inverse_1(x1)), x0) ....... R3 [R2:L0, U1:L0] % Derivation of the empty clause: % product_3(x0,multiply_2(x1,inverse_1(x1)),x0) ....... U231 % ~product_3(x0,multiply_2(inverse_1(x0),inverse_1(x1)),a_0()) ....... U79 % [] ....... R1 [U231:L0, U79:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 11300 % resolvents: 11250 factors: 50 % Number of unit clauses generated: 10767 % % unit clauses generated to total clauses generated: 95.28 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 4 [3] = 228 % Total = 232 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 10767 [2] = 506 [3] = 27 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] equalish_2 (+)0 (-)0 % [1] product_3 (+)102 (-)130 % ------------------ % Total: (+)102 (-)130 % Total number of unit clauses retained: 232 % Number of clauses skipped because of their length: 28 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 11312 % Number of unification failures: 40085 % Number of unit to unit unification failures: 13187 % N literal unification failure due to lookup root_id table: 19 % N base clause resolution failure due to lookup table: 0 % N UC-BCL resolution dropped due to lookup table: 0 % Max entries in substitution set: 10 % N unit clauses dropped because they exceeded max values: 10539 % N unit clauses dropped because too much nesting: 1398 % 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: 579 % Total number of terms of all unit clauses in table: 1594 % 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.36 % Number of symbols (columns) in UCFA: 40 % Profile 2: Number of calls to: % ============================== % PTUnify() = 51397 % ConstructUnitClause() = 10767 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.02 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 0 secs % CPU time: 0.18 secs % %------------------------------------------------------------------------------