%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : ANA039-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:00 EDT 2024 % Result : Unsatisfiable 0.60s 0.68s % Output : CNFRefutation 0.60s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : ANA039-2 : TPTP v8.2.0. Released v3.2.0. % 0.04/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n023.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 300 % 0.12/0.33 % DateTime : Sun Jun 23 04:44:09 EDT 2024 % 0.12/0.33 % CPUTime : % 0.46/0.63 start to proof:theBenchmark % 0.60/0.68 %------------------------------------------- % 0.60/0.68 % File :CSE---1.7 % 0.60/0.68 % Problem :theBenchmark % 0.60/0.68 % Transform :cnf % 0.60/0.68 % Format :tptp:raw % 0.60/0.68 % Command :java -jar mcs_scs.jar %d %s % 0.60/0.68 % 0.60/0.68 % Result :Theorem 0.020000s % 0.60/0.68 % Output :CNFRefutation 0.020000s % 0.60/0.68 %------------------------------------------- % 0.60/0.68 %------------------------------------------------------------------------------ % 0.60/0.68 % File : ANA039-2 : TPTP v8.2.0. Released v3.2.0. % 0.60/0.68 % Domain : Analysis % 0.60/0.68 % Problem : Problem about Big-O notation % 0.60/0.68 % Version : [Pau06] axioms : Reduced > Especial. % 0.60/0.68 % English : % 0.60/0.68 % 0.60/0.68 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.60/0.68 % Source : [Pau06] % 0.60/0.68 % Names : % 0.60/0.68 % 0.60/0.68 % Status : Unsatisfiable % 0.60/0.68 % Rating : 0.00 v6.1.0, 0.07 v6.0.0, 0.00 v5.5.0, 0.06 v5.4.0, 0.11 v5.3.0, 0.15 v5.2.0, 0.00 v5.1.0, 0.06 v5.0.0, 0.07 v4.0.1, 0.00 v3.2.0 % 0.60/0.68 % Syntax : Number of clauses : 10 ( 3 unt; 0 nHn; 7 RR) % 0.60/0.68 % Number of literals : 21 ( 0 equ; 12 neg) % 0.60/0.68 % Maximal clause size : 4 ( 2 avg) % 0.60/0.68 % Maximal term depth : 4 ( 1 avg) % 0.60/0.68 % Number of predicates : 5 ( 5 usr; 0 prp; 1-3 aty) % 0.60/0.68 % Number of functors : 8 ( 8 usr; 4 con; 0-3 aty) % 0.60/0.68 % Number of variables : 16 ( 1 sgn) % 0.60/0.68 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.60/0.68 % 0.60/0.68 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.60/0.68 % of which only a small selection are required for the refutation. % 0.60/0.68 % The mission is to find those few axioms, after which a refutation % 0.60/0.68 % can be quite easily found. This version has only the necessary % 0.60/0.68 % axioms. % 0.60/0.68 %------------------------------------------------------------------------------ % 0.60/0.68 cnf(cls_conjecture_0,negated_conjecture, % 0.60/0.68 c_lessequals(c_HOL_Oabs(v_h(V_U),t_a),c_times(v_c,c_HOL_Oabs(v_f(V_U),t_a),t_a),t_a) ). % 0.60/0.68 % 0.60/0.68 cnf(cls_conjecture_2,negated_conjecture, % 0.60/0.68 ~ c_lessequals(c_HOL_Oabs(v_h(v_x),t_a),c_times(c_HOL_Oabs(v_c,t_a),c_HOL_Oabs(v_f(v_x),t_a),t_a),t_a) ). % 0.60/0.68 % 0.60/0.68 cnf(tfree_tcs,negated_conjecture, % 0.60/0.68 class_Ring__and__Field_Oordered__idom(t_a) ). % 0.60/0.68 % 0.60/0.68 cnf(cls_OrderedGroup_Oabs__ge__self_0,axiom, % 0.60/0.68 ( ~ class_OrderedGroup_Olordered__ab__group__abs(T_a) % 0.60/0.68 | c_lessequals(V_a,c_HOL_Oabs(V_a,T_a),T_a) ) ). % 0.60/0.68 % 0.60/0.68 cnf(cls_OrderedGroup_Oabs__ge__zero_0,axiom, % 0.60/0.68 ( ~ class_OrderedGroup_Olordered__ab__group__abs(T_a) % 0.60/0.68 | c_lessequals(c_0,c_HOL_Oabs(V_a,T_a),T_a) ) ). % 0.60/0.68 % 0.60/0.68 cnf(cls_Orderings_Oorder__class_Oorder__trans_0,axiom, % 0.60/0.68 ( ~ class_Orderings_Oorder(T_a) % 0.60/0.68 | ~ c_lessequals(V_y,V_z,T_a) % 0.60/0.68 | ~ c_lessequals(V_x,V_y,T_a) % 0.60/0.68 | c_lessequals(V_x,V_z,T_a) ) ). % 0.60/0.68 % 0.60/0.68 cnf(cls_Ring__and__Field_Opordered__semiring__class_Omult__right__mono_0,axiom, % 0.60/0.68 ( ~ class_Ring__and__Field_Opordered__semiring(T_a) % 0.60/0.68 | ~ c_lessequals(V_a,V_b,T_a) % 0.60/0.68 | ~ c_lessequals(c_0,V_c,T_a) % 0.60/0.68 | c_lessequals(c_times(V_a,V_c,T_a),c_times(V_b,V_c,T_a),T_a) ) ). % 0.60/0.68 % 0.60/0.68 cnf(clsrel_Ring__and__Field_Oordered__idom_42,axiom, % 0.60/0.68 ( ~ class_Ring__and__Field_Oordered__idom(T) % 0.60/0.68 | class_Ring__and__Field_Opordered__semiring(T) ) ). % 0.60/0.68 % 0.60/0.68 cnf(clsrel_Ring__and__Field_Oordered__idom_44,axiom, % 0.60/0.68 ( ~ class_Ring__and__Field_Oordered__idom(T) % 0.60/0.68 | class_Orderings_Oorder(T) ) ). % 0.60/0.68 % 0.60/0.68 cnf(clsrel_Ring__and__Field_Oordered__idom_50,axiom, % 0.60/0.68 ( ~ class_Ring__and__Field_Oordered__idom(T) % 0.60/0.68 | class_OrderedGroup_Olordered__ab__group__abs(T) ) ). % 0.60/0.68 % 0.60/0.68 %------------------------------------------------------------------------------ % 0.60/0.68 %------------------------------------------- % 0.60/0.68 % Proof found % 0.60/0.68 % SZS status Theorem for theBenchmark % 0.60/0.68 % SZS output start Proof % 0.60/0.68 %ClaNum:10(EqnAxiom:0) % 0.60/0.68 %VarNum:40(SingletonVarNum:16) % 0.60/0.68 %MaxLitNum:4 % 0.60/0.68 %MaxfuncDepth:3 % 0.60/0.68 %SharedTerms:12 % 0.60/0.68 %goalClause: 1 2 3 % 0.60/0.68 %singleGoalClaCount:3 % 0.60/0.68 [1]P1(a1) % 0.60/0.68 [3]~P2(f2(f5(a8),a1),f4(f2(a6,a1),f2(f7(a8),a1),a1),a1) % 0.60/0.68 [2]P2(f2(f5(x21),a1),f4(a6,f2(f7(x21),a1),a1),a1) % 0.60/0.68 [4]~P1(x41)+P3(x41) % 0.60/0.68 [5]~P1(x51)+P4(x51) % 0.60/0.68 [6]~P1(x61)+P5(x61) % 0.60/0.68 [7]~P3(x72)+P2(a3,f2(x71,x72),x72) % 0.60/0.68 [8]~P3(x82)+P2(x81,f2(x81,x82),x82) % 0.60/0.68 [9]~P4(x93)+~P2(x94,x92,x93)+P2(x91,x92,x93)+~P2(x91,x94,x93) % 0.60/0.68 [10]~P5(x103)+~P2(x101,x104,x103)+~P2(a3,x102,x103)+P2(f4(x101,x102,x103),f4(x104,x102,x103),x103) % 0.60/0.68 %EqnAxiom % 0.60/0.68 % 0.60/0.68 %------------------------------------------- % 0.60/0.69 cnf(11,plain, % 0.60/0.69 (P2(a3,f2(x111,a1),a1)), % 0.60/0.69 inference(scs_inference,[],[1,4,7])). % 0.60/0.69 cnf(31,plain, % 0.60/0.69 (~P3(a1)+~P5(a1)+P2(f4(x311,f2(x312,a1),a1),f4(f2(x311,a1),f2(x312,a1),a1),a1)), % 0.60/0.69 inference(scs_inference,[],[11,8,10])). % 0.60/0.69 cnf(32,plain, % 0.60/0.69 (~P4(a1)+~P3(a1)+~P5(a1)), % 0.60/0.69 inference(scs_inference,[],[2,3,31,9])). % 0.60/0.69 cnf(33,plain, % 0.60/0.69 (~P3(a1)+~P5(a1)), % 0.60/0.69 inference(scs_inference,[],[1,32,5])). % 0.60/0.69 cnf(34,plain, % 0.60/0.69 (~P5(a1)), % 0.60/0.69 inference(scs_inference,[],[1,33,4])). % 0.60/0.69 cnf(35,plain, % 0.60/0.69 ($false), % 0.60/0.69 inference(scs_inference,[],[1,34,6]), % 0.60/0.69 ['proof']). % 0.60/0.69 % SZS output end Proof % 0.60/0.69 % Total time :0.020000s %------------------------------------------------------------------------------