%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : LAT263-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 : n024.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 10:18:27 EDT 2024 % Result : Unsatisfiable 0.60s 0.68s % Output : CNFRefutation 0.60s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : LAT263-2 : TPTP v8.2.0. Released v3.2.0. % 0.04/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.13/0.35 % Computer : n024.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 300 % 0.13/0.35 % DateTime : Fri Jun 21 21:06:24 EDT 2024 % 0.13/0.35 % CPUTime : % 0.48/0.61 start to proof:theBenchmark % 0.60/0.67 %------------------------------------------- % 0.60/0.67 % File :CSE---1.7 % 0.60/0.67 % Problem :theBenchmark % 0.60/0.67 % Transform :cnf % 0.60/0.67 % Format :tptp:raw % 0.60/0.67 % Command :java -jar mcs_scs.jar %d %s % 0.60/0.67 % 0.60/0.67 % Result :Theorem 0.010000s % 0.60/0.67 % Output :CNFRefutation 0.010000s % 0.60/0.67 %------------------------------------------- % 0.60/0.68 %------------------------------------------------------------------------------ % 0.60/0.68 % File : LAT263-2 : TPTP v8.2.0. Released v3.2.0. % 0.60/0.68 % Domain : Analysis % 0.60/0.68 % Problem : Problem about Tarski's fixed point theorem % 0.60/0.68 % Version : [Pau06] axioms : Reduced > Especial. % 0.60/0.68 % English : % 0.60/0.68 % 0.60/0.68 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.60/0.68 % Source : [Pau06] % 0.60/0.68 % Names : % 0.60/0.68 % 0.60/0.68 % Status : Unsatisfiable % 0.60/0.68 % Rating : 0.00 v5.3.0, 0.08 v5.2.0, 0.00 v4.1.0, 0.11 v4.0.1, 0.17 v3.3.0, 0.29 v3.2.0 % 0.60/0.68 % Syntax : Number of clauses : 8 ( 7 unt; 0 nHn; 6 RR) % 0.60/0.68 % Number of literals : 11 ( 3 equ; 4 neg) % 0.60/0.68 % Maximal clause size : 4 ( 1 avg) % 0.60/0.68 % Maximal term depth : 3 ( 1 avg) % 0.60/0.68 % Number of predicates : 3 ( 2 usr; 0 prp; 2-3 aty) % 0.60/0.68 % Number of functors : 13 ( 13 usr; 7 con; 0-3 aty) % 0.60/0.68 % Number of variables : 8 ( 0 sgn) % 0.60/0.68 % SPC : CNF_UNS_RFO_SEQ_HRN % 0.60/0.68 % 0.60/0.68 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.60/0.68 % of which only a small selection are required for the refutation. % 0.60/0.68 % The mission is to find those few axioms, after which a refutation % 0.60/0.68 % can be quite easily found. This version has only the necessary % 0.60/0.68 % axioms. % 0.60/0.68 %------------------------------------------------------------------------------ % 0.60/0.68 cnf(cls_conjecture_0,negated_conjecture, % 0.60/0.68 c_lessequals(v_S,v_A,tc_set(t_a)) ). % 0.60/0.68 % 0.60/0.68 cnf(cls_conjecture_1,negated_conjecture, % 0.60/0.68 ~ c_in(c_Tarski_Oglb(v_S,v_cl,t_a),v_A,t_a) ). % 0.60/0.68 % 0.60/0.68 cnf(cls_Tarski_OA_A_61_61_Apset_Acl_0,axiom, % 0.60/0.68 v_A = c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit) ). % 0.60/0.68 % 0.60/0.68 cnf(cls_Tarski_OCL_Olub__in__lattice_0,axiom, % 0.60/0.68 ( ~ c_in(V_cl,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(T_a,tc_Product__Type_Ounit)) % 0.60/0.68 | ~ c_in(V_cl,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(T_a,tc_Product__Type_Ounit)) % 0.60/0.68 | ~ c_lessequals(V_S,c_Tarski_Opotype_Opset(V_cl,T_a,tc_Product__Type_Ounit),tc_set(T_a)) % 0.60/0.68 | c_in(c_Tarski_Olub(V_S,V_cl,T_a),c_Tarski_Opotype_Opset(V_cl,T_a,tc_Product__Type_Ounit),T_a) ) ). % 0.60/0.68 % 0.60/0.68 cnf(cls_Tarski_Odual_Acl_A_58_ACompleteLattice_0,axiom, % 0.60/0.68 c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)) ). % 0.60/0.68 % 0.60/0.68 cnf(cls_Tarski_Odual_Acl_A_58_APartialOrder_0,axiom, % 0.60/0.68 c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)) ). % 0.60/0.68 % 0.60/0.68 cnf(cls_Tarski_Oglb__dual__lub_0,axiom, % 0.60/0.68 c_Tarski_Oglb(V_S,V_cl,T_a) = c_Tarski_Olub(V_S,c_Tarski_Odual(V_cl,T_a),T_a) ). % 0.60/0.68 % 0.60/0.68 cnf(cls_Tarski_Opset_A_Idual_Acl_J_A_61_61_Apset_Acl_0,axiom, % 0.60/0.68 c_Tarski_Opotype_Opset(c_Tarski_Odual(V_cl,T_a),T_a,tc_Product__Type_Ounit) = c_Tarski_Opotype_Opset(V_cl,T_a,tc_Product__Type_Ounit) ). % 0.60/0.68 % 0.60/0.68 %------------------------------------------------------------------------------ % 0.60/0.68 %------------------------------------------- % 0.60/0.68 % Proof found % 0.60/0.68 % SZS status Theorem for theBenchmark % 0.60/0.68 % SZS output start Proof % 0.60/0.68 %ClaNum:27(EqnAxiom:20) % 0.60/0.68 %VarNum:19(SingletonVarNum:5) % 0.60/0.68 %MaxLitNum:4 % 0.60/0.68 %MaxfuncDepth:2 % 0.60/0.68 %SharedTerms:17 % 0.60/0.68 %goalClause: 22 26 % 0.60/0.68 %singleGoalClaCount:2 % 0.60/0.68 [21]E(f3(a1,a2,a8),a9) % 0.60/0.68 [22]P1(a12,a9,f10(a2)) % 0.60/0.68 [23]P2(f4(a1,a2),a5,f11(a2,a8)) % 0.60/0.68 [24]P2(f4(a1,a2),a6,f11(a2,a8)) % 0.60/0.68 [26]~P2(f7(a12,f4(a1,a2),a2),a9,a2) % 0.60/0.68 [25]E(f3(f4(x251,x252),x252,a8),f3(x251,x252,a8)) % 0.60/0.68 [27]~P1(x271,f3(x272,x273,a8),f10(x273))+P2(f7(x271,x272,x273),f3(x272,x273,a8),x273)+~P2(x272,a6,f11(x273,a8))+~P2(x272,a5,f11(x273,a8)) % 0.60/0.68 %EqnAxiom % 0.60/0.68 [1]E(x11,x11) % 0.60/0.68 [2]E(x22,x21)+~E(x21,x22) % 0.60/0.68 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 0.60/0.68 [4]~E(x41,x42)+E(f3(x41,x43,x44),f3(x42,x43,x44)) % 0.60/0.68 [5]~E(x51,x52)+E(f3(x53,x51,x54),f3(x53,x52,x54)) % 0.60/0.68 [6]~E(x61,x62)+E(f3(x63,x64,x61),f3(x63,x64,x62)) % 0.60/0.68 [7]~E(x71,x72)+E(f10(x71),f10(x72)) % 0.60/0.68 [8]~E(x81,x82)+E(f4(x81,x83),f4(x82,x83)) % 0.60/0.68 [9]~E(x91,x92)+E(f4(x93,x91),f4(x93,x92)) % 0.60/0.68 [10]~E(x101,x102)+E(f11(x101,x103),f11(x102,x103)) % 0.60/0.68 [11]~E(x111,x112)+E(f11(x113,x111),f11(x113,x112)) % 0.60/0.68 [12]~E(x121,x122)+E(f7(x121,x123,x124),f7(x122,x123,x124)) % 0.60/0.68 [13]~E(x131,x132)+E(f7(x133,x131,x134),f7(x133,x132,x134)) % 0.60/0.68 [14]~E(x141,x142)+E(f7(x143,x144,x141),f7(x143,x144,x142)) % 0.60/0.68 [15]P1(x152,x153,x154)+~E(x151,x152)+~P1(x151,x153,x154) % 0.60/0.68 [16]P1(x163,x162,x164)+~E(x161,x162)+~P1(x163,x161,x164) % 0.60/0.68 [17]P1(x173,x174,x172)+~E(x171,x172)+~P1(x173,x174,x171) % 0.60/0.68 [18]P2(x182,x183,x184)+~E(x181,x182)+~P2(x181,x183,x184) % 0.60/0.68 [19]P2(x193,x192,x194)+~E(x191,x192)+~P2(x193,x191,x194) % 0.60/0.68 [20]P2(x203,x204,x202)+~E(x201,x202)+~P2(x203,x204,x201) % 0.60/0.68 % 0.60/0.68 %------------------------------------------- % 0.60/0.69 cnf(29,plain, % 0.60/0.69 (E(f3(f4(a1,a2),a2,a8),a9)), % 0.60/0.69 inference(scs_inference,[],[25,21,2,3])). % 0.60/0.69 cnf(45,plain, % 0.60/0.69 (P2(f7(a12,f4(a1,a2),a2),f3(f4(a1,a2),a2,a8),a2)), % 0.60/0.69 inference(scs_inference,[],[22,29,23,24,2,16,27])). % 0.60/0.69 cnf(58,plain, % 0.60/0.69 ($false), % 0.60/0.69 inference(scs_inference,[],[26,29,21,45,2,19]), % 0.60/0.69 ['proof']). % 0.60/0.69 % SZS output end Proof % 0.60/0.69 % Total time :0.010000s %------------------------------------------------------------------------------