%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SET820-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 : 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 14:22:34 EDT 2024 % Result : Unsatisfiable 0.50s 0.58s % Output : CNFRefutation 0.50s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.08 % Problem : SET820-2 : TPTP v8.2.0. Released v3.2.0. % 0.04/0.08 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.07/0.28 % Computer : n023.cluster.edu % 0.07/0.28 % Model : x86_64 x86_64 % 0.07/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.07/0.28 % Memory : 8042.1875MB % 0.07/0.28 % OS : Linux 3.10.0-693.el7.x86_64 % 0.07/0.28 % CPULimit : 300 % 0.07/0.28 % WCLimit : 300 % 0.07/0.28 % DateTime : Sun Jun 23 11:37:24 EDT 2024 % 0.07/0.28 % CPUTime : % 0.13/0.50 start to proof:theBenchmark % 0.50/0.57 %------------------------------------------- % 0.50/0.57 % File :CSE---1.7 % 0.50/0.57 % Problem :theBenchmark % 0.50/0.57 % Transform :cnf % 0.50/0.57 % Format :tptp:raw % 0.50/0.57 % Command :java -jar mcs_scs.jar %d %s % 0.50/0.57 % 0.50/0.57 % Result :Theorem 0.040000s % 0.50/0.57 % Output :CNFRefutation 0.040000s % 0.50/0.57 %------------------------------------------- % 0.50/0.57 %------------------------------------------------------------------------------ % 0.50/0.57 % File : SET820-2 : TPTP v8.2.0. Released v3.2.0. % 0.50/0.57 % Domain : Set Theory % 0.50/0.57 % Problem : Problem about set theory % 0.50/0.57 % Version : [Pau06] axioms : Reduced > Especial. % 0.50/0.57 % English : % 0.50/0.57 % 0.50/0.57 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.50/0.57 % Source : [Pau06] % 0.50/0.57 % Names : % 0.50/0.57 % 0.50/0.57 % Status : Unsatisfiable % 0.50/0.57 % Rating : 0.15 v8.2.0, 0.14 v8.1.0, 0.05 v7.5.0, 0.11 v7.4.0, 0.06 v7.3.0, 0.08 v7.1.0, 0.00 v7.0.0, 0.13 v6.4.0, 0.07 v6.3.0, 0.09 v6.2.0, 0.10 v6.1.0, 0.21 v6.0.0, 0.10 v5.5.0, 0.15 v5.4.0, 0.20 v5.3.0, 0.17 v5.2.0, 0.06 v5.1.0, 0.12 v5.0.0, 0.07 v4.1.0, 0.08 v4.0.1, 0.18 v3.7.0, 0.10 v3.5.0, 0.09 v3.4.0, 0.17 v3.3.0, 0.21 v3.2.0 % 0.50/0.57 % Syntax : Number of clauses : 6 ( 3 unt; 1 nHn; 5 RR) % 0.50/0.57 % Number of literals : 10 ( 1 equ; 5 neg) % 0.50/0.57 % Maximal clause size : 3 ( 1 avg) % 0.50/0.57 % Maximal term depth : 2 ( 1 avg) % 0.50/0.57 % Number of predicates : 3 ( 2 usr; 0 prp; 1-3 aty) % 0.50/0.57 % Number of functors : 5 ( 5 usr; 3 con; 0-3 aty) % 0.50/0.57 % Number of variables : 13 ( 5 sgn) % 0.50/0.57 % SPC : CNF_UNS_RFO_SEQ_NHN % 0.50/0.57 % 0.50/0.57 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.50/0.57 % of which only a small selection are required for the refutation. % 0.50/0.57 % The mission is to find those few axioms, after which a refutation % 0.50/0.57 % can be quite easily found. This version has only the necessary % 0.50/0.57 % axioms. % 0.50/0.57 %------------------------------------------------------------------------------ % 0.50/0.57 cnf(cls_Set_OemptyE_0,axiom, % 0.50/0.57 ~ c_in(V_a,c_emptyset,T_a) ). % 0.50/0.57 % 0.50/0.57 cnf(cls_Set_OinsertCI_1,axiom, % 0.50/0.57 c_in(V_x,c_insert(V_x,V_B,T_a),T_a) ). % 0.50/0.57 % 0.50/0.57 cnf(cls_Set_OinsertE_0,axiom, % 0.50/0.57 ( ~ c_in(V_a,c_insert(V_b,V_A,T_a),T_a) % 0.50/0.57 | c_in(V_a,V_A,T_a) % 0.50/0.57 | V_a = V_b ) ). % 0.50/0.57 % 0.50/0.57 cnf(cls_conjecture_0,negated_conjecture, % 0.50/0.57 v_P(v_a) ). % 0.50/0.57 % 0.50/0.57 cnf(cls_conjecture_1,negated_conjecture, % 0.50/0.57 ( ~ c_in(V_V,V_U,tc_IntDef_Oint) % 0.50/0.57 | c_in(v_x(V_U),V_U,tc_IntDef_Oint) ) ). % 0.50/0.57 % 0.50/0.57 cnf(cls_conjecture_2,negated_conjecture, % 0.50/0.57 ( ~ c_in(V_W,V_U,tc_IntDef_Oint) % 0.50/0.57 | ~ v_P(v_x(V_U)) ) ). % 0.50/0.57 % 0.50/0.57 %------------------------------------------------------------------------------ % 0.50/0.58 %------------------------------------------- % 0.50/0.58 % Proof found % 0.50/0.58 % SZS status Theorem for theBenchmark % 0.50/0.58 % SZS output start Proof % 0.50/0.58 %ClaNum:17(EqnAxiom:11) % 0.50/0.58 %VarNum:24(SingletonVarNum:13) % 0.50/0.58 %MaxLitNum:3 % 0.50/0.58 %MaxfuncDepth:1 % 0.50/0.58 %SharedTerms:4 % 0.50/0.58 %goalClause: 12 15 16 % 0.50/0.58 %singleGoalClaCount:1 % 0.50/0.58 [12]P1(a1) % 0.50/0.58 [14]~P2(x141,a3,x142) % 0.50/0.58 [13]P2(x131,f2(x131,x132,x133),x133) % 0.50/0.58 [15]~P2(x152,x151,a4)+~P1(f5(x151)) % 0.50/0.58 [16]~P2(x162,x161,a4)+P2(f5(x161),x161,a4) % 0.50/0.58 [17]E(x171,x172)+P2(x171,x173,x174)+~P2(x171,f2(x172,x173,x174),x174) % 0.50/0.58 %EqnAxiom % 0.50/0.58 [1]E(x11,x11) % 0.50/0.58 [2]E(x22,x21)+~E(x21,x22) % 0.50/0.58 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 0.50/0.58 [4]~E(x41,x42)+E(f2(x41,x43,x44),f2(x42,x43,x44)) % 0.50/0.58 [5]~E(x51,x52)+E(f2(x53,x51,x54),f2(x53,x52,x54)) % 0.50/0.58 [6]~E(x61,x62)+E(f2(x63,x64,x61),f2(x63,x64,x62)) % 0.50/0.58 [7]~E(x71,x72)+E(f5(x71),f5(x72)) % 0.50/0.58 [8]~P1(x81)+P1(x82)+~E(x81,x82) % 0.50/0.58 [9]P2(x92,x93,x94)+~E(x91,x92)+~P2(x91,x93,x94) % 0.50/0.58 [10]P2(x103,x102,x104)+~E(x101,x102)+~P2(x103,x101,x104) % 0.50/0.58 [11]P2(x113,x114,x112)+~E(x111,x112)+~P2(x113,x114,x111) % 0.50/0.58 % 0.50/0.58 %------------------------------------------- % 0.50/0.58 cnf(47,plain, % 0.50/0.58 (~E(a1,f5(f2(x471,x472,a4)))), % 0.50/0.58 inference(scs_inference,[],[13,12,15,8])). % 0.50/0.58 cnf(54,plain, % 0.50/0.58 (~E(x541,f2(x542,x543,a4))+~E(a1,f5(x541))), % 0.50/0.58 inference(scs_inference,[],[47,7,3])). % 0.50/0.58 cnf(57,plain, % 0.50/0.58 (~E(x571,f2(x572,x573,a4))+~E(x574,x571)+~E(a1,f5(x574))), % 0.50/0.58 inference(scs_inference,[],[54,3])). % 0.50/0.58 cnf(58,plain, % 0.50/0.58 (~E(f5(x581),a1)+~E(x581,x582)+~E(x582,f2(x583,x584,a4))), % 0.50/0.58 inference(scs_inference,[],[57,2])). % 0.50/0.58 cnf(59,plain, % 0.50/0.58 (~E(x591,f2(x592,x593,a4))+~E(f5(x591),a1)), % 0.50/0.58 inference(scs_inference,[],[13,14,58,17])). % 0.50/0.58 cnf(60,plain, % 0.50/0.58 (~E(x601,f2(x602,x603,a4))+~P2(f5(x601),f2(a1,a3,x604),x604)), % 0.50/0.58 inference(scs_inference,[],[14,59,17])). % 0.50/0.58 cnf(61,plain, % 0.50/0.58 (~P2(f5(f2(x611,x612,a4)),f2(a1,a3,x613),x613)), % 0.50/0.58 inference(equality_inference,[],[60])). % 0.50/0.58 cnf(62,plain, % 0.50/0.58 ($false), % 0.50/0.58 inference(scs_inference,[],[13,61,16]), % 0.50/0.58 ['proof']). % 0.50/0.58 % SZS output end Proof % 0.50/0.58 % Total time :0.040000s %------------------------------------------------------------------------------