%------------------------------------------------------------------------------ % File : CARINE---0.734 % Problem : ANA038-2 : TPTP v5.0.0. Released v3.2.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 : Sat Nov 27 17:30:58 EST 2010 % Result : Unsatisfiable 0.19s % Output : Refutation 0.19s % 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/SystemOnTPTP9414/ANA/ANA038-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 = 0 secs [nr = 8] [nf = 0] [nu = 7] [ut = 8] % Looking for a proof at depth = 2 ... % t = 0 secs [nr = 25] [nf = 0] [nu = 15] [ut = 8] % Looking for a proof at depth = 3 ... % +================================================+ % | | % | Congratulations!!! ........ A proof was found. | % | | % +================================================+ % Base Clauses and Unit Clauses used in proof: % ============================================ % Base Clauses: % ------------- % B0: c_lessequals_3(c_0_0(),v_g_1(v_xa_0()),t_b_0()) % B1: c_lessequals_3(c_HOL_Oabs_2(v_b_1(v_xa_0()),t_b_0()),c_times_3(v_ca_0(),v_g_1(v_xa_0()),t_b_0()),t_b_0()) % B3: class_Ring__and__Field_Oordered__idom_1(t_b_0()) % B4: ~class_Orderings_Olinorder_1(x0) | c_lessequals_3(x1,c_Orderings_Omax_3(x2,x1,x0),x0) % B5: ~class_Ring__and__Field_Oordered__idom_1(x0) | class_Orderings_Olinorder_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: % -------------- % U2: < d0 v0 dv0 f5 c8 t13 td3 b nc > ~c_lessequals_3(c_HOL_Oabs_2(v_b_1(v_xa_0()),t_b_0()),c_times_3(c_Orderings_Omax_3(v_c_0(),v_ca_0(),t_b_0()),v_g_1(v_xa_0()),t_b_0()),t_b_0()) % U4: < d1 v0 dv0 f0 c1 t1 td1 > class_Orderings_Olinorder_1(t_b_0()) % U5: < d1 v0 dv0 f0 c1 t1 td1 > class_Orderings_Oorder_1(t_b_0()) % U6: < d1 v0 dv0 f0 c1 t1 td1 > class_Ring__and__Field_Opordered__semiring_1(t_b_0()) % U7: < d1 v3 dv2 f1 c2 t6 td2 > c_lessequals_3(x0,c_Orderings_Omax_3(x1,x0,t_b_0()),t_b_0()) % U10: < d3 v3 dv2 f5 c6 t14 td3 > c_lessequals_3(c_times_3(x0,v_g_1(v_xa_0()),t_b_0()),c_times_3(c_Orderings_Omax_3(x1,x0,t_b_0()),v_g_1(v_xa_0()),t_b_0()),t_b_0()) % U14: < d3 v1 dv1 f5 c7 t13 td3 > c_lessequals_3(c_HOL_Oabs_2(v_b_1(v_xa_0()),t_b_0()),c_times_3(c_Orderings_Omax_3(x0,v_ca_0(),t_b_0()),v_g_1(v_xa_0()),t_b_0()),t_b_0()) % --------------- Start of Proof --------------- % Derivation of unit clause U2: % ~c_lessequals_3(c_HOL_Oabs_2(v_b_1(v_xa_0()),t_b_0()),c_times_3(c_Orderings_Omax_3(v_c_0(),v_ca_0(),t_b_0()),v_g_1(v_xa_0()),t_b_0()),t_b_0()) ....... U2 % Derivation of unit clause U4: % class_Ring__and__Field_Oordered__idom_1(t_b_0()) ....... B3 % ~class_Ring__and__Field_Oordered__idom_1(x0) | class_Orderings_Olinorder_1(x0) ....... B5 % class_Orderings_Olinorder_1(t_b_0()) ....... R1 [B3:L0, B5:L0] % Derivation of unit clause U5: % class_Ring__and__Field_Oordered__idom_1(t_b_0()) ....... B3 % ~class_Ring__and__Field_Oordered__idom_1(x0) | class_Orderings_Oorder_1(x0) ....... B6 % class_Orderings_Oorder_1(t_b_0()) ....... R1 [B3:L0, B6:L0] % Derivation of unit clause U6: % class_Ring__and__Field_Oordered__idom_1(t_b_0()) ....... B3 % ~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_b_0()) ....... R1 [B3:L0, B7:L0] % Derivation of unit clause U7: % ~class_Orderings_Olinorder_1(x0) | c_lessequals_3(x1,c_Orderings_Omax_3(x2,x1,x0),x0) ....... B4 % class_Orderings_Olinorder_1(t_b_0()) ....... U4 % c_lessequals_3(x0, c_Orderings_Omax_3(x1, x0, t_b_0()), t_b_0()) ....... R1 [B4:L0, U4:L0] % Derivation of unit clause U10: % c_lessequals_3(c_0_0(),v_g_1(v_xa_0()),t_b_0()) ....... B0 % ~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_Ring__and__Field_Opordered__semiring_1(t_b_0()) | ~c_lessequals_3(x0, x1, t_b_0()) | c_lessequals_3(c_times_3(x0, v_g_1(v_xa_0()), t_b_0()), c_times_3(x1, v_g_1(v_xa_0()), t_b_0()), t_b_0()) ....... R1 [B0:L0, B9:L1] % class_Ring__and__Field_Opordered__semiring_1(t_b_0()) ....... U6 % ~c_lessequals_3(x0, x1, t_b_0()) | c_lessequals_3(c_times_3(x0, v_g_1(v_xa_0()), t_b_0()), c_times_3(x1, v_g_1(v_xa_0()), t_b_0()), t_b_0()) ....... R2 [R1:L0, U6:L0] % c_lessequals_3(x0,c_Orderings_Omax_3(x1,x0,t_b_0()),t_b_0()) ....... U7 % c_lessequals_3(c_times_3(x0, v_g_1(v_xa_0()), t_b_0()), c_times_3(c_Orderings_Omax_3(x1, x0, t_b_0()), v_g_1(v_xa_0()), t_b_0()), t_b_0()) ....... R3 [R2:L0, U7:L0] % Derivation of unit clause U14: % c_lessequals_3(c_HOL_Oabs_2(v_b_1(v_xa_0()),t_b_0()),c_times_3(v_ca_0(),v_g_1(v_xa_0()),t_b_0()),t_b_0()) ....... B1 % ~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_b_0()) | ~c_lessequals_3(c_times_3(v_ca_0(), v_g_1(v_xa_0()), t_b_0()), x0, t_b_0()) | c_lessequals_3(c_HOL_Oabs_2(v_b_1(v_xa_0()), t_b_0()), x0, t_b_0()) ....... R1 [B1:L0, B8:L1] % class_Orderings_Oorder_1(t_b_0()) ....... U5 % ~c_lessequals_3(c_times_3(v_ca_0(), v_g_1(v_xa_0()), t_b_0()), x0, t_b_0()) | c_lessequals_3(c_HOL_Oabs_2(v_b_1(v_xa_0()), t_b_0()), x0, t_b_0()) ....... R2 [R1:L0, U5:L0] % c_lessequals_3(c_times_3(x0,v_g_1(v_xa_0()),t_b_0()),c_times_3(c_Orderings_Omax_3(x1,x0,t_b_0()),v_g_1(v_xa_0()),t_b_0()),t_b_0()) ....... U10 % c_lessequals_3(c_HOL_Oabs_2(v_b_1(v_xa_0()), t_b_0()), c_times_3(c_Orderings_Omax_3(x0, v_ca_0(), t_b_0()), v_g_1(v_xa_0()), t_b_0()), t_b_0()) ....... R3 [R2:L0, U10:L0] % Derivation of the empty clause: % c_lessequals_3(c_HOL_Oabs_2(v_b_1(v_xa_0()),t_b_0()),c_times_3(c_Orderings_Omax_3(x0,v_ca_0(),t_b_0()),v_g_1(v_xa_0()),t_b_0()),t_b_0()) ....... U14 % ~c_lessequals_3(c_HOL_Oabs_2(v_b_1(v_xa_0()),t_b_0()),c_times_3(c_Orderings_Omax_3(v_c_0(),v_ca_0(),t_b_0()),v_g_1(v_xa_0()),t_b_0()),t_b_0()) ....... U2 % [] ....... R1 [U14:L0, U2:L0] % --------------- End of Proof --------------- % PROOF FOUND! % --------------------------------------------- % | Statistics | % --------------------------------------------- % Profile 3: Performance Statistics: % ================================== % Total number of generated clauses: 91 % resolvents: 91 factors: 0 % Number of unit clauses generated: 39 % % unit clauses generated to total clauses generated: 42.86 % Number of unit clauses constructed and retained at depth [x]: % ============================================================= % [0] = 4 [1] = 4 [3] = 7 % Total = 15 % Number of generated clauses having [x] literals: % ------------------------------------------------ % [1] = 39 [2] = 32 [3] = 20 % Average size of a generated clause: 2.0 % Number of unit clauses per predicate list: % ========================================== % [0] class_Orderings_Olinorder_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 (+)10 (-)1 % ------------------ % Total: (+)14 (-)1 % Total number of unit clauses retained: 15 % 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: 101 % Number of unification failures: 27 % Number of unit to unit unification failures: 9 % N literal unification failure due to lookup root_id table: 205 % N base clause resolution failure due to lookup table: 99 % N UC-BCL resolution dropped due to lookup table: 0 % Max entries in substitution set: 6 % N unit clauses dropped because they exceeded max values: 21 % 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: 16 % Max term depth in a unit clause: 4 % Number of states in UCFA table: 102 % Total number of terms of all unit clauses in table: 127 % Max allowed number of states in UCFA: 152000 % Ratio n states used/total allowed states: 0.00 % Ratio n states used/total unit clauses terms: 0.80 % Number of symbols (columns) in UCFA: 49 % Profile 2: Number of calls to: % ============================== % PTUnify() = 128 % ConstructUnitClause() = 32 % Profile 1: Time spent in: % ========================= % ConstructUnitClause() : 0.00 secs % -------------------------------------------------------- % | | % Inferences per sec: inf % | | % -------------------------------------------------------- % Elapsed time: 0 secs % CPU time: 0.19 secs % %------------------------------------------------------------------------------