TSTP Solution File: CAT019-1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : CAT019-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n032.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 : Wed Aug 30 18:13:49 EDT 2023
% Result : Unsatisfiable 0.11s 0.47s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : CAT019-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.08 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.07/0.27 % Computer : n032.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 300
% 0.07/0.27 % DateTime : Sun Aug 27 00:56:44 EDT 2023
% 0.07/0.27 % CPUTime :
% 0.11/0.43 start to proof:theBenchmark
% 0.11/0.46 %-------------------------------------------
% 0.11/0.46 % File :CSE---1.6
% 0.11/0.46 % Problem :theBenchmark
% 0.11/0.46 % Transform :cnf
% 0.11/0.46 % Format :tptp:raw
% 0.11/0.46 % Command :java -jar mcs_scs.jar %d %s
% 0.11/0.46
% 0.11/0.46 % Result :Theorem 0.000000s
% 0.11/0.46 % Output :CNFRefutation 0.000000s
% 0.11/0.46 %-------------------------------------------
% 0.11/0.47 %--------------------------------------------------------------------------
% 0.11/0.47 % File : CAT019-1 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.47 % Domain : Category Theory
% 0.11/0.47 % Problem : Axiom of Indiscernibles
% 0.11/0.47 % Version : [Mit67] axioms.
% 0.11/0.47 % English : [all z (x=z <-> y=z)] -> x=y.
% 0.11/0.47
% 0.11/0.47 % Refs : [Mit67] Mitchell (1967), Theory of Categories
% 0.11/0.47 % Source : [ANL]
% 0.11/0.47 % Names : p15.ver1.in [ANL]
% 0.11/0.47
% 0.11/0.47 % Status : Unsatisfiable
% 0.11/0.47 % Rating : 0.00 v5.5.0, 0.06 v5.4.0, 0.07 v5.3.0, 0.17 v5.2.0, 0.00 v2.4.0, 0.17 v2.3.0, 0.00 v2.0.0
% 0.11/0.47 % Syntax : Number of clauses : 21 ( 7 unt; 0 nHn; 15 RR)
% 0.11/0.47 % Number of literals : 50 ( 6 equ; 30 neg)
% 0.11/0.47 % Maximal clause size : 4 ( 2 avg)
% 0.11/0.47 % Maximal term depth : 2 ( 1 avg)
% 0.11/0.47 % Number of predicates : 4 ( 3 usr; 0 prp; 1-3 aty)
% 0.11/0.47 % Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% 0.11/0.47 % Number of variables : 54 ( 5 sgn)
% 0.11/0.47 % SPC : CNF_UNS_RFO_SEQ_HRN
% 0.11/0.47
% 0.11/0.47 % Comments :
% 0.11/0.47 %--------------------------------------------------------------------------
% 0.11/0.47 %----Include Mitchell's axioms for category theory
% 0.11/0.47 include('Axioms/CAT001-0.ax').
% 0.11/0.47 %--------------------------------------------------------------------------
% 0.11/0.47 %----c1 and c2 are Skolem constants
% 0.11/0.47 cnf(equality_to_c1_and_c2_1,hypothesis,
% 0.11/0.47 ( c2 != Z
% 0.11/0.47 | c1 = Z ) ).
% 0.11/0.47
% 0.11/0.47 cnf(equality_to_c1_and_c2_2,hypothesis,
% 0.11/0.47 ( c2 = Z
% 0.11/0.47 | c1 != Z ) ).
% 0.11/0.47
% 0.11/0.47 cnf(prove_c1_equals_c2,negated_conjecture,
% 0.11/0.47 c2 != c1 ).
% 0.11/0.47
% 0.11/0.47 %----The ANL group use these extra lemmas as demodulators -
% 0.11/0.47 %input_clause(name,status
% 0.11/0.47 % [++equal(domain(domain(X)),domain(X))]).
% 0.11/0.47 %input_clause(name,status
% 0.11/0.47 % [++equal(codomain(domain(X)),domain(X))]).
% 0.11/0.47 %input_clause(name,status
% 0.11/0.47 % [++equal(domain(codomain(X)),codomain(X))]).
% 0.11/0.47 %input_clause(name,status
% 0.11/0.47 % [++equal(codomain(codomain(X)),codomain(X))]).
% 0.11/0.47 %input_clause(name,status
% 0.11/0.47 % [++equal(compose(codomain(X),X),X)]).
% 0.11/0.47 %input_clause(name,status
% 0.11/0.47 % [++equal(compose(X,domain(X)),X)]).
% 0.11/0.47 %input_clause(name,status
% 0.11/0.47 % [++equal(compose(codomain(X),codomain(X)),codomain(X))]).
% 0.11/0.47 %input_clause(name,status
% 0.11/0.47 % [++equal(compose(domain(X),domain(X)),domain(X))]).
% 0.11/0.47 %input_clause(name,status
% 0.11/0.47 % [++equal(domain(compose(X,Y)),domain(Y))]).
% 0.11/0.47 %input_clause(name,status
% 0.11/0.47 % [++equal(codomain(compose(X,Y)),codomain(X))]).
% 0.11/0.47 %--------------------------------------------------------------------------
% 0.11/0.47 %-------------------------------------------
% 0.11/0.47 % Proof found
% 0.11/0.47 % SZS status Theorem for theBenchmark
% 0.11/0.47 % SZS output start Proof
% 0.11/0.47 %ClaNum:34(EqnAxiom:13)
% 0.11/0.47 %VarNum:112(SingletonVarNum:54)
% 0.11/0.47 %MaxLitNum:4
% 0.11/0.47 %MaxfuncDepth:1
% 0.11/0.47 %SharedTerms:3
% 0.11/0.47 %goalClause: 20
% 0.11/0.47 %singleGoalClaCount:1
% 0.11/0.47 [20]~E(a3,a4)
% 0.11/0.47 [14]P1(f1(x141))
% 0.11/0.47 [15]P1(f2(x151))
% 0.11/0.47 [16]P2(x161,f1(x161))
% 0.11/0.47 [17]P2(f2(x171),x171)
% 0.11/0.47 [18]P3(x181,f1(x181),x181)
% 0.11/0.47 [19]P3(f2(x191),x191,x191)
% 0.11/0.47 [21]~E(a3,x211)+E(a4,x211)
% 0.11/0.47 [22]~E(a4,x221)+E(a3,x221)
% 0.11/0.47 [27]~P2(x271,x272)+P3(x271,x272,f5(x271,x272))
% 0.11/0.47 [26]P2(x261,x262)+~P3(x261,x262,x263)
% 0.11/0.47 [24]~P1(x241)+~P2(x241,x242)+P3(x241,x242,x242)
% 0.11/0.47 [25]~P1(x252)+~P2(x251,x252)+P3(x251,x252,x251)
% 0.11/0.47 [28]P2(x281,x282)+~P3(x282,x284,x283)+~P2(x281,x283)
% 0.11/0.47 [29]P2(x291,x292)+~P3(x294,x291,x293)+~P2(x293,x292)
% 0.11/0.47 [30]~P3(x303,x304,x301)+E(x301,x302)+~P3(x303,x304,x302)
% 0.11/0.47 [23]~P2(x233,x232)+~P2(x231,x233)+P2(x231,x232)+~P1(x233)
% 0.11/0.47 [31]~P3(x315,x312,x314)+P2(x311,x312)+~P3(x313,x315,x311)+~P2(x313,x314)
% 0.11/0.47 [32]~P3(x321,x325,x323)+P2(x321,x322)+~P3(x325,x324,x322)+~P2(x323,x324)
% 0.11/0.47 [33]~P3(x336,x332,x335)+P3(x331,x332,x333)+~P3(x334,x335,x333)+~P3(x334,x336,x331)
% 0.11/0.47 [34]~P3(x341,x346,x344)+P3(x341,x342,x343)+~P3(x344,x345,x343)+~P3(x346,x345,x342)
% 0.11/0.47 %EqnAxiom
% 0.11/0.47 [1]E(x11,x11)
% 0.11/0.47 [2]E(x22,x21)+~E(x21,x22)
% 0.11/0.47 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.11/0.47 [4]~E(x41,x42)+E(f1(x41),f1(x42))
% 0.11/0.47 [5]~E(x51,x52)+E(f2(x51),f2(x52))
% 0.11/0.47 [6]~E(x61,x62)+E(f5(x61,x63),f5(x62,x63))
% 0.11/0.47 [7]~E(x71,x72)+E(f5(x73,x71),f5(x73,x72))
% 0.11/0.47 [8]~P1(x81)+P1(x82)+~E(x81,x82)
% 0.11/0.47 [9]P3(x92,x93,x94)+~E(x91,x92)+~P3(x91,x93,x94)
% 0.11/0.47 [10]P3(x103,x102,x104)+~E(x101,x102)+~P3(x103,x101,x104)
% 0.11/0.47 [11]P3(x113,x114,x112)+~E(x111,x112)+~P3(x113,x114,x111)
% 0.11/0.47 [12]P2(x122,x123)+~E(x121,x122)+~P2(x121,x123)
% 0.11/0.47 [13]P2(x133,x132)+~E(x131,x132)+~P2(x133,x131)
% 0.11/0.47
% 0.11/0.47 %-------------------------------------------
% 0.11/0.47 cnf(36,plain,
% 0.11/0.47 ($false),
% 0.11/0.47 inference(scs_inference,[],[20,18,22,30]),
% 0.11/0.47 ['proof']).
% 0.11/0.47 % SZS output end Proof
% 0.11/0.47 % Total time :0.000000s
%------------------------------------------------------------------------------