TSTP Solution File: LAT268-2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : LAT268-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n016.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 : Thu Aug 31 05:57:55 EDT 2023
% Result : Unsatisfiable 0.20s 0.61s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LAT268-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.16/0.34 % Computer : n016.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Thu Aug 24 05:31:38 EDT 2023
% 0.16/0.34 % CPUTime :
% 0.20/0.53 start to proof:theBenchmark
% 0.20/0.61 %-------------------------------------------
% 0.20/0.61 % File :CSE---1.6
% 0.20/0.61 % Problem :theBenchmark
% 0.20/0.61 % Transform :cnf
% 0.20/0.61 % Format :tptp:raw
% 0.20/0.61 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.61
% 0.20/0.61 % Result :Theorem 0.020000s
% 0.20/0.61 % Output :CNFRefutation 0.020000s
% 0.20/0.61 %-------------------------------------------
% 0.20/0.61 %------------------------------------------------------------------------------
% 0.20/0.61 % File : LAT268-2 : TPTP v8.1.2. Released v3.2.0.
% 0.20/0.61 % Domain : Analysis
% 0.20/0.61 % Problem : Problem about Tarski's fixed point theorem
% 0.20/0.61 % Version : [Pau06] axioms : Reduced > Especial.
% 0.20/0.61 % English :
% 0.20/0.61
% 0.20/0.61 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.20/0.61 % Source : [Pau06]
% 0.20/0.61 % Names :
% 0.20/0.61
% 0.20/0.61 % Status : Unsatisfiable
% 0.20/0.61 % Rating : 0.00 v5.5.0, 0.06 v5.4.0, 0.07 v5.3.0, 0.17 v5.2.0, 0.00 v4.1.0, 0.11 v4.0.1, 0.17 v3.3.0, 0.14 v3.2.0
% 0.20/0.61 % Syntax : Number of clauses : 11 ( 9 unt; 0 nHn; 9 RR)
% 0.20/0.61 % Number of literals : 16 ( 4 equ; 6 neg)
% 0.20/0.61 % Maximal clause size : 5 ( 1 avg)
% 0.20/0.61 % Maximal term depth : 3 ( 1 avg)
% 0.20/0.61 % Number of predicates : 3 ( 2 usr; 0 prp; 2-3 aty)
% 0.20/0.61 % Number of functors : 18 ( 18 usr; 9 con; 0-4 aty)
% 0.20/0.61 % Number of variables : 13 ( 0 sgn)
% 0.20/0.61 % SPC : CNF_UNS_RFO_SEQ_HRN
% 0.20/0.61
% 0.20/0.61 % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.20/0.61 % of which only a small selection are required for the refutation.
% 0.20/0.61 % The mission is to find those few axioms, after which a refutation
% 0.20/0.61 % can be quite easily found. This version has only the necessary
% 0.20/0.61 % axioms.
% 0.20/0.61 %------------------------------------------------------------------------------
% 0.20/0.61 cnf(cls_conjecture_0,negated_conjecture,
% 0.20/0.61 c_lessequals(v_S,v_A,tc_set(t_a)) ).
% 0.20/0.61
% 0.20/0.61 cnf(cls_conjecture_1,negated_conjecture,
% 0.20/0.61 c_in(v_x,v_S,t_a) ).
% 0.20/0.61
% 0.20/0.61 cnf(cls_conjecture_2,negated_conjecture,
% 0.20/0.61 ~ c_in(c_Pair(c_Tarski_Oglb(v_S,v_cl,t_a),v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)) ).
% 0.20/0.61
% 0.20/0.61 cnf(cls_Tarski_OA_A_61_61_Apset_Acl_0,axiom,
% 0.20/0.61 v_A = c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit) ).
% 0.20/0.61
% 0.20/0.61 cnf(cls_Tarski_OCL_Olub__upper_0,axiom,
% 0.20/0.61 ( ~ c_in(V_x,V_S,T_a)
% 0.20/0.61 | ~ c_in(V_cl,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(T_a,tc_Product__Type_Ounit))
% 0.20/0.61 | ~ c_in(V_cl,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(T_a,tc_Product__Type_Ounit))
% 0.20/0.61 | ~ c_lessequals(V_S,c_Tarski_Opotype_Opset(V_cl,T_a,tc_Product__Type_Ounit),tc_set(T_a))
% 0.20/0.61 | c_in(c_Pair(V_x,c_Tarski_Olub(V_S,V_cl,T_a),T_a,T_a),c_Tarski_Opotype_Oorder(V_cl,T_a,tc_Product__Type_Ounit),tc_prod(T_a,T_a)) ) ).
% 0.20/0.61
% 0.20/0.61 cnf(cls_Tarski_O_Ix1_M_Ay1_J_A_58_Aorder_A_Idual_Acl_J_A_61_61_A_Iy1_M_Ax1_J_A_58_Aorder_Acl_0,axiom,
% 0.20/0.61 ( ~ c_in(c_Pair(V_x,V_y,T_a,T_a),c_Tarski_Opotype_Oorder(c_Tarski_Odual(V_cl,T_a),T_a,tc_Product__Type_Ounit),tc_prod(T_a,T_a))
% 0.20/0.61 | c_in(c_Pair(V_y,V_x,T_a,T_a),c_Tarski_Opotype_Oorder(V_cl,T_a,tc_Product__Type_Ounit),tc_prod(T_a,T_a)) ) ).
% 0.20/0.61
% 0.20/0.61 cnf(cls_Tarski_Odual_Acl_A_58_ACompleteLattice_0,axiom,
% 0.20/0.61 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.20/0.61
% 0.20/0.61 cnf(cls_Tarski_Odual_Acl_A_58_APartialOrder_0,axiom,
% 0.20/0.61 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.20/0.61
% 0.20/0.61 cnf(cls_Tarski_Oglb__dual__lub_0,axiom,
% 0.20/0.61 c_Tarski_Oglb(V_S,V_cl,T_a) = c_Tarski_Olub(V_S,c_Tarski_Odual(V_cl,T_a),T_a) ).
% 0.20/0.61
% 0.20/0.61 cnf(cls_Tarski_Opset_A_Idual_Acl_J_A_61_61_Apset_Acl_0,axiom,
% 0.20/0.61 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.20/0.61
% 0.20/0.61 cnf(cls_Tarski_Or_A_61_61_Aorder_Acl_0,axiom,
% 0.20/0.61 v_r = c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit) ).
% 0.20/0.61
% 0.20/0.61 %------------------------------------------------------------------------------
% 0.20/0.61 %-------------------------------------------
% 0.20/0.61 % Proof found
% 0.20/0.61 % SZS status Theorem for theBenchmark
% 0.20/0.61 % SZS output start Proof
% 0.20/0.61 %ClaNum:39(EqnAxiom:29)
% 0.20/0.61 %VarNum:43(SingletonVarNum:10)
% 0.20/0.61 %MaxLitNum:5
% 0.20/0.61 %MaxfuncDepth:3
% 0.20/0.61 %SharedTerms:24
% 0.20/0.61 %goalClause: 32 33 37
% 0.20/0.61 %singleGoalClaCount:3
% 0.20/0.61 [32]P1(a17,a15,a2)
% 0.20/0.61 [30]E(f3(a1,a2,a10),a11)
% 0.20/0.61 [31]E(f4(a1,a2,a10),a16)
% 0.20/0.61 [33]P2(a15,a11,f12(a2))
% 0.20/0.61 [34]P1(f5(a1,a2),a6,f13(a2,a10))
% 0.20/0.61 [35]P1(f5(a1,a2),a8,f13(a2,a10))
% 0.20/0.61 [37]~P1(f7(f9(a15,f5(a1,a2),a2),a17,a2,a2),a16,f14(a2,a2))
% 0.20/0.61 [36]E(f3(f5(x361,x362),x362,a10),f3(x361,x362,a10))
% 0.20/0.61 [39]P1(f7(x391,x392,x393,x393),f4(x394,x393,a10),f14(x393,x393))+~P1(f7(x392,x391,x393,x393),f4(f5(x394,x393),x393,a10),f14(x393,x393))
% 0.20/0.61 [38]~P1(x381,x382,x384)+~P2(x382,f3(x383,x384,a10),f12(x384))+~P1(x383,a8,f13(x384,a10))+P1(f7(x381,f9(x382,x383,x384),x384,x384),f4(x383,x384,a10),f14(x384,x384))+~P1(x383,a6,f13(x384,a10))
% 0.20/0.61 %EqnAxiom
% 0.20/0.61 [1]E(x11,x11)
% 0.20/0.61 [2]E(x22,x21)+~E(x21,x22)
% 0.20/0.61 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.20/0.61 [4]~E(x41,x42)+E(f3(x41,x43,x44),f3(x42,x43,x44))
% 0.20/0.61 [5]~E(x51,x52)+E(f3(x53,x51,x54),f3(x53,x52,x54))
% 0.20/0.61 [6]~E(x61,x62)+E(f3(x63,x64,x61),f3(x63,x64,x62))
% 0.20/0.61 [7]~E(x71,x72)+E(f4(x71,x73,x74),f4(x72,x73,x74))
% 0.20/0.61 [8]~E(x81,x82)+E(f4(x83,x81,x84),f4(x83,x82,x84))
% 0.20/0.61 [9]~E(x91,x92)+E(f4(x93,x94,x91),f4(x93,x94,x92))
% 0.20/0.61 [10]~E(x101,x102)+E(f12(x101),f12(x102))
% 0.20/0.61 [11]~E(x111,x112)+E(f5(x111,x113),f5(x112,x113))
% 0.20/0.61 [12]~E(x121,x122)+E(f5(x123,x121),f5(x123,x122))
% 0.20/0.61 [13]~E(x131,x132)+E(f13(x131,x133),f13(x132,x133))
% 0.20/0.61 [14]~E(x141,x142)+E(f13(x143,x141),f13(x143,x142))
% 0.20/0.61 [15]~E(x151,x152)+E(f7(x151,x153,x154,x155),f7(x152,x153,x154,x155))
% 0.20/0.61 [16]~E(x161,x162)+E(f7(x163,x161,x164,x165),f7(x163,x162,x164,x165))
% 0.20/0.61 [17]~E(x171,x172)+E(f7(x173,x174,x171,x175),f7(x173,x174,x172,x175))
% 0.20/0.61 [18]~E(x181,x182)+E(f7(x183,x184,x185,x181),f7(x183,x184,x185,x182))
% 0.20/0.61 [19]~E(x191,x192)+E(f14(x191,x193),f14(x192,x193))
% 0.20/0.61 [20]~E(x201,x202)+E(f14(x203,x201),f14(x203,x202))
% 0.20/0.61 [21]~E(x211,x212)+E(f9(x211,x213,x214),f9(x212,x213,x214))
% 0.20/0.61 [22]~E(x221,x222)+E(f9(x223,x221,x224),f9(x223,x222,x224))
% 0.20/0.61 [23]~E(x231,x232)+E(f9(x233,x234,x231),f9(x233,x234,x232))
% 0.20/0.61 [24]P1(x242,x243,x244)+~E(x241,x242)+~P1(x241,x243,x244)
% 0.20/0.61 [25]P1(x253,x252,x254)+~E(x251,x252)+~P1(x253,x251,x254)
% 0.20/0.61 [26]P1(x263,x264,x262)+~E(x261,x262)+~P1(x263,x264,x261)
% 0.20/0.61 [27]P2(x272,x273,x274)+~E(x271,x272)+~P2(x271,x273,x274)
% 0.20/0.61 [28]P2(x283,x282,x284)+~E(x281,x282)+~P2(x283,x281,x284)
% 0.20/0.61 [29]P2(x293,x294,x292)+~E(x291,x292)+~P2(x293,x294,x291)
% 0.20/0.61
% 0.20/0.61 %-------------------------------------------
% 0.20/0.62 cnf(42,plain,
% 0.20/0.62 (E(f3(f5(a1,a2),a2,a10),a11)),
% 0.20/0.62 inference(scs_inference,[],[33,30,36,2,28,3])).
% 0.20/0.62 cnf(49,plain,
% 0.20/0.62 (E(f7(x491,x492,x493,f3(a1,a2,a10)),f7(x491,x492,x493,a11))),
% 0.20/0.62 inference(scs_inference,[],[33,30,36,2,28,3,23,22,21,20,19,18])).
% 0.20/0.62 cnf(50,plain,
% 0.20/0.62 (E(f7(x501,x502,f3(a1,a2,a10),x503),f7(x501,x502,a11,x503))),
% 0.20/0.62 inference(scs_inference,[],[33,30,36,2,28,3,23,22,21,20,19,18,17])).
% 0.20/0.62 cnf(65,plain,
% 0.20/0.62 (~P1(f7(f9(a15,f5(a1,a2),a2),a17,a2,a2),f4(a1,a2,a10),f14(a2,a2))),
% 0.20/0.62 inference(scs_inference,[],[33,30,31,37,36,2,28,3,23,22,21,20,19,18,17,16,15,14,13,12,11,10,9,8,7,6,5,4,26,25])).
% 0.20/0.62 cnf(78,plain,
% 0.20/0.62 (~P2(a15,f3(f5(a1,a2),a2,a10),f12(a2))),
% 0.20/0.62 inference(scs_inference,[],[32,31,35,34,49,50,65,39,28,3,38])).
% 0.20/0.62 cnf(91,plain,
% 0.20/0.62 ($false),
% 0.20/0.62 inference(scs_inference,[],[33,36,78,42,28,3,2]),
% 0.20/0.62 ['proof']).
% 0.20/0.62 % SZS output end Proof
% 0.20/0.62 % Total time :0.020000s
%------------------------------------------------------------------------------