%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : ANA039-2 : TPTP v5.0.0. Released v3.2.0. % Transfm : add_equality % Format : carine % Command : carine %s t=%d xo=off uct=32000 % Computer : art04.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 17:31:22 EST 2010 % Result : Unsatisfiable 0.46s % Output : Refutation 0.46s % 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/SystemOnTPTP9976/ANA/ANA039-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 = 1 secs [nr = 10] [nf = 0] [nu = 8] [ut = 8] % Looking for a proof at depth = 2 ... % t = 1 secs [nr = 26] [nf = 0] [nu = 18] [ut = 8] % Looking for a proof at depth = 3 ... % t = 1 secs [nr = 182] [nf = 4] [nu = 60] [ut = 20] % Looking for a proof at depth = 4 ... % t = 1 secs [nr = 536] [nf = 8] [nu = 180] [ut = 20] % Looking for a proof at depth = 5 ... % t = 1 secs [nr = 1120] [nf = 42] [nu = 400] [ut = 20] % Looking for a proof at depth = 6 ... % t = 1 secs [nr = 1894] [nf = 76] [nu = 750] [ut = 20] % Looking for a proof at depth = 7 ... % t = 1 secs [nr = 2668] [nf = 110] [nu = 1100] [ut = 20] % Looking for a proof at depth = 8 ... % t = 1 secs [nr = 3442] [nf = 144] [nu = 1450] [ut = 20] % Looking for a proof at depth = 9 ... % t = 1 secs [nr = 4216] [nf = 178] [nu = 1800] [ut = 20] % Looking for a proof at depth = 10 ... % t = 1 secs [nr = 4990] [nf = 212] [nu = 2150] [ut = 20] % Looking for a proof at depth = 11 ... % t = 1 secs [nr = 5764] [nf = 246] [nu = 2500] [ut = 20] % Looking for a proof at depth = 12 ... % t = 1 secs [nr = 6538] [nf = 280] [nu = 2850] [ut = 20] % Looking for a proof at depth = 13 ... % t = 1 secs [nr = 7312] [nf = 314] [nu = 3200] [ut = 20] % Looking for a proof at depth = 14 ... % t = 1 secs [nr = 8086] [nf = 348] [nu = 3550] [ut = 20] % Looking for a proof at depth = 15 ... % t = 1 secs [nr = 8860] [nf = 382] [nu = 3900] [ut = 20] % Looking for a proof at depth = 16 ... % t = 1 secs [nr = 9634] [nf = 416] [nu = 4250] [ut = 20] % Looking for a proof at depth = 17 ... % t = 1 secs [nr = 10408] [nf = 450] [nu = 4600] [ut = 20] % Looking for a proof at depth = 18 ... % t = 1 secs [nr = 11182] [nf = 484] [nu = 4950] [ut = 20] % Looking for a proof at depth = 19 ... % t = 1 secs [nr = 11956] [nf = 518] [nu = 5300] [ut = 20] % Looking for a proof at depth = 20 ... % t = 1 secs [nr = 12730] [nf = 552] [nu = 5650] [ut = 20] % Looking for a proof at depth = 21 ... % t = 1 secs [nr = 13504] [nf = 586] [nu = 6000] [ut = 20] % Looking for a proof at depth = 22 ... % t = 1 secs [nr = 14278] [nf = 620] [nu = 6350] [ut = 20] % Looking for a proof at depth = 23 ... % t = 1 secs [nr = 15052] [nf = 654] [nu = 6700] [ut = 20] % Looking for a proof at depth = 24 ... % t = 1 secs [nr = 15826] [nf = 688] [nu = 7050] [ut = 20] % Looking for a proof at depth = 25 ... % t = 1 secs [nr = 16600] [nf = 722] [nu = 7400] [ut = 20] % Looking for a proof at depth = 26 ... % t = 1 secs [nr = 17374] [nf = 756] [nu = 7750] [ut = 20] % Looking for a proof at depth = 27 ... % t = 1 secs [nr = 18148] [nf = 790] [nu = 8100] [ut = 20] % Looking for a proof at depth = 28 ... % t = 1 secs [nr = 18922] [nf = 824] [nu = 8450] [ut = 20] % Looking for a proof at depth = 29 ... % t = 1 secs [nr = 19696] [nf = 858] [nu = 8800] [ut = 20] % Looking for a proof at depth = 30 ... % t = 1 secs [nr = 20470] [nf = 892] [nu = 9150] [ut = 20] % Restarting search with different parameters. % Looking for a proof at depth = 1 ... % t = 1 secs [nr = 20480] [nf = 892] [nu = 9158] [ut = 20] % Looking for a proof at depth = 2 ... % t = 1 secs [nr = 20496] [nf = 892] [nu = 9168] [ut = 20] % Looking for a proof at depth = 3 ... % t = 1 secs [nr = 20668] [nf = 900] [nu = 9210] [ut = 20] % Looking for a proof at depth = 4 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: c_lessequals_3(c_HOL_Oabs_2(v_h_1(x0),t_a_0()),c_times_3(v_c_0(),c_HOL_Oabs_2(v_f_1(x0),t_a_0()),t_a_0()),t_a_0()) % B2: class_Ring__and__Field_Oordered__idom_1(t_a_0()) % B3: ~class_OrderedGroup_Olordered__ab__group__abs_1(x0) | c_lessequals_3(x1,c_HOL_Oabs_2(x1,x0),x0) % B4: ~class_OrderedGroup_Olordered__ab__group__abs_1(x0) | c_lessequals_3(c_0_0(),c_HOL_Oabs_2(x1,x0),x0) % B5: ~class_Ring__and__Field_Oordered__idom_1(x0) | class_OrderedGroup_Olordered__ab__group__abs_1(x0) % B6: ~class_Ring__and__Field_Oordered__idom_1(x0) | class_Orderings_Oorder_1(x0) % B7: ~class_Ring__and__Field_Oordered__idom_1(x0) | class_Ring__and__Field_Opordered__semiring_1(x0) % B8: ~class_Orderings_Oorder_1(x0) | ~c_lessequals_3(x3,x1,x0) | ~c_lessequals_3(x1,x2,x0) | c_lessequals_3(x3,x2,x0) % B9: ~class_Ring__and__Field_Opordered__semiring_1(x0) | ~c_lessequals_3(c_0_0(),x3,x0) | ~c_lessequals_3(x1,x2,x0) | c_lessequals_3(c_times_3(x1,x3,x0),c_times_3(x2,x3,x0),x0) % Unit Clauses: % -------------- % U1: < d0 v0 dv0 f6 c8 t14 td4 b nc > ~c_lessequals_3(c_HOL_Oabs_2(v_h_1(v_x_0()),t_a_0()),c_times_3(c_HOL_Oabs_2(v_c_0(),t_a_0()),c_HOL_Oabs_2(v_f_1(v_x_0()),t_a_0()),t_a_0()),t_a_0()) % U3: < d1 v0 dv0 f0 c1 t1 td1 > class_OrderedGroup_Olordered__ab__group__abs_1(t_a_0()) % U4: < d1 v0 dv0 f0 c1 t1 td1 > class_Orderings_Oorder_1(t_a_0()) % U5: < d1 v0 dv0 f0 c1 t1 td1 > class_Ring__and__Field_Opordered__semiring_1(t_a_0()) % U7: < d1 v1 dv1 f1 c3 t5 td2 > c_lessequals_3(c_0_0(),c_HOL_Oabs_2(x0,t_a_0()),t_a_0()) % U9: < d3 v0 dv0 f7 c10 t17 td4 > ~c_lessequals_3(c_times_3(v_c_0(),c_HOL_Oabs_2(v_f_1(v_x_0()),t_a_0()),t_a_0()),c_times_3(c_HOL_Oabs_2(v_c_0(),t_a_0()),c_HOL_Oabs_2(v_f_1(v_x_0()),t_a_0()),t_a_0()),t_a_0()) % U285: < d4 v4 dv2 f5 c6 t15 td3 > c_lessequals_3(c_times_3(x0,c_HOL_Oabs_2(x1,t_a_0()),t_a_0()),c_times_3(c_HOL_Oabs_2(x0,t_a_0()),c_HOL_Oabs_2(x1,t_a_0()),t_a_0()),t_a_0()) % --------------- Start of Proof --------------- % Derivation of unit clause U1: % ~c_lessequals_3(c_HOL_Oabs_2(v_h_1(v_x_0()),t_a_0()),c_times_3(c_HOL_Oabs_2(v_c_0(),t_a_0()),c_HOL_Oabs_2(v_f_1(v_x_0()),t_a_0()),t_a_0()),t_a_0()) ....... U1 % Derivation of unit clause U3: % class_Ring__and__Field_Oordered__idom_1(t_a_0()) ....... B2 % ~class_Ring__and__Field_Oordered__idom_1(x0) | class_OrderedGroup_Olordered__ab__group__abs_1(x0) ....... B5 % class_OrderedGroup_Olordered__ab__group__abs_1(t_a_0()) ....... R1 [B2:L0, B5:L0] % Derivation of unit clause U4: % class_Ring__and__Field_Oordered__idom_1(t_a_0()) ....... B2 % ~class_Ring__and__Field_Oordered__idom_1(x0) | class_Orderings_Oorder_1(x0) ....... B6 % class_Orderings_Oorder_1(t_a_0()) ....... R1 [B2:L0, B6:L0] % Derivation of unit clause U5: % class_Ring__and__Field_Oordered__idom_1(t_a_0()) ....... B2 % ~class_Ring__and__Field_Oordered__idom_1(x0) | class_Ring__and__Field_Opordered__semiring_1(x0) ....... B7 % class_Ring__and__Field_Opordered__semiring_1(t_a_0()) ....... R1 [B2:L0, B7:L0] % Derivation of unit clause U7: % ~class_OrderedGroup_Olordered__ab__group__abs_1(x0) | c_lessequals_3(c_0_0(),c_HOL_Oabs_2(x1,x0),x0) ....... B4 % class_OrderedGroup_Olordered__ab__group__abs_1(t_a_0()) ....... U3 % c_lessequals_3(c_0_0(), c_HOL_Oabs_2(x0, t_a_0()), t_a_0()) ....... R1 [B4:L0, U3:L0] % Derivation of unit clause U9: % c_lessequals_3(c_HOL_Oabs_2(v_h_1(x0),t_a_0()),c_times_3(v_c_0(),c_HOL_Oabs_2(v_f_1(x0),t_a_0()),t_a_0()),t_a_0()) ....... B0 % ~class_Orderings_Oorder_1(x0) | ~c_lessequals_3(x3,x1,x0) | ~c_lessequals_3(x1,x2,x0) | c_lessequals_3(x3,x2,x0) ....... B8 % ~class_Orderings_Oorder_1(t_a_0()) | ~c_lessequals_3(c_times_3(v_c_0(), c_HOL_Oabs_2(v_f_1(x0), t_a_0()), t_a_0()), x1, t_a_0()) | c_lessequals_3(c_HOL_Oabs_2(v_h_1(x0), t_a_0()), x1, t_a_0()) ....... R1 [B0:L0, B8:L1] % class_Orderings_Oorder_1(t_a_0()) ....... U4 % ~c_lessequals_3(c_times_3(v_c_0(), c_HOL_Oabs_2(v_f_1(x0), t_a_0()), t_a_0()), x1, t_a_0()) | c_lessequals_3(c_HOL_Oabs_2(v_h_1(x0), t_a_0()), x1, t_a_0()) ....... R2 [R1:L0, U4:L0] % ~c_lessequals_3(c_HOL_Oabs_2(v_h_1(v_x_0()),t_a_0()),c_times_3(c_HOL_Oabs_2(v_c_0(),t_a_0()),c_HOL_Oabs_2(v_f_1(v_x_0()),t_a_0()),t_a_0()),t_a_0()) ....... U1 % ~c_lessequals_3(c_times_3(v_c_0(), c_HOL_Oabs_2(v_f_1(v_x_0()), t_a_0()), t_a_0()), c_times_3(c_HOL_Oabs_2(v_c_0(), t_a_0()), c_HOL_Oabs_2(v_f_1(v_x_0()), t_a_0()), t_a_0()), t_a_0()) ....... R3 [R2:L1, U1:L0] % Derivation of unit clause U285: % ~class_OrderedGroup_Olordered__ab__group__abs_1(x0) | c_lessequals_3(x1,c_HOL_Oabs_2(x1,x0),x0) ....... B3 % ~class_Ring__and__Field_Opordered__semiring_1(x0) | ~c_lessequals_3(c_0_0(),x3,x0) | ~c_lessequals_3(x1,x2,x0) | c_lessequals_3(c_times_3(x1,x3,x0),c_times_3(x2,x3,x0),x0) ....... B9 % ~class_OrderedGroup_Olordered__ab__group__abs_1(x0) | ~class_Ring__and__Field_Opordered__semiring_1(x0) | ~c_lessequals_3(c_0_0(), x1, x0) | c_lessequals_3(c_times_3(x2, x1, x0), c_times_3(c_HOL_Oabs_2(x2, x0), x1, x0), x0) ....... R1 [B3:L1, B9:L2] % class_OrderedGroup_Olordered__ab__group__abs_1(t_a_0()) ....... U3 % ~class_Ring__and__Field_Opordered__semiring_1(t_a_0()) | ~c_lessequals_3(c_0_0(), x0, t_a_0()) | c_lessequals_3(c_times_3(x1, x0, t_a_0()), c_times_3(c_HOL_Oabs_2(x1, t_a_0()), x0, t_a_0()), t_a_0()) ....... R2 [R1:L0, U3:L0] % class_Ring__and__Field_Opordered__semiring_1(t_a_0()) ....... U5 % ~c_lessequals_3(c_0_0(), x0, t_a_0()) | c_lessequals_3(c_times_3(x1, x0, t_a_0()), c_times_3(c_HOL_Oabs_2(x1, t_a_0()), x0, t_a_0()), t_a_0()) ....... R3 [R2:L0, U5:L0] % c_lessequals_3(c_0_0(),c_HOL_Oabs_2(x0,t_a_0()),t_a_0()) ....... U7 % c_lessequals_3(c_times_3(x0, c_HOL_Oabs_2(x1, t_a_0()), t_a_0()), c_times_3(c_HOL_Oabs_2(x0, t_a_0()), c_HOL_Oabs_2(x1, t_a_0()), t_a_0()), t_a_0()) ....... R4 [R3:L0, U7:L0] % Derivation of the empty clause: % c_lessequals_3(c_times_3(x0,c_HOL_Oabs_2(x1,t_a_0()),t_a_0()),c_times_3(c_HOL_Oabs_2(x0,t_a_0()),c_HOL_Oabs_2(x1,t_a_0()),t_a_0()),t_a_0()) ....... U285 % ~c_lessequals_3(c_times_3(v_c_0(),c_HOL_Oabs_2(v_f_1(v_x_0()),t_a_0()),t_a_0()),c_times_3(c_HOL_Oabs_2(v_c_0(),t_a_0()),c_HOL_Oabs_2(v_f_1(v_x_0()),t_a_0()),t_a_0()),t_a_0()) ....... U9 % [] ....... R1 [U285:L0, U9:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 28125 % resolvents: 27215 factors: 910 % Number of unit clauses generated: 11511 % % unit clauses generated to total clauses generated: 40.93 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 3 [1] = 5 [3] = 12 % [4] = 266 % Total = 286 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 11511 [2] = 11735 [3] = 4857 [4] = 22 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] class_OrderedGroup_Olordered__ab__group__abs_1 (+)1 (-)0 % [1] class_Orderings_Oorder_1 (+)1 (-)0 % [2] class_Ring__and__Field_Oordered__idom_1 (+)1 (-)0 % [3] class_Ring__and__Field_Opordered__semiring_1 (+)1 (-)0 % [4] c_lessequals_3 (+)267 (-)15 % ------------------ % Total: (+)271 (-)15 % Total number of unit clauses retained: 286 % Number of clauses skipped because of their length: 1746 % N base clauses skippped in resolve-with-all-base-clauses % because of the shortest resolvents table: 6 % Number of successful unifications: 28136 % Number of unification failures: 85886 % Number of unit to unit unification failures: 3991 % N literal unification failure due to lookup root_id table: 120032 % N base clause resolution failure due to lookup table: 72999 % N UC-BCL resolution dropped due to lookup table: 0 % Max entries in substitution set: 9 % N unit clauses dropped because they exceeded max values: 2385 % N unit clauses dropped because too much nesting: 366 % 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: 62 % Max term depth in a unit clause: 10 % Number of states in UCFA table: 5272 % Total number of terms of all unit clauses in table: 9263 % Max allowed number of states in UCFA: 528000 % Ratio n states used/total allowed states: 0.01 % Ratio n states used/total unit clauses terms: 0.57 % Number of symbols (columns) in UCFA: 47 % Profile 2: Number of calls to: % ============================== % PTUnify() = 114022 % ConstructUnitClause() = 2668 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.00 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 1 secs % CPU time: 0.45 secs % %------------------------------------------------------------------------------