%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : ANA044-2 : TPTP v8.2.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % Computer : n023.cluster.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz % Memory : 8042.1875MB % OS : Linux 3.10.0-693.el7.x86_64 % CPULimit : 300s % WCLimit : 300s % DateTime : Mon Jun 24 04:14:01 EDT 2024 % Result : Unsatisfiable 0.50s 0.61s % Output : CNFRefutation 0.50s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.02/0.10 % Problem : ANA044-2 : TPTP v8.2.0. Released v3.2.0. % 0.02/0.10 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.09/0.31 % Computer : n023.cluster.edu % 0.09/0.31 % Model : x86_64 x86_64 % 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.31 % Memory : 8042.1875MB % 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64 % 0.09/0.31 % CPULimit : 300 % 0.09/0.31 % WCLimit : 300 % 0.09/0.31 % DateTime : Sun Jun 23 04:40:24 EDT 2024 % 0.09/0.31 % CPUTime : % 0.49/0.56 start to proof:theBenchmark % 0.50/0.60 %------------------------------------------- % 0.50/0.60 % File :CSE---1.7 % 0.50/0.60 % Problem :theBenchmark % 0.50/0.60 % Transform :cnf % 0.50/0.60 % Format :tptp:raw % 0.50/0.60 % Command :java -jar mcs_scs.jar %d %s % 0.50/0.60 % 0.50/0.60 % Result :Theorem 0.010000s % 0.50/0.60 % Output :CNFRefutation 0.010000s % 0.50/0.60 %------------------------------------------- % 0.50/0.60 %------------------------------------------------------------------------------ % 0.50/0.60 % File : ANA044-2 : TPTP v8.2.0. Released v3.2.0. % 0.50/0.60 % Domain : Analysis % 0.50/0.60 % Problem : Problem about Big-O notation % 0.50/0.60 % Version : [Pau06] axioms : Reduced > Especial. % 0.50/0.60 % English : % 0.50/0.60 % 0.50/0.60 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.50/0.60 % Source : [Pau06] % 0.50/0.60 % Names : % 0.50/0.60 % 0.50/0.60 % Status : Unsatisfiable % 0.50/0.60 % Rating : 0.00 v5.3.0, 0.08 v5.2.0, 0.00 v5.1.0, 0.14 v5.0.0, 0.29 v4.1.0, 0.22 v4.0.1, 0.33 v3.7.0, 0.17 v3.3.0, 0.29 v3.2.0 % 0.50/0.60 % Syntax : Number of clauses : 8 ( 4 unt; 0 nHn; 6 RR) % 0.50/0.60 % Number of literals : 15 ( 2 equ; 8 neg) % 0.50/0.60 % Maximal clause size : 4 ( 1 avg) % 0.50/0.60 % Maximal term depth : 5 ( 1 avg) % 0.50/0.60 % Number of predicates : 5 ( 4 usr; 0 prp; 1-3 aty) % 0.50/0.60 % Number of functors : 9 ( 9 usr; 4 con; 0-3 aty) % 0.50/0.60 % Number of variables : 10 ( 3 sgn) % 0.50/0.60 % SPC : CNF_UNS_RFO_SEQ_HRN % 0.50/0.60 % 0.50/0.60 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.50/0.60 % of which only a small selection are required for the refutation. % 0.50/0.60 % The mission is to find those few axioms, after which a refutation % 0.50/0.60 % can be quite easily found. This version has only the necessary % 0.50/0.60 % axioms. % 0.50/0.60 %------------------------------------------------------------------------------ % 0.50/0.60 cnf(cls_conjecture_0,negated_conjecture, % 0.50/0.60 c_lessequals(c_0,v_l(V_U,V_V),t_b) ). % 0.50/0.60 % 0.50/0.60 cnf(cls_conjecture_1,negated_conjecture, % 0.50/0.60 c_lessequals(c_0,v_h(V_U),t_b) ). % 0.50/0.60 % 0.50/0.60 cnf(cls_conjecture_3,negated_conjecture, % 0.50/0.60 c_times(v_l(v_x,v_xa),v_h(v_k(v_x,v_xa)),t_b) != c_HOL_Oabs(c_times(v_l(v_x,v_xa),v_h(v_k(v_x,v_xa)),t_b),t_b) ). % 0.50/0.60 % 0.50/0.60 cnf(tfree_tcs,negated_conjecture, % 0.50/0.60 class_Ring__and__Field_Oordered__idom(t_b) ). % 0.50/0.60 % 0.50/0.60 cnf(cls_OrderedGroup_Oabs__of__nonneg_0,axiom, % 0.50/0.60 ( ~ class_OrderedGroup_Olordered__ab__group__abs(T_a) % 0.50/0.60 | ~ c_lessequals(c_0,V_y,T_a) % 0.50/0.60 | c_HOL_Oabs(V_y,T_a) = V_y ) ). % 0.50/0.60 % 0.50/0.60 cnf(cls_Ring__and__Field_Omult__nonneg__nonneg_0,axiom, % 0.50/0.60 ( ~ class_Ring__and__Field_Opordered__cancel__semiring(T_a) % 0.50/0.60 | ~ c_lessequals(c_0,V_b,T_a) % 0.50/0.60 | ~ c_lessequals(c_0,V_a,T_a) % 0.50/0.60 | c_lessequals(c_0,c_times(V_a,V_b,T_a),T_a) ) ). % 0.50/0.60 % 0.50/0.60 cnf(clsrel_Ring__and__Field_Oordered__idom_40,axiom, % 0.50/0.60 ( ~ class_Ring__and__Field_Oordered__idom(T) % 0.50/0.61 | class_Ring__and__Field_Opordered__cancel__semiring(T) ) ). % 0.50/0.61 % 0.50/0.61 cnf(clsrel_Ring__and__Field_Oordered__idom_50,axiom, % 0.50/0.61 ( ~ class_Ring__and__Field_Oordered__idom(T) % 0.50/0.61 | class_OrderedGroup_Olordered__ab__group__abs(T) ) ). % 0.50/0.61 % 0.50/0.61 %------------------------------------------------------------------------------ % 0.50/0.61 %------------------------------------------- % 0.50/0.61 % Proof found % 0.50/0.61 % SZS status Theorem for theBenchmark % 0.50/0.61 % SZS output start Proof % 0.50/0.61 %ClaNum:27(EqnAxiom:19) % 0.50/0.61 %VarNum:22(SingletonVarNum:10) % 0.50/0.61 %MaxLitNum:4 % 0.50/0.61 %MaxfuncDepth:4 % 0.50/0.61 %SharedTerms:11 % 0.50/0.61 %goalClause: 20 21 22 23 % 0.50/0.61 %singleGoalClaCount:4 % 0.50/0.61 [20]P1(a1) % 0.50/0.61 [23]~E(f4(f3(f6(a8,a9),f5(f7(a8,a9)),a1),a1),f3(f6(a8,a9),f5(f7(a8,a9)),a1)) % 0.50/0.61 [21]P2(a2,f5(x211),a1) % 0.50/0.61 [22]P2(a2,f6(x221,x222),a1) % 0.50/0.61 [24]~P1(x241)+P3(x241) % 0.50/0.61 [25]~P1(x251)+P4(x251) % 0.50/0.61 [26]~P3(x262)+~P2(a2,x261,x262)+E(f4(x261,x262),x261) % 0.50/0.61 [27]~P4(x273)+~P2(a2,x271,x273)+~P2(a2,x272,x273)+P2(a2,f3(x271,x272,x273),x273) % 0.50/0.61 %EqnAxiom % 0.50/0.61 [1]E(x11,x11) % 0.50/0.61 [2]E(x22,x21)+~E(x21,x22) % 0.50/0.61 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 0.50/0.61 [4]~E(x41,x42)+E(f5(x41),f5(x42)) % 0.50/0.61 [5]~E(x51,x52)+E(f6(x51,x53),f6(x52,x53)) % 0.50/0.61 [6]~E(x61,x62)+E(f6(x63,x61),f6(x63,x62)) % 0.50/0.61 [7]~E(x71,x72)+E(f3(x71,x73,x74),f3(x72,x73,x74)) % 0.50/0.61 [8]~E(x81,x82)+E(f3(x83,x81,x84),f3(x83,x82,x84)) % 0.50/0.61 [9]~E(x91,x92)+E(f3(x93,x94,x91),f3(x93,x94,x92)) % 0.50/0.61 [10]~E(x101,x102)+E(f7(x101,x103),f7(x102,x103)) % 0.50/0.61 [11]~E(x111,x112)+E(f7(x113,x111),f7(x113,x112)) % 0.50/0.61 [12]~E(x121,x122)+E(f4(x121,x123),f4(x122,x123)) % 0.50/0.61 [13]~E(x131,x132)+E(f4(x133,x131),f4(x133,x132)) % 0.50/0.61 [14]~P1(x141)+P1(x142)+~E(x141,x142) % 0.50/0.61 [15]P2(x152,x153,x154)+~E(x151,x152)+~P2(x151,x153,x154) % 0.50/0.61 [16]P2(x163,x162,x164)+~E(x161,x162)+~P2(x163,x161,x164) % 0.50/0.61 [17]P2(x173,x174,x172)+~E(x171,x172)+~P2(x173,x174,x171) % 0.50/0.61 [18]~P4(x181)+P4(x182)+~E(x181,x182) % 0.50/0.61 [19]~P3(x191)+P3(x192)+~E(x191,x192) % 0.50/0.61 % 0.50/0.61 %------------------------------------------- % 0.50/0.61 cnf(28,plain, % 0.50/0.61 (~P3(a1)+~P2(a2,f3(f6(a8,a9),f5(f7(a8,a9)),a1),a1)), % 0.50/0.61 inference(scs_inference,[],[23,26])). % 0.50/0.61 cnf(38,plain, % 0.50/0.61 (P2(a2,x381,a1)+~E(f6(x382,x383),x381)), % 0.50/0.61 inference(scs_inference,[],[22,17,16])). % 0.50/0.61 cnf(45,plain, % 0.50/0.61 (P2(a2,x451,a1)+~E(f5(x452),x451)), % 0.50/0.61 inference(scs_inference,[],[21,17,15,16])). % 0.50/0.61 cnf(49,plain, % 0.50/0.61 (~P2(a2,f3(f6(a8,a9),f5(f7(a8,a9)),a1),a1)), % 0.50/0.61 inference(scs_inference,[],[20,24,28])). % 0.50/0.61 cnf(56,plain, % 0.50/0.61 ($false), % 0.50/0.61 inference(scs_inference,[],[21,22,20,49,38,45,27,25]), % 0.50/0.61 ['proof']). % 0.50/0.61 % SZS output end Proof % 0.50/0.61 % Total time :0.010000s %------------------------------------------------------------------------------