TSTP Solution File: SET864-2 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : SET864-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% Computer : n015.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 14:31:30 EDT 2023
% Result : Unsatisfiable 0.20s 0.62s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET864-2 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat Aug 26 15:15:08 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.57 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.000000s
% 0.20/0.61 % Output :CNFRefutation 0.000000s
% 0.20/0.61 %-------------------------------------------
% 0.20/0.62 %------------------------------------------------------------------------------
% 0.20/0.62 % File : SET864-2 : TPTP v8.1.2. Released v3.2.0.
% 0.20/0.62 % Domain : Set Theory
% 0.20/0.62 % Problem : Problem about Zorn's lemma
% 0.20/0.62 % Version : [Pau06] axioms : Reduced > Especial.
% 0.20/0.62 % English :
% 0.20/0.62
% 0.20/0.62 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe
% 0.20/0.62 % Source : [Pau06]
% 0.20/0.62 % Names :
% 0.20/0.62
% 0.20/0.62 % Status : Unsatisfiable
% 0.20/0.62 % 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.14 v3.2.0
% 0.20/0.62 % Syntax : Number of clauses : 6 ( 2 unt; 0 nHn; 6 RR)
% 0.20/0.62 % Number of literals : 12 ( 2 equ; 7 neg)
% 0.20/0.62 % Maximal clause size : 4 ( 2 avg)
% 0.20/0.62 % Maximal term depth : 3 ( 1 avg)
% 0.20/0.62 % Number of predicates : 3 ( 2 usr; 0 prp; 2-3 aty)
% 0.20/0.62 % Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% 0.20/0.62 % Number of variables : 7 ( 0 sgn)
% 0.20/0.62 % SPC : CNF_UNS_RFO_SEQ_HRN
% 0.20/0.62
% 0.20/0.62 % Comments : The problems in the [Pau06] collection each have very many axioms,
% 0.20/0.62 % of which only a small selection are required for the refutation.
% 0.20/0.62 % The mission is to find those few axioms, after which a refutation
% 0.20/0.62 % can be quite easily found. This version has only the necessary
% 0.20/0.62 % axioms.
% 0.20/0.62 %------------------------------------------------------------------------------
% 0.20/0.62 cnf(cls_Zorn_Omaxchain__Zorn_0,axiom,
% 0.20/0.62 ( ~ c_in(V_u,V_S,tc_set(T_a))
% 0.20/0.62 | ~ c_in(V_c,c_Zorn_Omaxchain(V_S,T_a),tc_set(tc_set(T_a)))
% 0.20/0.62 | ~ c_lessequals(c_Union(V_c,T_a),V_u,tc_set(T_a))
% 0.20/0.62 | c_Union(V_c,T_a) = V_u ) ).
% 0.20/0.62
% 0.20/0.62 cnf(cls_conjecture_0,negated_conjecture,
% 0.20/0.62 c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))) ).
% 0.20/0.62
% 0.20/0.62 cnf(cls_conjecture_2,negated_conjecture,
% 0.20/0.62 c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)) ).
% 0.20/0.62
% 0.20/0.62 cnf(cls_conjecture_3,negated_conjecture,
% 0.20/0.62 ( c_in(v_x(V_U),v_S,tc_set(t_a))
% 0.20/0.62 | ~ c_in(V_U,v_S,tc_set(t_a)) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(cls_conjecture_4,negated_conjecture,
% 0.20/0.62 ( c_lessequals(V_U,v_x(V_U),tc_set(t_a))
% 0.20/0.62 | ~ c_in(V_U,v_S,tc_set(t_a)) ) ).
% 0.20/0.62
% 0.20/0.62 cnf(cls_conjecture_5,negated_conjecture,
% 0.20/0.62 ( V_U != v_x(V_U)
% 0.20/0.62 | ~ c_in(V_U,v_S,tc_set(t_a)) ) ).
% 0.20/0.62
% 0.20/0.62 %------------------------------------------------------------------------------
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 % Proof found
% 0.20/0.62 % SZS status Theorem for theBenchmark
% 0.20/0.62 % SZS output start Proof
% 0.20/0.62 %ClaNum:21(EqnAxiom:15)
% 0.20/0.62 %VarNum:22(SingletonVarNum:7)
% 0.20/0.62 %MaxLitNum:4
% 0.20/0.62 %MaxfuncDepth:2
% 0.20/0.62 %SharedTerms:9
% 0.20/0.62 %goalClause: 16 17 18 19 20
% 0.20/0.62 %singleGoalClaCount:2
% 0.20/0.62 [16]P1(f3(a1,a2),a5,f6(a2))
% 0.20/0.62 [17]P1(a1,f4(a5,a2),f6(f6(a2)))
% 0.20/0.62 [18]~E(f7(x181),x181)+~P1(x181,a5,f6(a2))
% 0.20/0.62 [19]~P1(x191,a5,f6(a2))+P1(f7(x191),a5,f6(a2))
% 0.20/0.62 [20]P2(x201,f7(x201),f6(a2))+~P1(x201,a5,f6(a2))
% 0.20/0.62 [21]~P2(f3(x211,x212),x213,f6(x212))+~P1(x213,x214,f6(x212))+E(f3(x211,x212),x213)+~P1(x211,f4(x214,x212),f6(f6(x212)))
% 0.20/0.62 %EqnAxiom
% 0.20/0.62 [1]E(x11,x11)
% 0.20/0.62 [2]E(x22,x21)+~E(x21,x22)
% 0.20/0.62 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.20/0.62 [4]~E(x41,x42)+E(f3(x41,x43),f3(x42,x43))
% 0.20/0.62 [5]~E(x51,x52)+E(f3(x53,x51),f3(x53,x52))
% 0.20/0.62 [6]~E(x61,x62)+E(f6(x61),f6(x62))
% 0.20/0.62 [7]~E(x71,x72)+E(f4(x71,x73),f4(x72,x73))
% 0.20/0.62 [8]~E(x81,x82)+E(f4(x83,x81),f4(x83,x82))
% 0.20/0.62 [9]~E(x91,x92)+E(f7(x91),f7(x92))
% 0.20/0.62 [10]P1(x102,x103,x104)+~E(x101,x102)+~P1(x101,x103,x104)
% 0.20/0.62 [11]P1(x113,x112,x114)+~E(x111,x112)+~P1(x113,x111,x114)
% 0.20/0.62 [12]P1(x123,x124,x122)+~E(x121,x122)+~P1(x123,x124,x121)
% 0.20/0.62 [13]P2(x132,x133,x134)+~E(x131,x132)+~P2(x131,x133,x134)
% 0.20/0.62 [14]P2(x143,x142,x144)+~E(x141,x142)+~P2(x143,x141,x144)
% 0.20/0.62 [15]P2(x153,x154,x152)+~E(x151,x152)+~P2(x153,x154,x151)
% 0.20/0.62
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 cnf(22,plain,
% 0.20/0.62 (P2(f3(a1,a2),f7(f3(a1,a2)),f6(a2))),
% 0.20/0.62 inference(scs_inference,[],[16,20])).
% 0.20/0.62 cnf(24,plain,
% 0.20/0.62 (~E(f3(a1,a2),f7(f3(a1,a2)))),
% 0.20/0.62 inference(scs_inference,[],[16,20,18,2])).
% 0.20/0.62 cnf(25,plain,
% 0.20/0.62 (P1(f7(f3(a1,a2)),a5,f6(a2))),
% 0.20/0.62 inference(scs_inference,[],[16,20,18,2,19])).
% 0.20/0.62 cnf(31,plain,
% 0.20/0.62 ($false),
% 0.20/0.62 inference(scs_inference,[],[17,24,22,25,21]),
% 0.20/0.62 ['proof']).
% 0.20/0.62 % SZS output end Proof
% 0.20/0.62 % Total time :0.000000s
%------------------------------------------------------------------------------