%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SET852-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 : n017.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:45 EDT 2024 % Result : Unsatisfiable 0.52s 0.60s % Output : CNFRefutation 0.52s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.10 % Problem : SET852-2 : TPTP v8.2.0. Released v3.2.0. % 0.03/0.11 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.10/0.31 % Computer : n017.cluster.edu % 0.10/0.31 % Model : x86_64 x86_64 % 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.10/0.31 % Memory : 8042.1875MB % 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 % 0.10/0.31 % CPULimit : 300 % 0.10/0.31 % WCLimit : 300 % 0.10/0.31 % DateTime : Sun Jun 23 13:20:38 EDT 2024 % 0.16/0.31 % CPUTime : % 0.51/0.56 start to proof:theBenchmark % 0.52/0.59 %------------------------------------------- % 0.52/0.59 % File :CSE---1.7 % 0.52/0.59 % Problem :theBenchmark % 0.52/0.59 % Transform :cnf % 0.52/0.59 % Format :tptp:raw % 0.52/0.59 % Command :java -jar mcs_scs.jar %d %s % 0.52/0.59 % 0.52/0.59 % Result :Theorem 0.000000s % 0.52/0.59 % Output :CNFRefutation 0.000000s % 0.52/0.59 %------------------------------------------- % 0.52/0.60 %------------------------------------------------------------------------------ % 0.52/0.60 % File : SET852-2 : TPTP v8.2.0. Released v3.2.0. % 0.52/0.60 % Domain : Set Theory % 0.52/0.60 % Problem : Problem about Zorn's lemma % 0.52/0.60 % Version : [Pau06] axioms : Reduced > Especial. % 0.52/0.60 % English : % 0.52/0.60 % 0.52/0.60 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.52/0.60 % Source : [Pau06] % 0.52/0.60 % Names : % 0.52/0.60 % 0.52/0.60 % Status : Unsatisfiable % 0.52/0.60 % Rating : 0.00 v6.3.0, 0.14 v6.2.0, 0.00 v4.0.0, 0.14 v3.4.0, 0.00 v3.2.0 % 0.52/0.60 % Syntax : Number of clauses : 6 ( 2 unt; 4 nHn; 5 RR) % 0.52/0.60 % Number of literals : 14 ( 0 equ; 5 neg) % 0.52/0.60 % Maximal clause size : 3 ( 2 avg) % 0.52/0.60 % Maximal term depth : 3 ( 1 avg) % 0.52/0.60 % Number of predicates : 2 ( 2 usr; 0 prp; 3-3 aty) % 0.52/0.60 % Number of functors : 8 ( 8 usr; 4 con; 0-4 aty) % 0.52/0.60 % Number of variables : 13 ( 0 sgn) % 0.52/0.60 % SPC : CNF_UNS_RFO_NEQ_NHN % 0.52/0.60 % 0.52/0.60 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.52/0.60 % of which only a small selection are required for the refutation. % 0.52/0.60 % The mission is to find those few axioms, after which a refutation % 0.52/0.60 % can be quite easily found. This version has only the necessary % 0.52/0.60 % axioms. % 0.52/0.60 %------------------------------------------------------------------------------ % 0.52/0.60 cnf(cls_conjecture_2,negated_conjecture, % 0.52/0.60 ~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))) ). % 0.52/0.60 % 0.52/0.60 cnf(cls_conjecture_3,negated_conjecture, % 0.52/0.60 ~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))) ). % 0.52/0.60 % 0.52/0.60 cnf(cls_conjecture_4,negated_conjecture, % 0.52/0.60 ( c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),V_U,tc_set(tc_set(t_a))) % 0.52/0.60 | c_lessequals(V_U,v_m,tc_set(tc_set(t_a))) % 0.52/0.60 | ~ c_in(V_U,v_Y,tc_set(tc_set(t_a))) ) ). % 0.52/0.60 % 0.52/0.60 cnf(cls_Zorn_OUnion__lemma0_0,axiom, % 0.52/0.60 ( c_in(c_Zorn_OUnion__lemma0__1(V_A,V_B,V_C,T_a),V_C,tc_set(T_a)) % 0.52/0.60 | c_lessequals(V_B,c_Union(V_C,T_a),tc_set(T_a)) % 0.52/0.60 | c_lessequals(c_Union(V_C,T_a),V_A,tc_set(T_a)) ) ). % 0.52/0.60 % 0.52/0.60 cnf(cls_Zorn_OUnion__lemma0_1,axiom, % 0.52/0.60 ( ~ c_lessequals(c_Zorn_OUnion__lemma0__1(V_A,V_B,V_C,T_a),V_A,tc_set(T_a)) % 0.52/0.60 | c_lessequals(V_B,c_Union(V_C,T_a),tc_set(T_a)) % 0.52/0.60 | c_lessequals(c_Union(V_C,T_a),V_A,tc_set(T_a)) ) ). % 0.52/0.60 % 0.52/0.60 cnf(cls_Zorn_OUnion__lemma0_2,axiom, % 0.52/0.60 ( ~ c_lessequals(V_B,c_Zorn_OUnion__lemma0__1(V_A,V_B,V_C,T_a),tc_set(T_a)) % 0.52/0.60 | c_lessequals(V_B,c_Union(V_C,T_a),tc_set(T_a)) % 0.52/0.60 | c_lessequals(c_Union(V_C,T_a),V_A,tc_set(T_a)) ) ). % 0.52/0.60 % 0.52/0.60 %------------------------------------------------------------------------------ % 0.52/0.60 %------------------------------------------- % 0.52/0.60 % Proof found % 0.52/0.60 % SZS status Theorem for theBenchmark % 0.52/0.60 % SZS output start Proof % 0.52/0.60 %ClaNum:6(EqnAxiom:0) % 0.52/0.60 %VarNum:45(SingletonVarNum:13) % 0.52/0.60 %MaxLitNum:3 % 0.52/0.60 %MaxfuncDepth:2 % 0.52/0.60 %SharedTerms:10 % 0.52/0.60 %goalClause: 1 2 3 % 0.52/0.60 %singleGoalClaCount:2 % 0.52/0.60 [1]~P1(f3(a1,f6(a2)),a8,f6(f6(a2))) % 0.52/0.60 [2]~P1(f4(a7,a8,a2),f3(a1,f6(a2)),f6(f6(a2))) % 0.52/0.60 [3]P1(f4(a7,a8,a2),x31,f6(f6(a2)))+~P2(x31,a1,f6(f6(a2)))+P1(x31,a8,f6(f6(a2))) % 0.52/0.60 [4]P2(f5(x44,x41,x42,x43),x42,f6(x43))+P1(x41,f3(x42,x43),f6(x43))+P1(f3(x42,x43),x44,f6(x43)) % 0.52/0.60 [5]~P1(x51,f5(x54,x51,x52,x53),f6(x53))+P1(x51,f3(x52,x53),f6(x53))+P1(f3(x52,x53),x54,f6(x53)) % 0.52/0.60 [6]~P1(f5(x64,x61,x62,x63),x64,f6(x63))+P1(x61,f3(x62,x63),f6(x63))+P1(f3(x62,x63),x64,f6(x63)) % 0.52/0.60 %EqnAxiom % 0.52/0.60 % 0.52/0.60 %------------------------------------------- % 0.52/0.61 cnf(13,plain, % 0.52/0.61 ($false), % 0.52/0.61 inference(scs_inference,[],[1,2,4,5,6,3]), % 0.52/0.61 ['proof']). % 0.52/0.61 % SZS output end Proof % 0.52/0.61 % Total time :0.000000s %------------------------------------------------------------------------------