%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : ANA013-2 : TPTP v8.2.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n019.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:13:53 EDT 2024 % Result : Unsatisfiable 0.53s 0.61s % Output : CNFRefutation 0.53s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : ANA013-2 : TPTP v8.2.0. Released v3.2.0. % 0.03/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.13/0.34 % Computer : n019.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 300 % 0.13/0.34 % DateTime : Sun Jun 23 04:52:39 EDT 2024 % 0.13/0.35 % CPUTime : % 0.53/0.58 start to proof:theBenchmark % 0.53/0.61 %------------------------------------------- % 0.53/0.61 % File :CSE---1.7 % 0.53/0.61 % Problem :theBenchmark % 0.53/0.61 % Transform :cnf % 0.53/0.61 % Format :tptp:raw % 0.53/0.61 % Command :java -jar mcs_scs.jar %d %s % 0.53/0.61 % 0.53/0.61 % Result :Theorem 0.000000s % 0.53/0.61 % Output :CNFRefutation 0.000000s % 0.53/0.61 %------------------------------------------- % 0.53/0.61 %------------------------------------------------------------------------------ % 0.53/0.61 % File : ANA013-2 : TPTP v8.2.0. Released v3.2.0. % 0.53/0.61 % Domain : Analysis % 0.53/0.61 % Problem : Problem about Big-O notation % 0.53/0.61 % Version : [Pau06] axioms : Reduced > Especial. % 0.53/0.61 % English : % 0.53/0.61 % 0.53/0.61 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.53/0.61 % Source : [Pau06] % 0.53/0.61 % Names : % 0.53/0.61 % 0.53/0.61 % Status : Unsatisfiable % 0.53/0.61 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0 % 0.53/0.61 % Syntax : Number of clauses : 4 ( 2 unt; 0 nHn; 3 RR) % 0.53/0.61 % Number of literals : 6 ( 0 equ; 3 neg) % 0.53/0.61 % Maximal clause size : 2 ( 1 avg) % 0.53/0.61 % Maximal term depth : 5 ( 2 avg) % 0.53/0.61 % Number of predicates : 3 ( 3 usr; 0 prp; 1-3 aty) % 0.53/0.61 % Number of functors : 6 ( 6 usr; 2 con; 0-3 aty) % 0.53/0.61 % Number of variables : 4 ( 0 sgn) % 0.53/0.61 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.53/0.61 % 0.53/0.61 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.53/0.61 % of which only a small selection are required for the refutation. % 0.53/0.61 % The mission is to find those few axioms, after which a refutation % 0.53/0.61 % can be quite easily found. This version has only the necessary % 0.53/0.61 % axioms. % 0.53/0.61 %------------------------------------------------------------------------------ % 0.53/0.61 cnf(cls_conjecture_0,negated_conjecture, % 0.53/0.61 ~ c_lessequals(c_times(c_HOL_Oabs(v_c,t_b),c_HOL_Oabs(v_f(v_x(V_U)),t_b),t_b),c_times(V_U,c_HOL_Oabs(v_f(v_x(V_U)),t_b),t_b),t_b) ). % 0.53/0.61 % 0.53/0.61 cnf(tfree_tcs,negated_conjecture, % 0.53/0.61 class_Ring__and__Field_Oordered__idom(t_b) ). % 0.53/0.61 % 0.53/0.61 cnf(cls_Orderings_Oorder__class_Oaxioms__1_0,axiom, % 0.53/0.61 ( ~ class_Orderings_Oorder(T_a) % 0.53/0.61 | c_lessequals(V_x,V_x,T_a) ) ). % 0.53/0.61 % 0.53/0.61 cnf(clsrel_Ring__and__Field_Oordered__idom_44,axiom, % 0.53/0.61 ( ~ class_Ring__and__Field_Oordered__idom(T) % 0.53/0.61 | class_Orderings_Oorder(T) ) ). % 0.53/0.61 % 0.53/0.61 %------------------------------------------------------------------------------ % 0.53/0.61 %------------------------------------------- % 0.53/0.61 % Proof found % 0.53/0.61 % SZS status Theorem for theBenchmark % 0.53/0.61 % SZS output start Proof % 0.53/0.61 %ClaNum:4(EqnAxiom:0) % 0.53/0.61 %VarNum:9(SingletonVarNum:4) % 0.53/0.61 %MaxLitNum:2 % 0.53/0.61 %MaxfuncDepth:4 % 0.53/0.61 %SharedTerms:4 % 0.53/0.61 %goalClause: 1 2 % 0.53/0.61 %singleGoalClaCount:2 % 0.53/0.61 [1]P1(a1) % 0.53/0.61 [2]~P2(f3(f2(a4,a1),f2(f6(f5(x21)),a1),a1),f3(x21,f2(f6(f5(x21)),a1),a1),a1) % 0.53/0.61 [3]~P1(x31)+P3(x31) % 0.53/0.61 [4]~P3(x42)+P2(x41,x41,x42) % 0.53/0.61 %EqnAxiom % 0.53/0.61 % 0.53/0.61 %------------------------------------------- % 0.53/0.62 cnf(8,plain, % 0.53/0.62 ($false), % 0.53/0.62 inference(scs_inference,[],[1,2,4,3]), % 0.53/0.62 ['proof']). % 0.53/0.62 % SZS output end Proof % 0.53/0.62 % Total time :0.000000s %------------------------------------------------------------------------------