%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : NUM014-1 : TPTP v5.0.0. Released v1.0.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art01.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 03:05:59 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/SystemOnTPTP31654/NUM/NUM014-1+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 = 1 secs [nr = 17] [nf = 0] [nu = 14] [ut = 10] % Looking for a proof at depth = 2 ... % t = 1 secs [nr = 55] [nf = 0] [nu = 42] [ut = 10] % Looking for a proof at depth = 3 ... % t = 1 secs [nr = 140] [nf = 0] [nu = 102] [ut = 10] % Looking for a proof at depth = 4 ... % t = 1 secs [nr = 324] [nf = 0] [nu = 230] [ut = 10] % Looking for a proof at depth = 5 ... % t = 1 secs [nr = 711] [nf = 0] [nu = 498] [ut = 10] % Looking for a proof at depth = 6 ... % t = 1 secs [nr = 1509] [nf = 0] [nu = 1050] [ut = 10] % Looking for a proof at depth = 7 ... % t = 1 secs [nr = 3134] [nf = 0] [nu = 2174] [ut = 10] % Looking for a proof at depth = 8 ... % t = 1 secs [nr = 6418] [nf = 0] [nu = 4446] [ut = 10] % Looking for a proof at depth = 9 ... % t = 1 secs [nr = 13025] [nf = 0] [nu = 9018] [ut = 10] % Looking for a proof at depth = 10 ... % t = 1 secs [nr = 26283] [nf = 0] [nu = 18194] [ut = 10] % Looking for a proof at depth = 11 ... % t = 1 secs [nr = 52848] [nf = 0] [nu = 36582] [ut = 10] % Looking for a proof at depth = 12 ... % t = 1 secs [nr = 106032] [nf = 0] [nu = 73398] [ut = 10] % Looking for a proof at depth = 13 ... % t = 1 secs [nr = 212459] [nf = 0] [nu = 147074] [ut = 10] % Looking for a proof at depth = 14 ... % t = 1 secs [nr = 425377] [nf = 0] [nu = 294474] [ut = 10] % Looking for a proof at depth = 15 ... % t = 2 secs [nr = 851282] [nf = 0] [nu = 589326] [ut = 10] % Looking for a proof at depth = 16 ... % t = 3 secs [nr = 1703166] [nf = 0] [nu = 1179086] [ut = 10] % Looking for a proof at depth = 17 ... % t = 6 secs [nr = 3407013] [nf = 0] [nu = 2358666] [ut = 10] % Looking for a proof at depth = 18 ... % t = 12 secs [nr = 6814791] [nf = 0] [nu = 4717890] [ut = 10] % Looking for a proof at depth = 19 ... % t = 22 secs [nr = 13630436] [nf = 0] [nu = 9436406] [ut = 10] % Looking for a proof at depth = 20 ... % Entering time slice 2 % Updating parameters ... done. % Looking for a proof at depth = 1 ... % t = 32 secs [nr = 19827384] [nf = 4] [nu = 13726639] [ut = 10] % Looking for a proof at depth = 2 ... % t = 32 secs [nr = 19827422] [nf = 4] [nu = 13726667] [ut = 10] % Looking for a proof at depth = 3 ... % t = 32 secs [nr = 19827512] [nf = 8] [nu = 13726727] [ut = 10] % Looking for a proof at depth = 4 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: ~divides_2(a_0(),b_0()) % B3: product_3(a_0(),square_1(c_0()),square_1(b_0())) % B4: ~product_3(x0,x1,x2) | divides_2(x0,x2) % B6: ~prime_1(x0) | ~divides_2(x0,x3) | ~product_3(x1,x2,x3) | divides_2(x0,x1) | divides_2(x0,x2) % Unit Clauses: % -------------- % U0: < d0 v0 dv0 f0 c2 t2 td1 b nc > ~divides_2(a_0(),b_0()) % U1: < d0 v3 dv1 f1 c0 t4 td2 b > product_3(x0,x0,square_1(x0)) % U2: < d0 v0 dv0 f0 c1 t1 td1 b > prime_1(a_0()) % U6: < d1 v0 dv0 f1 c2 t3 td2 > divides_2(a_0(),square_1(b_0())) % U11: < d4 v0 dv0 f0 c2 t2 td1 > divides_2(a_0(),b_0()) % --------------- Start of Proof --------------- % Derivation of unit clause U0: % ~divides_2(a_0(),b_0()) ....... U0 % Derivation of unit clause U1: % product_3(x0,x0,square_1(x0)) ....... U1 % Derivation of unit clause U2: % prime_1(a_0()) ....... U2 % Derivation of unit clause U6: % product_3(a_0(),square_1(c_0()),square_1(b_0())) ....... B3 % ~product_3(x0,x1,x2) | divides_2(x0,x2) ....... B4 % divides_2(a_0(), square_1(b_0())) ....... R1 [B3:L0, B4:L0] % Derivation of unit clause U11: % ~divides_2(a_0(),b_0()) ....... B0 % ~prime_1(x0) | ~divides_2(x0,x3) | ~product_3(x1,x2,x3) | divides_2(x0,x1) | divides_2(x0,x2) ....... B6 % ~prime_1(a_0()) | ~divides_2(a_0(), x0) | ~product_3(b_0(), x1, x0) | divides_2(a_0(), x1) ....... R1 [B0:L0, B6:L3] % prime_1(a_0()) ....... U2 % ~divides_2(a_0(), x0) | ~product_3(b_0(), x1, x0) | divides_2(a_0(), x1) ....... R2 [R1:L0, U2:L0] % divides_2(a_0(),square_1(b_0())) ....... U6 % ~product_3(b_0(), x0, square_1(b_0())) | divides_2(a_0(), x0) ....... R3 [R2:L0, U6:L0] % product_3(x0,x0,square_1(x0)) ....... U1 % divides_2(a_0(), b_0()) ....... R4 [R3:L0, U1:L0] % Derivation of the empty clause: % divides_2(a_0(),b_0()) ....... U11 % ~divides_2(a_0(),b_0()) ....... U0 % [] ....... R1 [U11:L0, U0:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 19827528 % resolvents: 19827520 factors: 8 % Number of unit clauses generated: 13726730 % % unit clauses generated to total clauses generated: 69.23 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 4 [1] = 6 [4] = 2 % Total = 12 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 13726730 [2] = 6100782 [3] = 5 [4] = 10 [5] = 1 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] prime_1 (+)1 (-)0 % [1] divides_2 (+)4 (-)1 % [2] product_3 (+)3 (-)3 % ------------------ % Total: (+)8 (-)4 % Total number of unit clauses retained: 12 % Number of clauses skipped because of their length: 23 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 19827533 % Number of unification failures: 5 % Number of unit to unit unification failures: 12 % N literal unification failure due to lookup root_id table: 15251765 % N base clause resolution failure due to lookup table: 1525148 % N UC-BCL resolution dropped due to lookup table: 0 % Max entries in substitution set: 60 % N unit clauses dropped because they exceeded max values: 6863546 % 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: 5 % Max term depth in a unit clause: 2 % Number of states in UCFA table: 34 % 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.87 % Number of symbols (columns) in UCFA: 41 % Profile 2: Number of calls to: % ============================== % PTUnify() = 19827538 % ConstructUnitClause() = 6863554 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 8.05 secs % -------------------------------------------------------- % | | % Inferences per sec: 639598 % | | % -------------------------------------------------------- % Elapsed time: 32 secs % CPU time: 31.00 secs % %------------------------------------------------------------------------------