%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SET842-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 : n029.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:41 EDT 2024 % Result : Unsatisfiable 58.61s 58.67s % Output : CNFRefutation 58.61s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.13 % Problem : SET842-2 : TPTP v8.2.0. Released v3.2.0. % 0.12/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.13/0.34 % Computer : n029.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 13:20:54 EDT 2024 % 0.13/0.34 % CPUTime : % 0.21/0.57 start to proof:theBenchmark % 58.55/58.65 %------------------------------------------- % 58.55/58.65 % File :CSE---1.7 % 58.55/58.65 % Problem :theBenchmark % 58.55/58.65 % Transform :cnf % 58.55/58.65 % Format :tptp:raw % 58.55/58.65 % Command :java -jar mcs_scs.jar %d %s % 58.55/58.65 % 58.55/58.65 % Result :Theorem 58.000000s % 58.55/58.65 % Output :CNFRefutation 58.000000s % 58.55/58.65 %------------------------------------------- % 58.61/58.67 %------------------------------------------------------------------------------ % 58.61/58.67 % File : SET842-2 : TPTP v8.2.0. Released v3.2.0. % 58.61/58.67 % Domain : Set Theory % 58.61/58.67 % Problem : Problem about Zorn's lemma % 58.61/58.67 % Version : [Pau06] axioms : Reduced > Especial. % 58.61/58.67 % English : % 58.61/58.67 % 58.61/58.67 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 58.61/58.67 % Source : [Pau06] % 58.61/58.67 % Names : % 58.61/58.67 % 58.61/58.67 % Status : Unsatisfiable % 58.61/58.67 % Rating : 0.00 v7.1.0, 0.17 v7.0.0, 0.12 v6.3.0, 0.14 v6.2.0, 0.00 v4.0.0, 0.14 v3.4.0, 0.00 v3.2.0 % 58.61/58.67 % Syntax : Number of clauses : 7 ( 1 unt; 1 nHn; 6 RR) % 58.61/58.67 % Number of literals : 14 ( 0 equ; 7 neg) % 58.61/58.67 % Maximal clause size : 3 ( 2 avg) % 58.61/58.67 % Maximal term depth : 3 ( 1 avg) % 58.61/58.67 % Number of predicates : 2 ( 2 usr; 0 prp; 3-3 aty) % 58.61/58.67 % Number of functors : 7 ( 7 usr; 3 con; 0-3 aty) % 58.61/58.67 % Number of variables : 17 ( 0 sgn) % 58.61/58.67 % SPC : CNF_UNS_RFO_NEQ_NHN % 58.61/58.67 % 58.61/58.67 % Comments : The problems in the [Pau06] collection each have very many axioms, % 58.61/58.67 % of which only a small selection are required for the refutation. % 58.61/58.67 % The mission is to find those few axioms, after which a refutation % 58.61/58.67 % can be quite easily found. This version has only the necessary % 58.61/58.67 % axioms. % 58.61/58.67 %------------------------------------------------------------------------------ % 58.61/58.67 cnf(cls_conjecture_3,negated_conjecture, % 58.61/58.67 ~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))) ). % 58.61/58.67 % 58.61/58.67 cnf(cls_conjecture_4,negated_conjecture, % 58.61/58.67 ( c_lessequals(V_U,v_m,tc_set(tc_set(t_a))) % 58.61/58.67 | ~ c_in(V_U,v_Y,tc_set(tc_set(t_a))) ) ). % 58.61/58.67 % 58.61/58.67 cnf(cls_Set_OUnionE_0,axiom, % 58.61/58.67 ( ~ c_in(V_A,c_Union(V_C,T_a),T_a) % 58.61/58.67 | c_in(c_Main_OUnionE__1(V_A,V_C,T_a),V_C,tc_set(T_a)) ) ). % 58.61/58.67 % 58.61/58.67 cnf(cls_Set_OUnionE_1,axiom, % 58.61/58.67 ( ~ c_in(V_A,c_Union(V_C,T_a),T_a) % 58.61/58.67 | c_in(V_A,c_Main_OUnionE__1(V_A,V_C,T_a),T_a) ) ). % 58.61/58.67 % 58.61/58.67 cnf(cls_Set_OsubsetD_0,axiom, % 58.61/58.67 ( ~ c_in(V_c,V_A,T_a) % 58.61/58.67 | ~ c_lessequals(V_A,V_B,tc_set(T_a)) % 58.61/58.67 | c_in(V_c,V_B,T_a) ) ). % 58.61/58.67 % 58.61/58.67 cnf(cls_Set_OsubsetI_0,axiom, % 58.61/58.67 ( c_in(c_Main_OsubsetI__1(V_A,V_B,T_a),V_A,T_a) % 58.61/58.67 | c_lessequals(V_A,V_B,tc_set(T_a)) ) ). % 58.61/58.67 % 58.61/58.67 cnf(cls_Set_OsubsetI_1,axiom, % 58.61/58.67 ( ~ c_in(c_Main_OsubsetI__1(V_A,V_B,T_a),V_B,T_a) % 58.61/58.67 | c_lessequals(V_A,V_B,tc_set(T_a)) ) ). % 58.61/58.67 % 58.61/58.67 %------------------------------------------------------------------------------ % 58.61/58.67 %------------------------------------------- % 58.61/58.67 % Proof found % 58.61/58.67 % SZS status Theorem for theBenchmark % 58.61/58.67 % SZS output start Proof % 58.61/58.68 %ClaNum:7(EqnAxiom:0) % 58.61/58.68 %VarNum:45(SingletonVarNum:17) % 58.61/58.68 %MaxLitNum:3 % 58.61/58.68 %MaxfuncDepth:2 % 58.61/58.68 %SharedTerms:7 % 58.61/58.68 %goalClause: 1 2 % 58.61/58.68 %singleGoalClaCount:1 % 58.61/58.68 [1]~P1(f3(a1,f6(a2)),a7,f6(f6(a2))) % 58.61/58.68 [2]~P2(x21,a1,f6(f6(a2)))+P1(x21,a7,f6(f6(a2))) % 58.61/58.68 [3]P2(f4(x31,x32,x33),x31,x33)+P1(x31,x32,f6(x33)) % 58.61/58.68 [5]~P2(x51,f3(x52,x53),x53)+P2(x51,f5(x51,x52,x53),x53) % 58.61/58.68 [6]~P2(x61,f3(x62,x63),x63)+P2(f5(x61,x62,x63),x62,f6(x63)) % 58.61/58.68 [7]~P2(f4(x71,x72,x73),x72,x73)+P1(x71,x72,f6(x73)) % 58.61/58.68 [4]P2(x41,x42,x43)+~P2(x41,x44,x43)+~P1(x44,x42,f6(x43)) % 58.61/58.68 %EqnAxiom % 58.61/58.68 % 58.61/58.68 %------------------------------------------- % 58.61/58.69 cnf(10,plain, % 58.61/58.69 (P2(f4(f3(a1,f6(a2)),a7,f6(a2)),f3(a1,f6(a2)),f6(a2))), % 58.61/58.69 inference(scs_inference,[],[1,2,3])). % 58.61/58.69 cnf(12,plain, % 58.61/58.69 (~P2(f4(f3(a1,f6(a2)),a7,f6(a2)),a7,f6(a2))), % 58.61/58.69 inference(scs_inference,[],[1,2,3,7])). % 58.61/58.69 cnf(14,plain, % 58.61/58.69 (~P1(f5(f4(f3(a1,f6(a2)),a7,f6(a2)),a1,f6(a2)),a7,f6(f6(a2)))), % 58.61/58.69 inference(scs_inference,[],[10,12,5,4])). % 58.61/58.69 cnf(15,plain, % 58.61/58.69 (P1(f5(f4(f3(a1,f6(a2)),a7,f6(a2)),a1,f6(a2)),a7,f6(f6(a2)))), % 58.61/58.69 inference(scs_inference,[],[10,6,2])). % 58.61/58.69 cnf(26,plain, % 58.61/58.69 ($false), % 58.61/58.69 inference(scs_inference,[],[14,15]), % 58.61/58.69 ['proof']). % 58.61/58.69 % SZS output end Proof % 58.61/58.69 % Total time :58.000000s %------------------------------------------------------------------------------