TSTP Solution File: SET800+4 by PyRes---1.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : PyRes---1.3
% Problem  : SET800+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s

% Computer : n009.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  : 600s
% DateTime : Tue Jul 19 04:40:16 EDT 2022

% Result   : Theorem 0.84s 1.04s
% Output   : Refutation 0.84s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SET800+4 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13  % Command  : pyres-fof.py -tifbsVp -nlargest -HPickGiven5 %s
% 0.13/0.34  % Computer : n009.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  : 600
% 0.13/0.34  % DateTime : Sat Jul  9 23:20:52 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.84/1.04  # Version:  1.3
% 0.84/1.04  # SZS status Theorem
% 0.84/1.04  # SZS output start CNFRefutation
% 0.84/1.04  fof(thIV12,conjecture,(![R]:(![E]:(order(R,E)=>(![X1]:(![X2]:(((subset(X1,E)&subset(X2,E))&subset(X1,X2))=>(![M1]:(![M2]:((greatest_lower_bound(M1,X1,R,E)&greatest_lower_bound(M2,X2,R,E))=>apply(R,M2,M1)))))))))),input).
% 0.84/1.04  fof(c22,negated_conjecture,(~(![R]:(![E]:(order(R,E)=>(![X1]:(![X2]:(((subset(X1,E)&subset(X2,E))&subset(X1,X2))=>(![M1]:(![M2]:((greatest_lower_bound(M1,X1,R,E)&greatest_lower_bound(M2,X2,R,E))=>apply(R,M2,M1))))))))))),inference(assume_negation,status(cth),[thIV12])).
% 0.84/1.04  fof(c23,negated_conjecture,(?[R]:(?[E]:(order(R,E)&(?[X1]:(?[X2]:(((subset(X1,E)&subset(X2,E))&subset(X1,X2))&(?[M1]:(?[M2]:((greatest_lower_bound(M1,X1,R,E)&greatest_lower_bound(M2,X2,R,E))&~apply(R,M2,M1)))))))))),inference(fof_nnf,status(thm),[c22])).
% 0.84/1.04  fof(c24,negated_conjecture,(?[X2]:(?[X3]:(order(X2,X3)&(?[X4]:(?[X5]:(((subset(X4,X3)&subset(X5,X3))&subset(X4,X5))&(?[X6]:(?[X7]:((greatest_lower_bound(X6,X4,X2,X3)&greatest_lower_bound(X7,X5,X2,X3))&~apply(X2,X7,X6)))))))))),inference(variable_rename,status(thm),[c23])).
% 0.84/1.04  fof(c25,negated_conjecture,(order(skolem0001,skolem0002)&(((subset(skolem0003,skolem0002)&subset(skolem0004,skolem0002))&subset(skolem0003,skolem0004))&((greatest_lower_bound(skolem0005,skolem0003,skolem0001,skolem0002)&greatest_lower_bound(skolem0006,skolem0004,skolem0001,skolem0002))&~apply(skolem0001,skolem0006,skolem0005)))),inference(skolemize,status(esa),[c24])).
% 0.84/1.04  cnf(c32,negated_conjecture,~apply(skolem0001,skolem0006,skolem0005),inference(split_conjunct,status(thm),[c25])).
% 0.84/1.04  cnf(c29,negated_conjecture,subset(skolem0003,skolem0004),inference(split_conjunct,status(thm),[c25])).
% 0.84/1.04  cnf(c30,negated_conjecture,greatest_lower_bound(skolem0005,skolem0003,skolem0001,skolem0002),inference(split_conjunct,status(thm),[c25])).
% 0.84/1.04  fof(greatest_lower_bound,axiom,(![A]:(![X]:(![R]:(![E]:(greatest_lower_bound(A,X,R,E)<=>((member(A,X)&lower_bound(A,R,X))&(![M]:((member(M,E)&lower_bound(M,R,X))=>apply(R,M,A))))))))),input).
% 0.84/1.04  fof(c33,axiom,(![A]:(![X]:(![R]:(![E]:((~greatest_lower_bound(A,X,R,E)|((member(A,X)&lower_bound(A,R,X))&(![M]:((~member(M,E)|~lower_bound(M,R,X))|apply(R,M,A)))))&(((~member(A,X)|~lower_bound(A,R,X))|(?[M]:((member(M,E)&lower_bound(M,R,X))&~apply(R,M,A))))|greatest_lower_bound(A,X,R,E))))))),inference(fof_nnf,status(thm),[greatest_lower_bound])).
% 0.84/1.04  fof(c34,axiom,((![A]:(![X]:(![R]:(![E]:(~greatest_lower_bound(A,X,R,E)|((member(A,X)&lower_bound(A,R,X))&(![M]:((~member(M,E)|~lower_bound(M,R,X))|apply(R,M,A)))))))))&(![A]:(![X]:(![R]:(![E]:(((~member(A,X)|~lower_bound(A,R,X))|(?[M]:((member(M,E)&lower_bound(M,R,X))&~apply(R,M,A))))|greatest_lower_bound(A,X,R,E))))))),inference(shift_quantors,status(thm),[c33])).
% 0.84/1.04  fof(c35,axiom,((![X8]:(![X9]:(![X10]:(![X11]:(~greatest_lower_bound(X8,X9,X10,X11)|((member(X8,X9)&lower_bound(X8,X10,X9))&(![X12]:((~member(X12,X11)|~lower_bound(X12,X10,X9))|apply(X10,X12,X8)))))))))&(![X13]:(![X14]:(![X15]:(![X16]:(((~member(X13,X14)|~lower_bound(X13,X15,X14))|(?[X17]:((member(X17,X16)&lower_bound(X17,X15,X14))&~apply(X15,X17,X13))))|greatest_lower_bound(X13,X14,X15,X16))))))),inference(variable_rename,status(thm),[c34])).
% 0.84/1.04  fof(c37,axiom,(![X8]:(![X9]:(![X10]:(![X11]:(![X12]:(![X13]:(![X14]:(![X15]:(![X16]:((~greatest_lower_bound(X8,X9,X10,X11)|((member(X8,X9)&lower_bound(X8,X10,X9))&((~member(X12,X11)|~lower_bound(X12,X10,X9))|apply(X10,X12,X8))))&(((~member(X13,X14)|~lower_bound(X13,X15,X14))|((member(skolem0007(X13,X14,X15,X16),X16)&lower_bound(skolem0007(X13,X14,X15,X16),X15,X14))&~apply(X15,skolem0007(X13,X14,X15,X16),X13)))|greatest_lower_bound(X13,X14,X15,X16)))))))))))),inference(shift_quantors,status(thm),[fof(c36,axiom,((![X8]:(![X9]:(![X10]:(![X11]:(~greatest_lower_bound(X8,X9,X10,X11)|((member(X8,X9)&lower_bound(X8,X10,X9))&(![X12]:((~member(X12,X11)|~lower_bound(X12,X10,X9))|apply(X10,X12,X8)))))))))&(![X13]:(![X14]:(![X15]:(![X16]:(((~member(X13,X14)|~lower_bound(X13,X15,X14))|((member(skolem0007(X13,X14,X15,X16),X16)&lower_bound(skolem0007(X13,X14,X15,X16),X15,X14))&~apply(X15,skolem0007(X13,X14,X15,X16),X13)))|greatest_lower_bound(X13,X14,X15,X16))))))),inference(skolemize,status(esa),[c35])).])).
% 0.84/1.04  fof(c38,axiom,(![X8]:(![X9]:(![X10]:(![X11]:(![X12]:(![X13]:(![X14]:(![X15]:(![X16]:((((~greatest_lower_bound(X8,X9,X10,X11)|member(X8,X9))&(~greatest_lower_bound(X8,X9,X10,X11)|lower_bound(X8,X10,X9)))&(~greatest_lower_bound(X8,X9,X10,X11)|((~member(X12,X11)|~lower_bound(X12,X10,X9))|apply(X10,X12,X8))))&(((((~member(X13,X14)|~lower_bound(X13,X15,X14))|member(skolem0007(X13,X14,X15,X16),X16))|greatest_lower_bound(X13,X14,X15,X16))&(((~member(X13,X14)|~lower_bound(X13,X15,X14))|lower_bound(skolem0007(X13,X14,X15,X16),X15,X14))|greatest_lower_bound(X13,X14,X15,X16)))&(((~member(X13,X14)|~lower_bound(X13,X15,X14))|~apply(X15,skolem0007(X13,X14,X15,X16),X13))|greatest_lower_bound(X13,X14,X15,X16))))))))))))),inference(distribute,status(thm),[c37])).
% 0.84/1.04  cnf(c39,axiom,~greatest_lower_bound(X188,X189,X187,X186)|member(X188,X189),inference(split_conjunct,status(thm),[c38])).
% 0.84/1.04  cnf(c284,plain,member(skolem0005,skolem0003),inference(resolution,status(thm),[c39, c30])).
% 0.84/1.04  fof(subset,axiom,(![A]:(![B]:(subset(A,B)<=>(![X]:(member(X,A)=>member(X,B)))))),input).
% 0.84/1.04  fof(c272,axiom,(![A]:(![B]:((~subset(A,B)|(![X]:(~member(X,A)|member(X,B))))&((?[X]:(member(X,A)&~member(X,B)))|subset(A,B))))),inference(fof_nnf,status(thm),[subset])).
% 0.84/1.04  fof(c273,axiom,((![A]:(![B]:(~subset(A,B)|(![X]:(~member(X,A)|member(X,B))))))&(![A]:(![B]:((?[X]:(member(X,A)&~member(X,B)))|subset(A,B))))),inference(shift_quantors,status(thm),[c272])).
% 0.84/1.04  fof(c274,axiom,((![X149]:(![X150]:(~subset(X149,X150)|(![X151]:(~member(X151,X149)|member(X151,X150))))))&(![X152]:(![X153]:((?[X154]:(member(X154,X152)&~member(X154,X153)))|subset(X152,X153))))),inference(variable_rename,status(thm),[c273])).
% 0.84/1.04  fof(c276,axiom,(![X149]:(![X150]:(![X151]:(![X152]:(![X153]:((~subset(X149,X150)|(~member(X151,X149)|member(X151,X150)))&((member(skolem0025(X152,X153),X152)&~member(skolem0025(X152,X153),X153))|subset(X152,X153)))))))),inference(shift_quantors,status(thm),[fof(c275,axiom,((![X149]:(![X150]:(~subset(X149,X150)|(![X151]:(~member(X151,X149)|member(X151,X150))))))&(![X152]:(![X153]:((member(skolem0025(X152,X153),X152)&~member(skolem0025(X152,X153),X153))|subset(X152,X153))))),inference(skolemize,status(esa),[c274])).])).
% 0.84/1.04  fof(c277,axiom,(![X149]:(![X150]:(![X151]:(![X152]:(![X153]:((~subset(X149,X150)|(~member(X151,X149)|member(X151,X150)))&((member(skolem0025(X152,X153),X152)|subset(X152,X153))&(~member(skolem0025(X152,X153),X153)|subset(X152,X153))))))))),inference(distribute,status(thm),[c276])).
% 0.84/1.04  cnf(c278,axiom,~subset(X355,X357)|~member(X356,X355)|member(X356,X357),inference(split_conjunct,status(thm),[c277])).
% 0.84/1.04  cnf(c459,plain,~subset(skolem0003,X379)|member(skolem0005,X379),inference(resolution,status(thm),[c278, c284])).
% 0.84/1.04  cnf(c485,plain,member(skolem0005,skolem0004),inference(resolution,status(thm),[c459, c29])).
% 0.84/1.04  cnf(c31,negated_conjecture,greatest_lower_bound(skolem0006,skolem0004,skolem0001,skolem0002),inference(split_conjunct,status(thm),[c25])).
% 0.84/1.04  cnf(c40,axiom,~greatest_lower_bound(X221,X222,X220,X219)|lower_bound(X221,X220,X222),inference(split_conjunct,status(thm),[c38])).
% 0.84/1.04  cnf(c299,plain,lower_bound(skolem0006,skolem0001,skolem0004),inference(resolution,status(thm),[c40, c31])).
% 0.84/1.04  fof(lower_bound,axiom,(![R]:(![E]:(![M]:(lower_bound(M,R,E)<=>(![X]:(member(X,E)=>apply(R,M,X))))))),input).
% 0.84/1.04  fof(c99,axiom,(![R]:(![E]:(![M]:((~lower_bound(M,R,E)|(![X]:(~member(X,E)|apply(R,M,X))))&((?[X]:(member(X,E)&~apply(R,M,X)))|lower_bound(M,R,E)))))),inference(fof_nnf,status(thm),[lower_bound])).
% 0.84/1.04  fof(c100,axiom,((![R]:(![E]:(![M]:(~lower_bound(M,R,E)|(![X]:(~member(X,E)|apply(R,M,X)))))))&(![R]:(![E]:(![M]:((?[X]:(member(X,E)&~apply(R,M,X)))|lower_bound(M,R,E)))))),inference(shift_quantors,status(thm),[c99])).
% 0.84/1.04  fof(c101,axiom,((![X60]:(![X61]:(![X62]:(~lower_bound(X62,X60,X61)|(![X63]:(~member(X63,X61)|apply(X60,X62,X63)))))))&(![X64]:(![X65]:(![X66]:((?[X67]:(member(X67,X65)&~apply(X64,X66,X67)))|lower_bound(X66,X64,X65)))))),inference(variable_rename,status(thm),[c100])).
% 0.84/1.04  fof(c103,axiom,(![X60]:(![X61]:(![X62]:(![X63]:(![X64]:(![X65]:(![X66]:((~lower_bound(X62,X60,X61)|(~member(X63,X61)|apply(X60,X62,X63)))&((member(skolem0013(X64,X65,X66),X65)&~apply(X64,X66,skolem0013(X64,X65,X66)))|lower_bound(X66,X64,X65)))))))))),inference(shift_quantors,status(thm),[fof(c102,axiom,((![X60]:(![X61]:(![X62]:(~lower_bound(X62,X60,X61)|(![X63]:(~member(X63,X61)|apply(X60,X62,X63)))))))&(![X64]:(![X65]:(![X66]:((member(skolem0013(X64,X65,X66),X65)&~apply(X64,X66,skolem0013(X64,X65,X66)))|lower_bound(X66,X64,X65)))))),inference(skolemize,status(esa),[c101])).])).
% 0.84/1.04  fof(c104,axiom,(![X60]:(![X61]:(![X62]:(![X63]:(![X64]:(![X65]:(![X66]:((~lower_bound(X62,X60,X61)|(~member(X63,X61)|apply(X60,X62,X63)))&((member(skolem0013(X64,X65,X66),X65)|lower_bound(X66,X64,X65))&(~apply(X64,X66,skolem0013(X64,X65,X66))|lower_bound(X66,X64,X65))))))))))),inference(distribute,status(thm),[c103])).
% 0.84/1.04  cnf(c105,axiom,~lower_bound(X669,X670,X671)|~member(X668,X671)|apply(X670,X669,X668),inference(split_conjunct,status(thm),[c104])).
% 0.84/1.04  cnf(c1354,plain,~member(X731,skolem0004)|apply(skolem0001,skolem0006,X731),inference(resolution,status(thm),[c105, c299])).
% 0.84/1.04  cnf(c1509,plain,apply(skolem0001,skolem0006,skolem0005),inference(resolution,status(thm),[c1354, c485])).
% 0.84/1.04  cnf(c1516,plain,$false,inference(resolution,status(thm),[c1509, c32])).
% 0.84/1.04  # SZS output end CNFRefutation
% 0.84/1.04  
% 0.84/1.04  # Initial clauses    : 166
% 0.84/1.04  # Processed clauses  : 218
% 0.84/1.04  # Factors computed   : 0
% 0.84/1.04  # Resolvents computed: 1238
% 0.84/1.04  # Tautologies deleted: 1
% 0.84/1.04  # Forward subsumed   : 101
% 0.84/1.04  # Backward subsumed  : 1
% 0.84/1.04  # -------- CPU Time ---------
% 0.84/1.04  # User time          : 0.672 s
% 0.84/1.04  # System time        : 0.015 s
% 0.84/1.04  # Total time         : 0.687 s
%------------------------------------------------------------------------------