%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SET859-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:48 EDT 2024 % Result : Unsatisfiable 0.48s 0.59s % Output : CNFRefutation 0.48s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SET859-2 : TPTP v8.2.0. Released v3.2.0. % 0.07/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.11/0.32 % Computer : n029.cluster.edu % 0.11/0.32 % Model : x86_64 x86_64 % 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.32 % Memory : 8042.1875MB % 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.32 % CPULimit : 300 % 0.11/0.32 % WCLimit : 300 % 0.11/0.32 % DateTime : Sun Jun 23 18:10:09 EDT 2024 % 0.11/0.32 % CPUTime : % 0.48/0.55 start to proof:theBenchmark % 0.48/0.58 %------------------------------------------- % 0.48/0.58 % File :CSE---1.7 % 0.48/0.58 % Problem :theBenchmark % 0.48/0.58 % Transform :cnf % 0.48/0.58 % Format :tptp:raw % 0.48/0.58 % Command :java -jar mcs_scs.jar %d %s % 0.48/0.58 % 0.48/0.58 % Result :Theorem 0.000000s % 0.48/0.58 % Output :CNFRefutation 0.000000s % 0.48/0.58 %------------------------------------------- % 0.48/0.58 %------------------------------------------------------------------------------ % 0.48/0.58 % File : SET859-2 : TPTP v8.2.0. Released v3.2.0. % 0.48/0.58 % Domain : Set Theory % 0.48/0.58 % Problem : Problem about Zorn's lemma % 0.48/0.58 % Version : [Pau06] axioms : Reduced > Especial. % 0.48/0.58 % English : % 0.48/0.58 % 0.48/0.58 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.48/0.58 % Source : [Pau06] % 0.48/0.58 % Names : % 0.48/0.58 % 0.48/0.58 % Status : Unsatisfiable % 0.48/0.58 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.05 v5.2.0, 0.00 v3.2.0 % 0.48/0.58 % Syntax : Number of clauses : 4 ( 3 unt; 0 nHn; 3 RR) % 0.48/0.58 % Number of literals : 6 ( 0 equ; 3 neg) % 0.48/0.58 % Maximal clause size : 3 ( 1 avg) % 0.48/0.58 % Maximal term depth : 3 ( 1 avg) % 0.48/0.58 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty) % 0.48/0.58 % Number of functors : 6 ( 6 usr; 4 con; 0-3 aty) % 0.48/0.58 % Number of variables : 7 ( 1 sgn) % 0.48/0.58 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.48/0.58 % 0.48/0.58 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.48/0.58 % of which only a small selection are required for the refutation. % 0.48/0.58 % The mission is to find those few axioms, after which a refutation % 0.48/0.58 % can be quite easily found. This version has only the necessary % 0.48/0.59 % axioms. % 0.48/0.59 %------------------------------------------------------------------------------ % 0.48/0.59 cnf(cls_Set_Osubset__trans_0,axiom, % 0.48/0.59 ( ~ c_lessequals(V_B,V_C,tc_set(T_a)) % 0.48/0.59 | ~ c_lessequals(V_A,V_B,tc_set(T_a)) % 0.48/0.59 | c_lessequals(V_A,V_C,tc_set(T_a)) ) ). % 0.48/0.59 % 0.48/0.59 cnf(cls_Zorn_OAbrial__axiom1_0,axiom, % 0.48/0.59 c_lessequals(V_x,c_Zorn_Osucc(V_S,V_x,T_a),tc_set(tc_set(T_a))) ). % 0.48/0.59 % 0.48/0.59 cnf(cls_conjecture_2,negated_conjecture, % 0.48/0.59 c_lessequals(c_Zorn_Osucc(v_S,v_n,t_a),v_m,tc_set(tc_set(t_a))) ). % 0.48/0.59 % 0.48/0.59 cnf(cls_conjecture_3,negated_conjecture, % 0.48/0.59 ~ c_lessequals(v_n,v_m,tc_set(tc_set(t_a))) ). % 0.48/0.59 % 0.48/0.59 %------------------------------------------------------------------------------ % 0.48/0.59 %------------------------------------------- % 0.48/0.59 % Proof found % 0.48/0.59 % SZS status Theorem for theBenchmark % 0.48/0.59 % SZS output start Proof % 0.48/0.59 %ClaNum:4(EqnAxiom:0) % 0.48/0.59 %VarNum:14(SingletonVarNum:7) % 0.48/0.59 %MaxLitNum:3 % 0.48/0.59 %MaxfuncDepth:2 % 0.48/0.59 %SharedTerms:9 % 0.48/0.59 %goalClause: 1 3 % 0.48/0.59 %singleGoalClaCount:2 % 0.48/0.59 [1]P1(f3(a1,a5,a2),a6,f4(f4(a2))) % 0.48/0.59 [3]~P1(a5,a6,f4(f4(a2))) % 0.48/0.59 [2]P1(x21,f3(x22,x21,x23),f4(f4(x23))) % 0.48/0.59 [4]P1(x41,x42,f4(x43))+~P1(x44,x42,f4(x43))+~P1(x41,x44,f4(x43)) % 0.48/0.59 %EqnAxiom % 0.48/0.59 % 0.48/0.59 %------------------------------------------- % 0.48/0.59 cnf(5,plain, % 0.48/0.59 ($false), % 0.48/0.59 inference(scs_inference,[],[3,1,2,4]), % 0.48/0.59 ['proof']). % 0.48/0.59 % SZS output end Proof % 0.48/0.59 % Total time :0.000000s %------------------------------------------------------------------------------