%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : FLD060-3 : TPTP v5.0.0. Bugfixed v2.1.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art03.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 19:11:30 EST 2010 % Result : Unsatisfiable 32.55s % Output : Refutation 32.55s % 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/SystemOnTPTP24950/FLD/FLD060-3+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 = 146] [nf = 0] [nu = 88] [ut = 57] % Looking for a proof at depth = 2 ... % t = 1 secs [nr = 151356] [nf = 62] [nu = 115304] [ut = 3841] % Looking for a proof at depth = 3 ... % Entering time slice 2 % Updating parameters ... done. % Looking for a proof at depth = 1 ... % t = 32 secs [nr = 12941847] [nf = 456] [nu = 12854748] [ut = 7098] % Looking for a proof at depth = 2 ... % t = 33 secs [nr = 13630361] [nf = 518] [nu = 13412849] [ut = 19860] % Looking for a proof at depth = 3 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: less_or_equal_2(a_0(),b_0()) % B1: ~less_or_equal_2(add_2(a_0(),a_0()),add_2(b_0(),b_0())) % B4: defined_1(a_0()) % B5: defined_1(b_0()) % B13: ~less_or_equal_2(x2,x1) | ~less_or_equal_2(x0,x2) | less_or_equal_2(x0,x1) % B18: ~defined_1(x1) | ~defined_1(x0) | sum_3(x0,x1,add_2(x0,x1)) % B25: ~less_or_equal_2(x2,x3) | ~sum_3(x3,x4,x1) | ~sum_3(x2,x4,x0) | less_or_equal_2(x0,x1) % Unit Clauses: % -------------- % U4: < d0 v0 dv0 f0 c1 t1 td1 b > defined_1(a_0()) % U5: < d0 v0 dv0 f0 c1 t1 td1 b > defined_1(b_0()) % U1947: < d2 v0 dv0 f1 c4 t5 td2 > sum_3(a_0(),a_0(),add_2(a_0(),a_0())) % U1948: < d2 v0 dv0 f1 c4 t5 td2 > sum_3(b_0(),a_0(),add_2(b_0(),a_0())) % U3592: < d2 v0 dv0 f1 c4 t5 td2 > sum_3(b_0(),b_0(),add_2(b_0(),b_0())) % U3846: < d3 v0 dv0 f2 c4 t6 td2 > less_or_equal_2(add_2(a_0(),a_0()),add_2(b_0(),a_0())) % U4860: < d3 v0 dv0 f1 c4 t5 td2 > sum_3(a_0(),b_0(),add_2(b_0(),a_0())) % U7099: < d2 v0 dv0 f2 c4 t6 td2 > ~less_or_equal_2(add_2(b_0(),a_0()),add_2(b_0(),b_0())) % U19864: < d3 v0 dv0 f2 c4 t6 td2 > less_or_equal_2(add_2(b_0(),a_0()),add_2(b_0(),b_0())) % --------------- Start of Proof --------------- % Derivation of unit clause U4: % defined_1(a_0()) ....... U4 % Derivation of unit clause U5: % defined_1(b_0()) ....... U5 % Derivation of unit clause U1947: % defined_1(a_0()) ....... B4 % ~defined_1(x1) | ~defined_1(x0) | sum_3(x0,x1,add_2(x0,x1)) ....... B18 % ~defined_1(x0) | sum_3(x0, a_0(), add_2(x0, a_0())) ....... R1 [B4:L0, B18:L0] % defined_1(a_0()) ....... U4 % sum_3(a_0(), a_0(), add_2(a_0(), a_0())) ....... R2 [R1:L0, U4:L0] % Derivation of unit clause U1948: % defined_1(a_0()) ....... B4 % ~defined_1(x1) | ~defined_1(x0) | sum_3(x0,x1,add_2(x0,x1)) ....... B18 % ~defined_1(x0) | sum_3(x0, a_0(), add_2(x0, a_0())) ....... R1 [B4:L0, B18:L0] % defined_1(b_0()) ....... U5 % sum_3(b_0(), a_0(), add_2(b_0(), a_0())) ....... R2 [R1:L0, U5:L0] % Derivation of unit clause U3592: % defined_1(b_0()) ....... B5 % ~defined_1(x1) | ~defined_1(x0) | sum_3(x0,x1,add_2(x0,x1)) ....... B18 % ~defined_1(x0) | sum_3(x0, b_0(), add_2(x0, b_0())) ....... R1 [B5:L0, B18:L0] % defined_1(b_0()) ....... U5 % sum_3(b_0(), b_0(), add_2(b_0(), b_0())) ....... R2 [R1:L0, U5:L0] % Derivation of unit clause U3846: % less_or_equal_2(a_0(),b_0()) ....... B0 % ~less_or_equal_2(x2,x3) | ~sum_3(x3,x4,x1) | ~sum_3(x2,x4,x0) | less_or_equal_2(x0,x1) ....... B25 % ~sum_3(b_0(), x0, x1) | ~sum_3(a_0(), x0, x2) | less_or_equal_2(x2, x1) ....... R1 [B0:L0, B25:L0] % sum_3(b_0(),a_0(),add_2(b_0(),a_0())) ....... U1948 % ~sum_3(a_0(), a_0(), x0) | less_or_equal_2(x0, add_2(b_0(), a_0())) ....... R2 [R1:L0, U1948:L0] % sum_3(a_0(),a_0(),add_2(a_0(),a_0())) ....... U1947 % less_or_equal_2(add_2(a_0(), a_0()), add_2(b_0(), a_0())) ....... R3 [R2:L0, U1947:L0] % Derivation of unit clause U4860: % defined_1(a_0()) ....... B4 % ~defined_1(x1) | ~defined_1(x0) | sum_3(x0,x1,add_2(x0,x1)) ....... B18 % ~defined_1(x0) | sum_3(x0, a_0(), add_2(x0, a_0())) ....... R1 [B4:L0, B18:L0] % ~sum_3(x1,x0,x2) | sum_3(x0,x1,x2) ....... B8 % ~defined_1(x0) | sum_3(a_0(), x0, add_2(x0, a_0())) ....... R2 [R1:L1, B8:L0] % defined_1(b_0()) ....... U5 % sum_3(a_0(), b_0(), add_2(b_0(), a_0())) ....... R3 [R2:L0, U5:L0] % Derivation of unit clause U7099: % ~less_or_equal_2(add_2(a_0(),a_0()),add_2(b_0(),b_0())) ....... B1 % ~less_or_equal_2(x2,x1) | ~less_or_equal_2(x0,x2) | less_or_equal_2(x0,x1) ....... B13 % ~less_or_equal_2(x0, add_2(b_0(), b_0())) | ~less_or_equal_2(add_2(a_0(), a_0()), x0) ....... R1 [B1:L0, B13:L2] % less_or_equal_2(add_2(a_0(),a_0()),add_2(b_0(),a_0())) ....... U3846 % ~less_or_equal_2(add_2(b_0(), a_0()), add_2(b_0(), b_0())) ....... R2 [R1:L1, U3846:L0] % Derivation of unit clause U19864: % less_or_equal_2(a_0(),b_0()) ....... B0 % ~less_or_equal_2(x2,x3) | ~sum_3(x3,x4,x1) | ~sum_3(x2,x4,x0) | less_or_equal_2(x0,x1) ....... B25 % ~sum_3(b_0(), x0, x1) | ~sum_3(a_0(), x0, x2) | less_or_equal_2(x2, x1) ....... R1 [B0:L0, B25:L0] % sum_3(b_0(),b_0(),add_2(b_0(),b_0())) ....... U3592 % ~sum_3(a_0(), b_0(), x0) | less_or_equal_2(x0, add_2(b_0(), b_0())) ....... R2 [R1:L0, U3592:L0] % sum_3(a_0(),b_0(),add_2(b_0(),a_0())) ....... U4860 % less_or_equal_2(add_2(b_0(), a_0()), add_2(b_0(), b_0())) ....... R3 [R2:L0, U4860:L0] % Derivation of the empty clause: % less_or_equal_2(add_2(b_0(),a_0()),add_2(b_0(),b_0())) ....... U19864 % ~less_or_equal_2(add_2(b_0(),a_0()),add_2(b_0(),b_0())) ....... U7099 % [] ....... R1 [U19864:L0, U7099:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 13630934 % resolvents: 13630408 factors: 526 % Number of unit clauses generated: 13412864 % % unit clauses generated to total clauses generated: 98.40 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 7 [1] = 1836 [2] = 16546 [3] = 1476 % Total = 19865 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 13412864 [2] = 217527 [3] = 534 [4] = 9 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] defined_1 (+)13127 (-)0 % [1] less_or_equal_2 (+)23 (-)3 % [2] product_3 (+)2691 (-)0 % [3] sum_3 (+)3864 (-)157 % ------------------ % Total: (+)19705 (-)160 % Total number of unit clauses retained: 19865 % Number of clauses skipped because of their length: 300771 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 0 % Number of successful unifications: 13630951 % Number of unification failures: 366522 % Number of unit to unit unification failures: 606716 % N literal unification failure due to lookup root_id table: 159493 % N base clause resolution failure due to lookup table: 195405 % N UC-BCL resolution dropped due to lookup table: 223 % Max entries in substitution set: 9 % N unit clauses dropped because they exceeded max values: 13187526 % N unit clauses dropped because too much nesting: 710409 % 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: 12 % Max term depth in a unit clause: 4 % Number of states in UCFA table: 46978 % Total number of terms of all unit clauses in table: 164607 % Max allowed number of states in UCFA: 80000 % Ratio n states used/total allowed states: 0.59 % Ratio n states used/total unit clauses terms: 0.29 % Number of symbols (columns) in UCFA: 46 % Profile 2: Number of calls to: % ============================== % PTUnify() = 13997473 % ConstructUnitClause() = 13207384 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 14.34 secs % -------------------------------------------------------- % | | % Inferences per sec: 425967 % | | % -------------------------------------------------------- % Elapsed time: 33 secs % CPU time: 32.55 secs % %------------------------------------------------------------------------------