%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : COM011-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 : n027.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:52:44 EDT 2024 % Result : Unsatisfiable 0.51s 0.63s % Output : CNFRefutation 0.51s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : COM011-2 : TPTP v8.2.0. Released v3.2.0. % 0.12/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n027.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 : Thu Jun 20 23:27:24 EDT 2024 % 0.12/0.33 % CPUTime : % 0.19/0.56 start to proof:theBenchmark % 0.51/0.62 %------------------------------------------- % 0.51/0.62 % File :CSE---1.7 % 0.51/0.62 % Problem :theBenchmark % 0.51/0.62 % Transform :cnf % 0.51/0.62 % Format :tptp:raw % 0.51/0.62 % Command :java -jar mcs_scs.jar %d %s % 0.51/0.62 % 0.51/0.62 % Result :Theorem 0.030000s % 0.51/0.62 % Output :CNFRefutation 0.030000s % 0.51/0.62 %------------------------------------------- % 0.51/0.63 %------------------------------------------------------------------------------ % 0.51/0.63 % File : COM011-2 : TPTP v8.2.0. Released v3.2.0. % 0.51/0.63 % Domain : Computing Theory % 0.51/0.63 % Problem : Problem about UNITY theory % 0.51/0.63 % Version : [Pau06] axioms : Reduced > Especial. % 0.51/0.63 % English : % 0.51/0.63 % 0.51/0.63 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.51/0.63 % Source : [Pau06] % 0.51/0.63 % Names : % 0.51/0.63 % 0.51/0.63 % Status : Unsatisfiable % 0.51/0.63 % Rating : 0.08 v8.2.0, 0.14 v8.1.0, 0.00 v5.0.0, 0.07 v4.1.0, 0.00 v4.0.0, 0.14 v3.4.0, 0.00 v3.2.0 % 0.51/0.63 % Syntax : Number of clauses : 10 ( 3 unt; 1 nHn; 9 RR) % 0.51/0.63 % Number of literals : 20 ( 0 equ; 10 neg) % 0.51/0.63 % Maximal clause size : 3 ( 2 avg) % 0.51/0.63 % Maximal term depth : 4 ( 1 avg) % 0.51/0.63 % Number of predicates : 2 ( 2 usr; 0 prp; 3-3 aty) % 0.51/0.63 % Number of functors : 13 ( 13 usr; 4 con; 0-3 aty) % 0.51/0.63 % Number of variables : 27 ( 1 sgn) % 0.51/0.63 % SPC : CNF_UNS_RFO_NEQ_NHN % 0.51/0.63 % 0.51/0.63 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.51/0.63 % of which only a small selection are required for the refutation. % 0.51/0.63 % The mission is to find those few axioms, after which a refutation % 0.51/0.63 % can be quite easily found. This version has only the necessary % 0.51/0.63 % axioms. % 0.51/0.63 %------------------------------------------------------------------------------ % 0.51/0.63 cnf(cls_conjecture_0,negated_conjecture, % 0.51/0.63 c_in(v_F,c_UNITY_Oconstrains(v_A,c_union(v_A,v_B,t_a),t_a),tc_UNITY_Oprogram(t_a)) ). % 0.51/0.63 % 0.51/0.63 cnf(cls_conjecture_1,negated_conjecture, % 0.51/0.63 c_in(v_F,c_WFair_Otransient(v_A,t_a),tc_UNITY_Oprogram(t_a)) ). % 0.51/0.63 % 0.51/0.63 cnf(cls_conjecture_2,negated_conjecture, % 0.51/0.63 ~ c_in(v_F,c_WFair_OleadsTo(v_A,v_B,t_a),tc_UNITY_Oprogram(t_a)) ). % 0.51/0.63 % 0.51/0.63 cnf(cls_Set_ODiffE_1,axiom, % 0.51/0.63 ( ~ c_in(V_c,c_minus(V_A,V_B,tc_set(T_a)),T_a) % 0.51/0.63 | c_in(V_c,V_A,T_a) ) ). % 0.51/0.63 % 0.51/0.63 cnf(cls_Set_OsubsetI_0,axiom, % 0.51/0.63 ( c_in(c_Main_OsubsetI__1(V_A,V_B,T_a),V_A,T_a) % 0.51/0.63 | c_lessequals(V_A,V_B,tc_set(T_a)) ) ). % 0.51/0.63 % 0.51/0.63 cnf(cls_Set_OsubsetI_1,axiom, % 0.51/0.63 ( ~ c_in(c_Main_OsubsetI__1(V_A,V_B,T_a),V_B,T_a) % 0.51/0.63 | c_lessequals(V_A,V_B,tc_set(T_a)) ) ). % 0.51/0.63 % 0.51/0.63 cnf(cls_UNITY_Oconstrains__weaken__L_0,axiom, % 0.51/0.63 ( ~ c_in(V_F,c_UNITY_Oconstrains(V_A,V_A_H,T_a),tc_UNITY_Oprogram(T_a)) % 0.51/0.63 | ~ c_lessequals(V_B,V_A,tc_set(T_a)) % 0.51/0.63 | c_in(V_F,c_UNITY_Oconstrains(V_B,V_A_H,T_a),tc_UNITY_Oprogram(T_a)) ) ). % 0.51/0.63 % 0.51/0.63 cnf(cls_WFair_OensuresI_0,axiom, % 0.51/0.63 ( ~ c_in(V_F,c_UNITY_Oconstrains(c_minus(V_A,V_B,tc_set(T_a)),c_union(V_A,V_B,T_a),T_a),tc_UNITY_Oprogram(T_a)) % 0.51/0.63 | ~ c_in(V_F,c_WFair_Otransient(c_minus(V_A,V_B,tc_set(T_a)),T_a),tc_UNITY_Oprogram(T_a)) % 0.51/0.63 | c_in(V_F,c_WFair_Oensures(V_A,V_B,T_a),tc_UNITY_Oprogram(T_a)) ) ). % 0.51/0.63 % 0.51/0.63 cnf(cls_WFair_OleadsTo__Basis_0,axiom, % 0.51/0.63 ( ~ c_in(V_F,c_WFair_Oensures(V_A,V_B,T_a),tc_UNITY_Oprogram(T_a)) % 0.51/0.63 | c_in(V_F,c_WFair_OleadsTo(V_A,V_B,T_a),tc_UNITY_Oprogram(T_a)) ) ). % 0.51/0.63 % 0.51/0.63 cnf(cls_WFair_Otransient__strengthen_0,axiom, % 0.51/0.63 ( ~ c_in(V_F,c_WFair_Otransient(V_A,T_a),tc_UNITY_Oprogram(T_a)) % 0.51/0.63 | ~ c_lessequals(V_B,V_A,tc_set(T_a)) % 0.51/0.63 | c_in(V_F,c_WFair_Otransient(V_B,T_a),tc_UNITY_Oprogram(T_a)) ) ). % 0.51/0.63 % 0.51/0.63 %------------------------------------------------------------------------------ % 0.51/0.63 %------------------------------------------- % 0.51/0.63 % Proof found % 0.51/0.63 % SZS status Theorem for theBenchmark % 0.51/0.63 % SZS output start Proof % 0.51/0.63 %ClaNum:10(EqnAxiom:0) % 0.51/0.63 %VarNum:78(SingletonVarNum:27) % 0.51/0.63 %MaxLitNum:3 % 0.51/0.63 %MaxfuncDepth:3 % 0.51/0.63 %SharedTerms:12 % 0.51/0.63 %goalClause: 1 2 3 % 0.51/0.63 %singleGoalClaCount:3 % 0.51/0.63 [1]P1(a1,f4(a2,a3),f11(a3)) % 0.51/0.63 [3]~P1(a1,f7(a2,a13,a3),f11(a3)) % 0.51/0.63 [2]P1(a1,f5(a2,f9(a2,a13,a3),a3),f11(a3)) % 0.51/0.63 [4]P1(f6(x41,x42,x43),x41,x43)+P2(x41,x42,f12(x43)) % 0.51/0.63 [5]~P1(f6(x51,x52,x53),x52,x53)+P2(x51,x52,f12(x53)) % 0.51/0.63 [8]~P1(x81,f8(x82,x83,x84),f11(x84))+P1(x81,f7(x82,x83,x84),f11(x84)) % 0.51/0.63 [7]P1(x71,x72,x73)+~P1(x71,f10(x72,x74,f12(x73)),x73) % 0.51/0.63 [6]~P1(x61,f4(x64,x63),f11(x63))+P1(x61,f4(x62,x63),f11(x63))+~P2(x62,x64,f12(x63)) % 0.51/0.63 [10]P1(x101,f8(x102,x103,x104),f11(x104))+~P1(x101,f5(f10(x102,x103,f12(x104)),f9(x102,x103,x104),x104),f11(x104))+~P1(x101,f4(f10(x102,x103,f12(x104)),x104),f11(x104)) % 0.51/0.63 [9]~P1(x91,f5(x95,x93,x94),f11(x94))+P1(x91,f5(x92,x93,x94),f11(x94))+~P2(x92,x95,f12(x94)) % 0.51/0.63 %EqnAxiom % 0.51/0.63 % 0.51/0.63 %------------------------------------------- % 0.51/0.63 cnf(11,plain, % 0.51/0.63 (~P1(a1,f8(a2,a13,a3),f11(a3))), % 0.51/0.63 inference(scs_inference,[],[3,8])). % 0.51/0.63 cnf(14,plain, % 0.51/0.63 (~P1(f6(x141,a2,a3),a2,a3)+P1(a1,f5(x141,f9(a2,a13,a3),a3),f11(a3))), % 0.51/0.63 inference(scs_inference,[],[2,5,9])). % 0.51/0.63 cnf(20,plain, % 0.51/0.63 (P1(f6(x201,a2,a3),x201,a3)+P1(a1,f5(x201,f9(a2,a13,a3),a3),f11(a3))), % 0.51/0.63 inference(scs_inference,[],[2,4,9])). % 0.51/0.63 cnf(21,plain, % 0.51/0.63 (P1(f6(f10(x211,x212,f12(a3)),a2,a3),x211,a3)+P1(a1,f5(f10(x211,x212,f12(a3)),f9(a2,a13,a3),a3),f11(a3))), % 0.51/0.63 inference(scs_inference,[],[20,7])). % 0.51/0.63 cnf(22,plain, % 0.51/0.63 (P1(a1,f5(f10(a2,x221,f12(a3)),f9(a2,a13,a3),a3),f11(a3))), % 0.51/0.63 inference(scs_inference,[],[21,14])). % 0.51/0.63 cnf(32,plain, % 0.51/0.63 (P1(f6(f10(x321,x322,f12(x323)),x324,x323),x321,x323)+P2(f10(x321,x322,f12(x323)),x324,f12(x323))), % 0.51/0.63 inference(scs_inference,[],[4,7])). % 0.51/0.63 cnf(33,plain, % 0.51/0.63 (P2(f10(x331,x332,f12(x333)),x331,f12(x333))), % 0.51/0.63 inference(scs_inference,[],[32,5])). % 0.51/0.63 cnf(37,plain, % 0.51/0.63 ($false), % 0.51/0.63 inference(scs_inference,[],[1,33,11,22,6,10]), % 0.51/0.63 ['proof']). % 0.51/0.63 % SZS output end Proof % 0.51/0.63 % Total time :0.030000s %------------------------------------------------------------------------------