%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : SYN558-1 : TPTP v5.0.0. Released v2.5.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art06.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 10:20:41 EST 2010 % Result : Unsatisfiable 31.07s % Output : Refutation 31.07s % 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/SystemOnTPTP4540/SYN/SYN558-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 = 21] [nf = 0] [nu = 9] [ut = 11] % Looking for a proof at depth = 2 ... % t = 0 secs [nr = 208] [nf = 14] [nu = 96] [ut = 41] % Looking for a proof at depth = 3 ... % t = 0 secs [nr = 977] [nf = 98] [nu = 524] [ut = 57] % Looking for a proof at depth = 4 ... % t = 0 secs [nr = 9793] [nf = 526] [nu = 5509] [ut = 63] % Looking for a proof at depth = 5 ... % t = 0 secs [nr = 96086] [nf = 7544] [nu = 56518] [ut = 69] % Looking for a proof at depth = 6 ... % t = 2 secs [nr = 832558] [nf = 42168] [nu = 478969] [ut = 69] % Looking for a proof at depth = 7 ... % t = 15 secs [nr = 5986831] [nf = 387070] [nu = 3327464] [ut = 69] % Looking for a proof at depth = 8 ... % Entering time slice 2 % Updating parameters ... done. % Looking for a proof at depth = 1 ... % t = 31 secs [nr = 11410857] [nf = 691892] [nu = 6394168] [ut = 69] % Looking for a proof at depth = 2 ... % t = 31 secs [nr = 11411158] [nf = 691906] [nu = 6394341] [ut = 71] % Looking for a proof at depth = 3 ... % t = 31 secs [nr = 11412605] [nf = 692044] [nu = 6395260] [ut = 71] % Looking for a proof at depth = 4 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: p4_2(x0,x0) % B1: p6_2(c7_0(),f3_1(x0)) % B2: p5_3(c7_0(),x0,f3_1(x0)) % B8: ~p5_3(x0,x3,x2) | ~p5_3(x0,x1,x3) | p5_3(x0,x1,x2) % B12: ~p6_2(c7_0(),x0) | ~p6_2(c7_0(),x1) | ~p5_3(c7_0(),x2,x0) | ~p5_3(c7_0(),x2,x1) | p2_2(x0,x1) % B13: ~p2_2(x4,x2) | ~p2_2(x3,x1) | ~p4_2(x5,x0) | ~p5_3(x5,x3,x4) | p5_3(x0,x1,x2) % Unit Clauses: % -------------- % U1: < d0 v1 dv1 f1 c1 t3 td2 b nc > p6_2(c7_0(),f3_1(x0)) % U2: < d0 v2 dv1 f1 c1 t4 td2 b nc > p5_3(c7_0(),x0,f3_1(x0)) % U3: < d0 v0 dv0 f0 c3 t3 td1 b nc > p5_3(c7_0(),c10_0(),c9_0()) % U4: < d0 v0 dv0 f0 c3 t3 td1 b nc > p5_3(c7_0(),c10_0(),c8_0()) % U5: < d0 v2 dv1 f0 c0 t2 td1 b nc > p2_2(x0,x0) % U11: < d2 v2 dv1 f2 c1 t5 td3 > p5_3(c7_0(),x0,f3_1(f3_1(x0))) % U12: < d2 v0 dv0 f1 c3 t4 td2 > p5_3(c7_0(),c10_0(),f3_1(c9_0())) % U13: < d2 v0 dv0 f1 c3 t4 td2 > p5_3(c7_0(),c10_0(),f3_1(c8_0())) % U49: < d3 v0 dv0 f3 c3 t6 td3 > ~p5_3(c7_0(),f3_1(c8_0()),f3_1(f3_1(c9_0()))) % U94: < d4 v0 dv0 f2 c2 t4 td2 > ~p2_2(f3_1(c9_0()),f3_1(c8_0())) % U161: < d4 v0 dv0 f2 c2 t4 td2 > p2_2(f3_1(c9_0()),f3_1(c8_0())) % --------------- Start of Proof --------------- % Derivation of unit clause U1: % p6_2(c7_0(),f3_1(x0)) ....... U1 % Derivation of unit clause U2: % p5_3(c7_0(),x0,f3_1(x0)) ....... U2 % Derivation of unit clause U3: % p5_3(c7_0(),c10_0(),c9_0()) ....... U3 % Derivation of unit clause U4: % p5_3(c7_0(),c10_0(),c8_0()) ....... U4 % Derivation of unit clause U5: % p2_2(x0,x0) ....... U5 % Derivation of unit clause U11: % p5_3(c7_0(),x0,f3_1(x0)) ....... B2 % ~p5_3(x0,x3,x2) | ~p5_3(x0,x1,x3) | p5_3(x0,x1,x2) ....... B8 % ~p5_3(c7_0(), x0, x1) | p5_3(c7_0(), x0, f3_1(x1)) ....... R1 [B2:L0, B8:L0] % p5_3(c7_0(),x0,f3_1(x0)) ....... U2 % p5_3(c7_0(), x0, f3_1(f3_1(x0))) ....... R2 [R1:L0, U2:L0] % Derivation of unit clause U12: % p5_3(c7_0(),x0,f3_1(x0)) ....... B2 % ~p5_3(x0,x3,x2) | ~p5_3(x0,x1,x3) | p5_3(x0,x1,x2) ....... B8 % ~p5_3(c7_0(), x0, x1) | p5_3(c7_0(), x0, f3_1(x1)) ....... R1 [B2:L0, B8:L0] % p5_3(c7_0(),c10_0(),c9_0()) ....... U3 % p5_3(c7_0(), c10_0(), f3_1(c9_0())) ....... R2 [R1:L0, U3:L0] % Derivation of unit clause U13: % p5_3(c7_0(),x0,f3_1(x0)) ....... B2 % ~p5_3(x0,x3,x2) | ~p5_3(x0,x1,x3) | p5_3(x0,x1,x2) ....... B8 % ~p5_3(c7_0(), x0, x1) | p5_3(c7_0(), x0, f3_1(x1)) ....... R1 [B2:L0, B8:L0] % p5_3(c7_0(),c10_0(),c8_0()) ....... U4 % p5_3(c7_0(), c10_0(), f3_1(c8_0())) ....... R2 [R1:L0, U4:L0] % Derivation of unit clause U49: % p5_3(c7_0(),x0,f3_1(x0)) ....... B2 % ~p5_3(x0,x3,x2) | ~p5_3(x0,x1,x3) | p5_3(x0,x1,x2) ....... B8 % ~p5_3(c7_0(), f3_1(x0), x1) | p5_3(c7_0(), x0, x1) ....... R1 [B2:L0, B8:L1] % ~p5_3(c7_0(),c9_0(),x0) | ~p5_3(c7_0(),c8_0(),x0) ....... B7 % ~p5_3(c7_0(), f3_1(c8_0()), x0) | ~p5_3(c7_0(), c9_0(), x0) ....... R2 [R1:L1, B7:L1] % p5_3(c7_0(),x0,f3_1(f3_1(x0))) ....... U11 % ~p5_3(c7_0(), f3_1(c8_0()), f3_1(f3_1(c9_0()))) ....... R3 [R2:L1, U11:L0] % Derivation of unit clause U94: % p4_2(x0,x0) ....... B0 % ~p2_2(x4,x2) | ~p2_2(x3,x1) | ~p4_2(x5,x0) | ~p5_3(x5,x3,x4) | p5_3(x0,x1,x2) ....... B13 % ~p2_2(x0, x1) | ~p2_2(x2, x3) | ~p5_3(x4, x2, x0) | p5_3(x4, x3, x1) ....... R1 [B0:L0, B13:L2] % p2_2(x0,x0) ....... U5 % ~p2_2(x0, x1) | ~p5_3(x2, x0, x3) | p5_3(x2, x1, x3) ....... R2 [R1:L0, U5:L0] % p5_3(c7_0(),x0,f3_1(x0)) ....... U2 % ~p2_2(x0, x1) | p5_3(c7_0(), x1, f3_1(x0)) ....... R3 [R2:L1, U2:L0] % ~p5_3(c7_0(),f3_1(c8_0()),f3_1(f3_1(c9_0()))) ....... U49 % ~p2_2(f3_1(c9_0()), f3_1(c8_0())) ....... R4 [R3:L1, U49:L0] % Derivation of unit clause U161: % p6_2(c7_0(),f3_1(x0)) ....... B1 % ~p6_2(c7_0(),x0) | ~p6_2(c7_0(),x1) | ~p5_3(c7_0(),x2,x0) | ~p5_3(c7_0(),x2,x1) | p2_2(x0,x1) ....... B12 % ~p6_2(c7_0(), x0) | ~p5_3(c7_0(), x1, f3_1(x2)) | ~p5_3(c7_0(), x1, x0) | p2_2(f3_1(x2), x0) ....... R1 [B1:L0, B12:L0] % p6_2(c7_0(),f3_1(x0)) ....... U1 % ~p5_3(c7_0(), x0, f3_1(x1)) | ~p5_3(c7_0(), x0, f3_1(x2)) | p2_2(f3_1(x1), f3_1(x2)) ....... R2 [R1:L0, U1:L0] % p5_3(c7_0(),c10_0(),f3_1(c9_0())) ....... U12 % ~p5_3(c7_0(), c10_0(), f3_1(x0)) | p2_2(f3_1(c9_0()), f3_1(x0)) ....... R3 [R2:L0, U12:L0] % p5_3(c7_0(),c10_0(),f3_1(c8_0())) ....... U13 % p2_2(f3_1(c9_0()), f3_1(c8_0())) ....... R4 [R3:L0, U13:L0] % Derivation of the empty clause: % p2_2(f3_1(c9_0()),f3_1(c8_0())) ....... U161 % ~p2_2(f3_1(c9_0()),f3_1(c8_0())) ....... U94 % [] ....... R1 [U161:L0, U94:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 12125959 % resolvents: 11433824 factors: 692135 % Number of unit clauses generated: 6409700 % % unit clauses generated to total clauses generated: 52.86 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 6 [1] = 5 [2] = 32 [3] = 16 % [4] = 97 [5] = 6 % Total = 162 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 6409700 [2] = 4825892 [3] = 889857 [4] = 508 [5] = 2 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] p2_2 (+)40 (-)46 % [1] p4_2 (+)1 (-)0 % [2] p6_2 (+)9 (-)0 % [3] p5_3 (+)26 (-)40 % ------------------ % Total: (+)76 (-)86 % Total number of unit clauses retained: 162 % Number of clauses skipped because of their length: 6215781 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 12125976 % Number of unification failures: 30654945 % Number of unit to unit unification failures: 2848 % N literal unification failure due to lookup root_id table: 7040399 % N base clause resolution failure due to lookup table: 5037355 % N UC-BCL resolution dropped due to lookup table: 0 % Max entries in substitution set: 20 % N unit clauses dropped because they exceeded max values: 5568209 % N unit clauses dropped because too much nesting: 3308709 % 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: 9 % Max term depth in a unit clause: 4 % Number of states in UCFA table: 180 % Total number of terms of all unit clauses in table: 847 % 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.21 % Number of symbols (columns) in UCFA: 43 % Profile 2: Number of calls to: % ============================== % PTUnify() = 42780921 % ConstructUnitClause() = 5568365 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 6.16 secs % -------------------------------------------------------- % | | % Inferences per sec: 391160 % | | % -------------------------------------------------------- % Elapsed time: 31 secs % CPU time: 31.07 secs % %------------------------------------------------------------------------------