%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : KRS001-1 : TPTP v5.0.0. Released v2.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 22:42:15 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/SystemOnTPTP24470/KRS/KRS001-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 = 0 secs [nr = 23] [nf = 0] [nu = 11] [ut = 8] % Looking for a proof at depth = 2 ... % t = 0 secs [nr = 93] [nf = 0] [nu = 31] [ut = 8] % Looking for a proof at depth = 3 ... % t = 0 secs [nr = 439] [nf = 6] [nu = 95] [ut = 10] % Looking for a proof at depth = 4 ... % t = 0 secs [nr = 1959] [nf = 22] [nu = 323] [ut = 10] % Looking for a proof at depth = 5 ... % t = 0 secs [nr = 8374] [nf = 82] [nu = 1315] [ut = 10] % Looking for a proof at depth = 6 ... % t = 0 secs [nr = 36398] [nf = 410] [nu = 5637] [ut = 10] % Looking for a proof at depth = 7 ... % t = 0 secs [nr = 159013] [nf = 1932] [nu = 25141] [ut = 10] % Looking for a proof at depth = 8 ... % t = 1 secs [nr = 697410] [nf = 9473] [nu = 110071] [ut = 10] % Looking for a proof at depth = 9 ... % t = 6 secs [nr = 3110415] [nf = 44564] [nu = 498139] [ut = 10] % Looking for a proof at depth = 10 ... % t = 25 secs [nr = 13819051] [nf = 213363] [nu = 2207473] [ut = 10] % Looking for a proof at depth = 11 ... % Entering time slice 2 % Updating parameters ... done. % Looking for a proof at depth = 1 ... % t = 31 secs [nr = 17376052] [nf = 261343] [nu = 2800257] [ut = 10] % Looking for a proof at depth = 2 ... % t = 31 secs [nr = 17376122] [nf = 261343] [nu = 2800277] [ut = 10] % Looking for a proof at depth = 3 ... % t = 31 secs [nr = 17376482] [nf = 261365] [nu = 2800341] [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: e_1(exist_0()) % B1: ~c_1(x0) | r2least_1(x0) % B2: ~d_1(x0) | r1most_1(x0) % B3: ~e_1(x0) | c_1(x0) % B4: ~e_1(x0) | d_1(x0) % B9: ~r2least_1(x0) | r_2(x0,u1r2_1(x0)) % B10: ~r2least_1(x0) | r_2(x0,u1r1_1(x0)) % B11: ~r2least_1(x0) | ~equalish_2(u1r2_1(x0),u1r1_1(x0)) % B14: ~r1most_1(x2) | ~r_2(x2,x1) | ~r_2(x2,x0) | equalish_2(x0,x1) % Unit Clauses: % -------------- % U1: < d1 v0 dv0 f0 c1 t1 td1 > c_1(exist_0()) % U2: < d1 v0 dv0 f0 c1 t1 td1 > d_1(exist_0()) % U3: < d1 v0 dv0 f0 c1 t1 td1 > r2least_1(exist_0()) % U5: < d1 v0 dv0 f1 c2 t3 td2 > r_2(exist_0(),u1r2_1(exist_0())) % U6: < d1 v0 dv0 f1 c2 t3 td2 > r_2(exist_0(),u1r1_1(exist_0())) % U7: < d1 v0 dv0 f2 c2 t4 td2 > ~equalish_2(u1r2_1(exist_0()),u1r1_1(exist_0())) % U11: < d4 v0 dv0 f2 c2 t4 td2 > equalish_2(u1r2_1(exist_0()),u1r1_1(exist_0())) % --------------- Start of Proof --------------- % Derivation of unit clause U1: % e_1(exist_0()) ....... B0 % ~e_1(x0) | c_1(x0) ....... B3 % c_1(exist_0()) ....... R1 [B0:L0, B3:L0] % Derivation of unit clause U2: % e_1(exist_0()) ....... B0 % ~e_1(x0) | d_1(x0) ....... B4 % d_1(exist_0()) ....... R1 [B0:L0, B4:L0] % Derivation of unit clause U3: % ~c_1(x0) | r2least_1(x0) ....... B1 % c_1(exist_0()) ....... U1 % r2least_1(exist_0()) ....... R1 [B1:L0, U1:L0] % Derivation of unit clause U5: % ~r2least_1(x0) | r_2(x0,u1r2_1(x0)) ....... B9 % r2least_1(exist_0()) ....... U3 % r_2(exist_0(), u1r2_1(exist_0())) ....... R1 [B9:L0, U3:L0] % Derivation of unit clause U6: % ~r2least_1(x0) | r_2(x0,u1r1_1(x0)) ....... B10 % r2least_1(exist_0()) ....... U3 % r_2(exist_0(), u1r1_1(exist_0())) ....... R1 [B10:L0, U3:L0] % Derivation of unit clause U7: % ~r2least_1(x0) | ~equalish_2(u1r2_1(x0),u1r1_1(x0)) ....... B11 % r2least_1(exist_0()) ....... U3 % ~equalish_2(u1r2_1(exist_0()), u1r1_1(exist_0())) ....... R1 [B11:L0, U3:L0] % Derivation of unit clause U11: % ~d_1(x0) | r1most_1(x0) ....... B2 % ~r1most_1(x2) | ~r_2(x2,x1) | ~r_2(x2,x0) | equalish_2(x0,x1) ....... B14 % ~d_1(x0) | ~r_2(x0, x1) | ~r_2(x0, x2) | equalish_2(x2, x1) ....... R1 [B2:L1, B14:L0] % d_1(exist_0()) ....... U2 % ~r_2(exist_0(), x0) | ~r_2(exist_0(), x1) | equalish_2(x1, x0) ....... R2 [R1:L0, U2:L0] % r_2(exist_0(),u1r1_1(exist_0())) ....... U6 % ~r_2(exist_0(), x0) | equalish_2(x0, u1r1_1(exist_0())) ....... R3 [R2:L0, U6:L0] % r_2(exist_0(),u1r2_1(exist_0())) ....... U5 % equalish_2(u1r2_1(exist_0()), u1r1_1(exist_0())) ....... R4 [R3:L0, U5:L0] % Derivation of the empty clause: % equalish_2(u1r2_1(exist_0()),u1r1_1(exist_0())) ....... U11 % ~equalish_2(u1r2_1(exist_0()),u1r1_1(exist_0())) ....... U7 % [] ....... R1 [U11:L0, U7:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 17638254 % resolvents: 17376887 factors: 261367 % Number of unit clauses generated: 2800433 % % unit clauses generated to total clauses generated: 15.88 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 1 [1] = 7 [3] = 2 % [4] = 2 % Total = 12 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 2800433 [2] = 10712684 [3] = 4125101 [4] = 34 [5] = 2 % Average size of a generated clause: 3.0 % Number of unit clauses per predicate list: % ========================================== % [0] c_1 (+)1 (-)0 % [1] d_1 (+)1 (-)0 % [2] e_1 (+)1 (-)0 % [3] r1most_1 (+)1 (-)0 % [4] r2least_1 (+)1 (-)0 % [5] equalish_2 (+)4 (-)1 % [6] r_2 (+)2 (-)0 % ------------------ % Total: (+)11 (-)1 % Total number of unit clauses retained: 12 % Number of clauses skipped because of their length: 5982564 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 111 % Number of successful unifications: 17638264 % Number of unification failures: 1704243 % Number of unit to unit unification failures: 3 % N literal unification failure due to lookup root_id table: 35013504 % N base clause resolution failure due to lookup table: 96145304 % 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: 2167170 % 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: 4 % Max term depth in a unit clause: 2 % Number of states in UCFA table: 25 % Total number of terms of all unit clauses in table: 31 % 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.81 % Number of symbols (columns) in UCFA: 46 % Profile 2: Number of calls to: % ============================== % PTUnify() = 19342507 % ConstructUnitClause() = 2167181 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 2.41 secs % -------------------------------------------------------- % | | % Inferences per sec: 568976 % | | % -------------------------------------------------------- % Elapsed time: 31 secs % CPU time: 31.00 secs % %------------------------------------------------------------------------------