%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SET855-2 : TPTP v8.2.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox2/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 14:22:46 EDT 2024 % Result : Unsatisfiable 0.14s 0.55s % Output : CNFRefutation 0.14s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.10 % Problem : SET855-2 : TPTP v8.2.0. Released v3.2.0. % 0.00/0.10 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.09/0.29 % Computer : n027.cluster.edu % 0.09/0.29 % Model : x86_64 x86_64 % 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.09/0.29 % Memory : 8042.1875MB % 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64 % 0.09/0.29 % CPULimit : 300 % 0.09/0.29 % WCLimit : 300 % 0.09/0.29 % DateTime : Sun Jun 23 14:13:39 EDT 2024 % 0.09/0.29 % CPUTime : % 0.14/0.52 start to proof:theBenchmark % 0.14/0.54 %------------------------------------------- % 0.14/0.54 % File :CSE---1.7 % 0.14/0.54 % Problem :theBenchmark % 0.14/0.54 % Transform :cnf % 0.14/0.54 % Format :tptp:raw % 0.14/0.54 % Command :java -jar mcs_scs.jar %d %s % 0.14/0.54 % 0.14/0.54 % Result :Theorem 0.000000s % 0.14/0.54 % Output :CNFRefutation 0.000000s % 0.14/0.54 %------------------------------------------- % 0.14/0.55 %------------------------------------------------------------------------------ % 0.14/0.55 % File : SET855-2 : TPTP v8.2.0. Released v3.2.0. % 0.14/0.55 % Domain : Set Theory % 0.14/0.55 % Problem : Problem about Zorn's lemma % 0.14/0.55 % Version : [Pau06] axioms : Reduced > Especial. % 0.14/0.55 % English : % 0.14/0.55 % 0.14/0.55 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.14/0.55 % Source : [Pau06] % 0.14/0.55 % Names : % 0.14/0.55 % 0.14/0.55 % Status : Unsatisfiable % 0.14/0.55 % Rating : 0.00 v5.5.0, 0.06 v5.4.0, 0.00 v5.3.0, 0.08 v5.2.0, 0.00 v5.1.0, 0.14 v4.1.0, 0.22 v4.0.1, 0.33 v3.7.0, 0.17 v3.3.0, 0.14 v3.2.0 % 0.14/0.55 % Syntax : Number of clauses : 4 ( 3 unt; 0 nHn; 4 RR) % 0.14/0.55 % Number of literals : 6 ( 2 equ; 3 neg) % 0.14/0.55 % Maximal clause size : 3 ( 1 avg) % 0.14/0.55 % Maximal term depth : 3 ( 2 avg) % 0.14/0.55 % Number of predicates : 2 ( 1 usr; 0 prp; 2-3 aty) % 0.14/0.55 % Number of functors : 5 ( 5 usr; 3 con; 0-2 aty) % 0.14/0.55 % Number of variables : 3 ( 0 sgn) % 0.14/0.55 % SPC : CNF_UNS_RFO_SEQ_HRN % 0.14/0.55 % 0.14/0.55 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.14/0.55 % of which only a small selection are required for the refutation. % 0.14/0.55 % The mission is to find those few axioms, after which a refutation % 0.14/0.55 % can be quite easily found. This version has only the necessary % 0.14/0.55 % axioms. % 0.14/0.55 %------------------------------------------------------------------------------ % 0.14/0.55 cnf(cls_Set_Osubset__antisym_0,axiom, % 0.14/0.55 ( ~ c_lessequals(V_B,V_A,tc_set(T_a)) % 0.14/0.55 | ~ c_lessequals(V_A,V_B,tc_set(T_a)) % 0.14/0.55 | V_A = V_B ) ). % 0.14/0.55 % 0.14/0.55 cnf(cls_conjecture_2,negated_conjecture, % 0.14/0.55 c_lessequals(v_n,c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))) ). % 0.14/0.55 % 0.14/0.55 cnf(cls_conjecture_3,negated_conjecture, % 0.14/0.55 c_lessequals(c_Union(v_Y,tc_set(t_a)),v_n,tc_set(tc_set(t_a))) ). % 0.14/0.55 % 0.14/0.55 cnf(cls_conjecture_4,negated_conjecture, % 0.14/0.55 v_n != c_Union(v_Y,tc_set(t_a)) ). % 0.14/0.55 % 0.14/0.55 %------------------------------------------------------------------------------ % 0.14/0.55 %------------------------------------------- % 0.14/0.55 % Proof found % 0.14/0.55 % SZS status Theorem for theBenchmark % 0.14/0.55 % SZS output start Proof % 0.14/0.55 %ClaNum:13(EqnAxiom:9) % 0.14/0.55 %VarNum:8(SingletonVarNum:3) % 0.14/0.55 %MaxLitNum:3 % 0.14/0.55 %MaxfuncDepth:2 % 0.14/0.55 %SharedTerms:9 % 0.14/0.55 %goalClause: 10 11 12 % 0.14/0.55 %singleGoalClaCount:3 % 0.14/0.55 [10]P1(a1,f4(a2,f5(a3)),f5(f5(a3))) % 0.14/0.55 [11]P1(f4(a2,f5(a3)),a1,f5(f5(a3))) % 0.14/0.55 [12]~E(f4(a2,f5(a3)),a1) % 0.14/0.55 [13]E(x131,x132)+~P1(x132,x131,f5(x133))+~P1(x131,x132,f5(x133)) % 0.14/0.55 %EqnAxiom % 0.14/0.55 [1]E(x11,x11) % 0.14/0.55 [2]E(x22,x21)+~E(x21,x22) % 0.14/0.55 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 0.14/0.55 [4]~E(x41,x42)+E(f5(x41),f5(x42)) % 0.14/0.55 [5]~E(x51,x52)+E(f4(x51,x53),f4(x52,x53)) % 0.14/0.55 [6]~E(x61,x62)+E(f4(x63,x61),f4(x63,x62)) % 0.14/0.55 [7]P1(x72,x73,x74)+~E(x71,x72)+~P1(x71,x73,x74) % 0.14/0.55 [8]P1(x83,x82,x84)+~E(x81,x82)+~P1(x83,x81,x84) % 0.14/0.55 [9]P1(x93,x94,x92)+~E(x91,x92)+~P1(x93,x94,x91) % 0.14/0.55 % 0.14/0.55 %------------------------------------------- % 0.14/0.55 cnf(14,plain, % 0.14/0.55 ($false), % 0.14/0.55 inference(scs_inference,[],[12,10,11,13]), % 0.14/0.55 ['proof']). % 0.14/0.55 % SZS output end Proof % 0.14/0.55 % Total time :0.000000s %------------------------------------------------------------------------------