TSTP Solution File: SET795+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET795+4 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Thu Dec 30 00:08:20 EST 2010
% Result : Theorem 92.77s
% Output : Solution 93.24s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP30587/SET795+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~thIV7:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... order:
% CSA axiom order found
% Looking for CSA axiom ... least_upper_bound:
% CSA axiom least_upper_bound found
% Looking for CSA axiom ... total_order:
% CSA axiom total_order found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... unordered_pair:
% CSA axiom unordered_pair found
% Looking for CSA axiom ... upper_bound:
% CSA axiom upper_bound found
% Looking for CSA axiom ... lower_bound:
% CSA axiom lower_bound found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :lower_bound:upper_bound:unordered_pair:total_order:least_upper_bound:order (6)
% Unselected axioms are ... :greatest:least:greatest_lower_bound:max:min:equal_set:power_set:singleton:subset:intersection:union:empty_set:difference:sum:product (15)
% SZS status THM for /tmp/SystemOnTPTP30587/SET795+4.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP30587/SET795+4.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=600 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 600s
% TreeLimitedRun: WC time limit is 1200s
% TreeLimitedRun: PID is 31959
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:(upper_bound(X3,X1,X2)<=>![X4]:(member(X4,X2)=>apply(X1,X4,X3))),file('/tmp/SRASS.s.p', upper_bound)).
% fof(3, axiom,![X4]:![X5]:![X6]:(member(X4,unordered_pair(X5,X6))<=>(X4=X5|X4=X6)),file('/tmp/SRASS.s.p', unordered_pair)).
% fof(5, axiom,![X5]:![X4]:![X1]:![X2]:(least_upper_bound(X5,X4,X1,X2)<=>((member(X5,X4)&upper_bound(X5,X1,X4))&![X3]:((member(X3,X2)&upper_bound(X3,X1,X4))=>apply(X1,X5,X3)))),file('/tmp/SRASS.s.p', least_upper_bound)).
% fof(6, axiom,![X1]:![X2]:(order(X1,X2)<=>((![X4]:(member(X4,X2)=>apply(X1,X4,X4))&![X4]:![X7]:((member(X4,X2)&member(X7,X2))=>((apply(X1,X4,X7)&apply(X1,X7,X4))=>X4=X7)))&![X4]:![X7]:![X8]:(((member(X4,X2)&member(X7,X2))&member(X8,X2))=>((apply(X1,X4,X7)&apply(X1,X7,X8))=>apply(X1,X4,X8))))),file('/tmp/SRASS.s.p', order)).
% fof(7, conjecture,![X1]:![X2]:![X5]:![X6]:((((order(X1,X2)&member(X5,X2))&member(X6,X2))&apply(X1,X5,X6))=>least_upper_bound(X6,unordered_pair(X5,X6),X1,X2)),file('/tmp/SRASS.s.p', thIV7)).
% fof(8, negated_conjecture,~(![X1]:![X2]:![X5]:![X6]:((((order(X1,X2)&member(X5,X2))&member(X6,X2))&apply(X1,X5,X6))=>least_upper_bound(X6,unordered_pair(X5,X6),X1,X2))),inference(assume_negation,[status(cth)],[7])).
% fof(9, plain,![X2]:![X1]:(epred1_2(X1,X2)<=>((![X4]:(member(X4,X2)=>apply(X1,X4,X4))&![X4]:![X7]:((member(X4,X2)&member(X7,X2))=>((apply(X1,X4,X7)&apply(X1,X7,X4))=>X4=X7)))&![X4]:![X7]:![X8]:(((member(X4,X2)&member(X7,X2))&member(X8,X2))=>((apply(X1,X4,X7)&apply(X1,X7,X8))=>apply(X1,X4,X8))))),introduced(definition)).
% fof(10, plain,![X1]:![X2]:(order(X1,X2)<=>epred1_2(X1,X2)),inference(apply_def,[status(esa)],[6,9,theory(equality)])).
% fof(19, plain,![X1]:![X2]:![X3]:((~(upper_bound(X3,X1,X2))|![X4]:(~(member(X4,X2))|apply(X1,X4,X3)))&(?[X4]:(member(X4,X2)&~(apply(X1,X4,X3)))|upper_bound(X3,X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(20, plain,![X5]:![X6]:![X7]:((~(upper_bound(X7,X5,X6))|![X8]:(~(member(X8,X6))|apply(X5,X8,X7)))&(?[X9]:(member(X9,X6)&~(apply(X5,X9,X7)))|upper_bound(X7,X5,X6))),inference(variable_rename,[status(thm)],[19])).
% fof(21, plain,![X5]:![X6]:![X7]:((~(upper_bound(X7,X5,X6))|![X8]:(~(member(X8,X6))|apply(X5,X8,X7)))&((member(esk2_3(X5,X6,X7),X6)&~(apply(X5,esk2_3(X5,X6,X7),X7)))|upper_bound(X7,X5,X6))),inference(skolemize,[status(esa)],[20])).
% fof(22, plain,![X5]:![X6]:![X7]:![X8]:(((~(member(X8,X6))|apply(X5,X8,X7))|~(upper_bound(X7,X5,X6)))&((member(esk2_3(X5,X6,X7),X6)&~(apply(X5,esk2_3(X5,X6,X7),X7)))|upper_bound(X7,X5,X6))),inference(shift_quantors,[status(thm)],[21])).
% fof(23, plain,![X5]:![X6]:![X7]:![X8]:(((~(member(X8,X6))|apply(X5,X8,X7))|~(upper_bound(X7,X5,X6)))&((member(esk2_3(X5,X6,X7),X6)|upper_bound(X7,X5,X6))&(~(apply(X5,esk2_3(X5,X6,X7),X7))|upper_bound(X7,X5,X6)))),inference(distribute,[status(thm)],[22])).
% cnf(24,plain,(upper_bound(X1,X2,X3)|~apply(X2,esk2_3(X2,X3,X1),X1)),inference(split_conjunct,[status(thm)],[23])).
% cnf(25,plain,(upper_bound(X1,X2,X3)|member(esk2_3(X2,X3,X1),X3)),inference(split_conjunct,[status(thm)],[23])).
% cnf(26,plain,(apply(X2,X4,X1)|~upper_bound(X1,X2,X3)|~member(X4,X3)),inference(split_conjunct,[status(thm)],[23])).
% fof(27, plain,![X4]:![X5]:![X6]:((~(member(X4,unordered_pair(X5,X6)))|(X4=X5|X4=X6))&((~(X4=X5)&~(X4=X6))|member(X4,unordered_pair(X5,X6)))),inference(fof_nnf,[status(thm)],[3])).
% fof(28, plain,![X7]:![X8]:![X9]:((~(member(X7,unordered_pair(X8,X9)))|(X7=X8|X7=X9))&((~(X7=X8)&~(X7=X9))|member(X7,unordered_pair(X8,X9)))),inference(variable_rename,[status(thm)],[27])).
% fof(29, plain,![X7]:![X8]:![X9]:((~(member(X7,unordered_pair(X8,X9)))|(X7=X8|X7=X9))&((~(X7=X8)|member(X7,unordered_pair(X8,X9)))&(~(X7=X9)|member(X7,unordered_pair(X8,X9))))),inference(distribute,[status(thm)],[28])).
% cnf(30,plain,(member(X1,unordered_pair(X2,X3))|X1!=X3),inference(split_conjunct,[status(thm)],[29])).
% cnf(32,plain,(X1=X2|X1=X3|~member(X1,unordered_pair(X3,X2))),inference(split_conjunct,[status(thm)],[29])).
% fof(44, plain,![X5]:![X4]:![X1]:![X2]:((~(least_upper_bound(X5,X4,X1,X2))|((member(X5,X4)&upper_bound(X5,X1,X4))&![X3]:((~(member(X3,X2))|~(upper_bound(X3,X1,X4)))|apply(X1,X5,X3))))&(((~(member(X5,X4))|~(upper_bound(X5,X1,X4)))|?[X3]:((member(X3,X2)&upper_bound(X3,X1,X4))&~(apply(X1,X5,X3))))|least_upper_bound(X5,X4,X1,X2))),inference(fof_nnf,[status(thm)],[5])).
% fof(45, plain,![X6]:![X7]:![X8]:![X9]:((~(least_upper_bound(X6,X7,X8,X9))|((member(X6,X7)&upper_bound(X6,X8,X7))&![X10]:((~(member(X10,X9))|~(upper_bound(X10,X8,X7)))|apply(X8,X6,X10))))&(((~(member(X6,X7))|~(upper_bound(X6,X8,X7)))|?[X11]:((member(X11,X9)&upper_bound(X11,X8,X7))&~(apply(X8,X6,X11))))|least_upper_bound(X6,X7,X8,X9))),inference(variable_rename,[status(thm)],[44])).
% fof(46, plain,![X6]:![X7]:![X8]:![X9]:((~(least_upper_bound(X6,X7,X8,X9))|((member(X6,X7)&upper_bound(X6,X8,X7))&![X10]:((~(member(X10,X9))|~(upper_bound(X10,X8,X7)))|apply(X8,X6,X10))))&(((~(member(X6,X7))|~(upper_bound(X6,X8,X7)))|((member(esk5_4(X6,X7,X8,X9),X9)&upper_bound(esk5_4(X6,X7,X8,X9),X8,X7))&~(apply(X8,X6,esk5_4(X6,X7,X8,X9)))))|least_upper_bound(X6,X7,X8,X9))),inference(skolemize,[status(esa)],[45])).
% fof(47, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(((((~(member(X10,X9))|~(upper_bound(X10,X8,X7)))|apply(X8,X6,X10))&(member(X6,X7)&upper_bound(X6,X8,X7)))|~(least_upper_bound(X6,X7,X8,X9)))&(((~(member(X6,X7))|~(upper_bound(X6,X8,X7)))|((member(esk5_4(X6,X7,X8,X9),X9)&upper_bound(esk5_4(X6,X7,X8,X9),X8,X7))&~(apply(X8,X6,esk5_4(X6,X7,X8,X9)))))|least_upper_bound(X6,X7,X8,X9))),inference(shift_quantors,[status(thm)],[46])).
% fof(48, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(((((~(member(X10,X9))|~(upper_bound(X10,X8,X7)))|apply(X8,X6,X10))|~(least_upper_bound(X6,X7,X8,X9)))&((member(X6,X7)|~(least_upper_bound(X6,X7,X8,X9)))&(upper_bound(X6,X8,X7)|~(least_upper_bound(X6,X7,X8,X9)))))&((((member(esk5_4(X6,X7,X8,X9),X9)|(~(member(X6,X7))|~(upper_bound(X6,X8,X7))))|least_upper_bound(X6,X7,X8,X9))&((upper_bound(esk5_4(X6,X7,X8,X9),X8,X7)|(~(member(X6,X7))|~(upper_bound(X6,X8,X7))))|least_upper_bound(X6,X7,X8,X9)))&((~(apply(X8,X6,esk5_4(X6,X7,X8,X9)))|(~(member(X6,X7))|~(upper_bound(X6,X8,X7))))|least_upper_bound(X6,X7,X8,X9)))),inference(distribute,[status(thm)],[47])).
% cnf(49,plain,(least_upper_bound(X1,X2,X3,X4)|~upper_bound(X1,X3,X2)|~member(X1,X2)|~apply(X3,X1,esk5_4(X1,X2,X3,X4))),inference(split_conjunct,[status(thm)],[48])).
% cnf(50,plain,(least_upper_bound(X1,X2,X3,X4)|upper_bound(esk5_4(X1,X2,X3,X4),X3,X2)|~upper_bound(X1,X3,X2)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[48])).
% fof(55, plain,![X1]:![X2]:((~(order(X1,X2))|epred1_2(X1,X2))&(~(epred1_2(X1,X2))|order(X1,X2))),inference(fof_nnf,[status(thm)],[10])).
% fof(56, plain,![X3]:![X4]:((~(order(X3,X4))|epred1_2(X3,X4))&(~(epred1_2(X3,X4))|order(X3,X4))),inference(variable_rename,[status(thm)],[55])).
% cnf(58,plain,(epred1_2(X1,X2)|~order(X1,X2)),inference(split_conjunct,[status(thm)],[56])).
% fof(59, negated_conjecture,?[X1]:?[X2]:?[X5]:?[X6]:((((order(X1,X2)&member(X5,X2))&member(X6,X2))&apply(X1,X5,X6))&~(least_upper_bound(X6,unordered_pair(X5,X6),X1,X2))),inference(fof_nnf,[status(thm)],[8])).
% fof(60, negated_conjecture,?[X7]:?[X8]:?[X9]:?[X10]:((((order(X7,X8)&member(X9,X8))&member(X10,X8))&apply(X7,X9,X10))&~(least_upper_bound(X10,unordered_pair(X9,X10),X7,X8))),inference(variable_rename,[status(thm)],[59])).
% fof(61, negated_conjecture,((((order(esk6_0,esk7_0)&member(esk8_0,esk7_0))&member(esk9_0,esk7_0))&apply(esk6_0,esk8_0,esk9_0))&~(least_upper_bound(esk9_0,unordered_pair(esk8_0,esk9_0),esk6_0,esk7_0))),inference(skolemize,[status(esa)],[60])).
% cnf(62,negated_conjecture,(~least_upper_bound(esk9_0,unordered_pair(esk8_0,esk9_0),esk6_0,esk7_0)),inference(split_conjunct,[status(thm)],[61])).
% cnf(63,negated_conjecture,(apply(esk6_0,esk8_0,esk9_0)),inference(split_conjunct,[status(thm)],[61])).
% cnf(64,negated_conjecture,(member(esk9_0,esk7_0)),inference(split_conjunct,[status(thm)],[61])).
% cnf(66,negated_conjecture,(order(esk6_0,esk7_0)),inference(split_conjunct,[status(thm)],[61])).
% fof(67, plain,![X2]:![X1]:((~(epred1_2(X1,X2))|((![X4]:(~(member(X4,X2))|apply(X1,X4,X4))&![X4]:![X7]:((~(member(X4,X2))|~(member(X7,X2)))|((~(apply(X1,X4,X7))|~(apply(X1,X7,X4)))|X4=X7)))&![X4]:![X7]:![X8]:(((~(member(X4,X2))|~(member(X7,X2)))|~(member(X8,X2)))|((~(apply(X1,X4,X7))|~(apply(X1,X7,X8)))|apply(X1,X4,X8)))))&(((?[X4]:(member(X4,X2)&~(apply(X1,X4,X4)))|?[X4]:?[X7]:((member(X4,X2)&member(X7,X2))&((apply(X1,X4,X7)&apply(X1,X7,X4))&~(X4=X7))))|?[X4]:?[X7]:?[X8]:(((member(X4,X2)&member(X7,X2))&member(X8,X2))&((apply(X1,X4,X7)&apply(X1,X7,X8))&~(apply(X1,X4,X8)))))|epred1_2(X1,X2))),inference(fof_nnf,[status(thm)],[9])).
% fof(68, plain,![X9]:![X10]:((~(epred1_2(X10,X9))|((![X11]:(~(member(X11,X9))|apply(X10,X11,X11))&![X12]:![X13]:((~(member(X12,X9))|~(member(X13,X9)))|((~(apply(X10,X12,X13))|~(apply(X10,X13,X12)))|X12=X13)))&![X14]:![X15]:![X16]:(((~(member(X14,X9))|~(member(X15,X9)))|~(member(X16,X9)))|((~(apply(X10,X14,X15))|~(apply(X10,X15,X16)))|apply(X10,X14,X16)))))&(((?[X17]:(member(X17,X9)&~(apply(X10,X17,X17)))|?[X18]:?[X19]:((member(X18,X9)&member(X19,X9))&((apply(X10,X18,X19)&apply(X10,X19,X18))&~(X18=X19))))|?[X20]:?[X21]:?[X22]:(((member(X20,X9)&member(X21,X9))&member(X22,X9))&((apply(X10,X20,X21)&apply(X10,X21,X22))&~(apply(X10,X20,X22)))))|epred1_2(X10,X9))),inference(variable_rename,[status(thm)],[67])).
% fof(69, plain,![X9]:![X10]:((~(epred1_2(X10,X9))|((![X11]:(~(member(X11,X9))|apply(X10,X11,X11))&![X12]:![X13]:((~(member(X12,X9))|~(member(X13,X9)))|((~(apply(X10,X12,X13))|~(apply(X10,X13,X12)))|X12=X13)))&![X14]:![X15]:![X16]:(((~(member(X14,X9))|~(member(X15,X9)))|~(member(X16,X9)))|((~(apply(X10,X14,X15))|~(apply(X10,X15,X16)))|apply(X10,X14,X16)))))&((((member(esk10_2(X9,X10),X9)&~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10))))|((member(esk11_2(X9,X10),X9)&member(esk12_2(X9,X10),X9))&((apply(X10,esk11_2(X9,X10),esk12_2(X9,X10))&apply(X10,esk12_2(X9,X10),esk11_2(X9,X10)))&~(esk11_2(X9,X10)=esk12_2(X9,X10)))))|(((member(esk13_2(X9,X10),X9)&member(esk14_2(X9,X10),X9))&member(esk15_2(X9,X10),X9))&((apply(X10,esk13_2(X9,X10),esk14_2(X9,X10))&apply(X10,esk14_2(X9,X10),esk15_2(X9,X10)))&~(apply(X10,esk13_2(X9,X10),esk15_2(X9,X10))))))|epred1_2(X10,X9))),inference(skolemize,[status(esa)],[68])).
% fof(70, plain,![X9]:![X10]:![X11]:![X12]:![X13]:![X14]:![X15]:![X16]:((((((~(member(X14,X9))|~(member(X15,X9)))|~(member(X16,X9)))|((~(apply(X10,X14,X15))|~(apply(X10,X15,X16)))|apply(X10,X14,X16)))&(((~(member(X12,X9))|~(member(X13,X9)))|((~(apply(X10,X12,X13))|~(apply(X10,X13,X12)))|X12=X13))&(~(member(X11,X9))|apply(X10,X11,X11))))|~(epred1_2(X10,X9)))&((((member(esk10_2(X9,X10),X9)&~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10))))|((member(esk11_2(X9,X10),X9)&member(esk12_2(X9,X10),X9))&((apply(X10,esk11_2(X9,X10),esk12_2(X9,X10))&apply(X10,esk12_2(X9,X10),esk11_2(X9,X10)))&~(esk11_2(X9,X10)=esk12_2(X9,X10)))))|(((member(esk13_2(X9,X10),X9)&member(esk14_2(X9,X10),X9))&member(esk15_2(X9,X10),X9))&((apply(X10,esk13_2(X9,X10),esk14_2(X9,X10))&apply(X10,esk14_2(X9,X10),esk15_2(X9,X10)))&~(apply(X10,esk13_2(X9,X10),esk15_2(X9,X10))))))|epred1_2(X10,X9))),inference(shift_quantors,[status(thm)],[69])).
% fof(71, plain,![X9]:![X10]:![X11]:![X12]:![X13]:![X14]:![X15]:![X16]:((((((~(member(X14,X9))|~(member(X15,X9)))|~(member(X16,X9)))|((~(apply(X10,X14,X15))|~(apply(X10,X15,X16)))|apply(X10,X14,X16)))|~(epred1_2(X10,X9)))&((((~(member(X12,X9))|~(member(X13,X9)))|((~(apply(X10,X12,X13))|~(apply(X10,X13,X12)))|X12=X13))|~(epred1_2(X10,X9)))&((~(member(X11,X9))|apply(X10,X11,X11))|~(epred1_2(X10,X9)))))&((((((((member(esk13_2(X9,X10),X9)|(member(esk11_2(X9,X10),X9)|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9))&((member(esk14_2(X9,X10),X9)|(member(esk11_2(X9,X10),X9)|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9)))&((member(esk15_2(X9,X10),X9)|(member(esk11_2(X9,X10),X9)|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9)))&((((apply(X10,esk13_2(X9,X10),esk14_2(X9,X10))|(member(esk11_2(X9,X10),X9)|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9))&((apply(X10,esk14_2(X9,X10),esk15_2(X9,X10))|(member(esk11_2(X9,X10),X9)|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9)))&((~(apply(X10,esk13_2(X9,X10),esk15_2(X9,X10)))|(member(esk11_2(X9,X10),X9)|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9))))&(((((member(esk13_2(X9,X10),X9)|(member(esk12_2(X9,X10),X9)|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9))&((member(esk14_2(X9,X10),X9)|(member(esk12_2(X9,X10),X9)|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9)))&((member(esk15_2(X9,X10),X9)|(member(esk12_2(X9,X10),X9)|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9)))&((((apply(X10,esk13_2(X9,X10),esk14_2(X9,X10))|(member(esk12_2(X9,X10),X9)|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9))&((apply(X10,esk14_2(X9,X10),esk15_2(X9,X10))|(member(esk12_2(X9,X10),X9)|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9)))&((~(apply(X10,esk13_2(X9,X10),esk15_2(X9,X10)))|(member(esk12_2(X9,X10),X9)|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9)))))&(((((((member(esk13_2(X9,X10),X9)|(apply(X10,esk11_2(X9,X10),esk12_2(X9,X10))|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9))&((member(esk14_2(X9,X10),X9)|(apply(X10,esk11_2(X9,X10),esk12_2(X9,X10))|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9)))&((member(esk15_2(X9,X10),X9)|(apply(X10,esk11_2(X9,X10),esk12_2(X9,X10))|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9)))&((((apply(X10,esk13_2(X9,X10),esk14_2(X9,X10))|(apply(X10,esk11_2(X9,X10),esk12_2(X9,X10))|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9))&((apply(X10,esk14_2(X9,X10),esk15_2(X9,X10))|(apply(X10,esk11_2(X9,X10),esk12_2(X9,X10))|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9)))&((~(apply(X10,esk13_2(X9,X10),esk15_2(X9,X10)))|(apply(X10,esk11_2(X9,X10),esk12_2(X9,X10))|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9))))&(((((member(esk13_2(X9,X10),X9)|(apply(X10,esk12_2(X9,X10),esk11_2(X9,X10))|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9))&((member(esk14_2(X9,X10),X9)|(apply(X10,esk12_2(X9,X10),esk11_2(X9,X10))|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9)))&((member(esk15_2(X9,X10),X9)|(apply(X10,esk12_2(X9,X10),esk11_2(X9,X10))|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9)))&((((apply(X10,esk13_2(X9,X10),esk14_2(X9,X10))|(apply(X10,esk12_2(X9,X10),esk11_2(X9,X10))|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9))&((apply(X10,esk14_2(X9,X10),esk15_2(X9,X10))|(apply(X10,esk12_2(X9,X10),esk11_2(X9,X10))|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9)))&((~(apply(X10,esk13_2(X9,X10),esk15_2(X9,X10)))|(apply(X10,esk12_2(X9,X10),esk11_2(X9,X10))|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9)))))&(((((member(esk13_2(X9,X10),X9)|(~(esk11_2(X9,X10)=esk12_2(X9,X10))|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9))&((member(esk14_2(X9,X10),X9)|(~(esk11_2(X9,X10)=esk12_2(X9,X10))|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9)))&((member(esk15_2(X9,X10),X9)|(~(esk11_2(X9,X10)=esk12_2(X9,X10))|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9)))&((((apply(X10,esk13_2(X9,X10),esk14_2(X9,X10))|(~(esk11_2(X9,X10)=esk12_2(X9,X10))|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9))&((apply(X10,esk14_2(X9,X10),esk15_2(X9,X10))|(~(esk11_2(X9,X10)=esk12_2(X9,X10))|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9)))&((~(apply(X10,esk13_2(X9,X10),esk15_2(X9,X10)))|(~(esk11_2(X9,X10)=esk12_2(X9,X10))|member(esk10_2(X9,X10),X9)))|epred1_2(X10,X9))))))&(((((((member(esk13_2(X9,X10),X9)|(member(esk11_2(X9,X10),X9)|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9))&((member(esk14_2(X9,X10),X9)|(member(esk11_2(X9,X10),X9)|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9)))&((member(esk15_2(X9,X10),X9)|(member(esk11_2(X9,X10),X9)|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9)))&((((apply(X10,esk13_2(X9,X10),esk14_2(X9,X10))|(member(esk11_2(X9,X10),X9)|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9))&((apply(X10,esk14_2(X9,X10),esk15_2(X9,X10))|(member(esk11_2(X9,X10),X9)|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9)))&((~(apply(X10,esk13_2(X9,X10),esk15_2(X9,X10)))|(member(esk11_2(X9,X10),X9)|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9))))&(((((member(esk13_2(X9,X10),X9)|(member(esk12_2(X9,X10),X9)|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9))&((member(esk14_2(X9,X10),X9)|(member(esk12_2(X9,X10),X9)|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9)))&((member(esk15_2(X9,X10),X9)|(member(esk12_2(X9,X10),X9)|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9)))&((((apply(X10,esk13_2(X9,X10),esk14_2(X9,X10))|(member(esk12_2(X9,X10),X9)|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9))&((apply(X10,esk14_2(X9,X10),esk15_2(X9,X10))|(member(esk12_2(X9,X10),X9)|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9)))&((~(apply(X10,esk13_2(X9,X10),esk15_2(X9,X10)))|(member(esk12_2(X9,X10),X9)|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9)))))&(((((((member(esk13_2(X9,X10),X9)|(apply(X10,esk11_2(X9,X10),esk12_2(X9,X10))|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9))&((member(esk14_2(X9,X10),X9)|(apply(X10,esk11_2(X9,X10),esk12_2(X9,X10))|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9)))&((member(esk15_2(X9,X10),X9)|(apply(X10,esk11_2(X9,X10),esk12_2(X9,X10))|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9)))&((((apply(X10,esk13_2(X9,X10),esk14_2(X9,X10))|(apply(X10,esk11_2(X9,X10),esk12_2(X9,X10))|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9))&((apply(X10,esk14_2(X9,X10),esk15_2(X9,X10))|(apply(X10,esk11_2(X9,X10),esk12_2(X9,X10))|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9)))&((~(apply(X10,esk13_2(X9,X10),esk15_2(X9,X10)))|(apply(X10,esk11_2(X9,X10),esk12_2(X9,X10))|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9))))&(((((member(esk13_2(X9,X10),X9)|(apply(X10,esk12_2(X9,X10),esk11_2(X9,X10))|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9))&((member(esk14_2(X9,X10),X9)|(apply(X10,esk12_2(X9,X10),esk11_2(X9,X10))|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9)))&((member(esk15_2(X9,X10),X9)|(apply(X10,esk12_2(X9,X10),esk11_2(X9,X10))|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9)))&((((apply(X10,esk13_2(X9,X10),esk14_2(X9,X10))|(apply(X10,esk12_2(X9,X10),esk11_2(X9,X10))|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9))&((apply(X10,esk14_2(X9,X10),esk15_2(X9,X10))|(apply(X10,esk12_2(X9,X10),esk11_2(X9,X10))|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9)))&((~(apply(X10,esk13_2(X9,X10),esk15_2(X9,X10)))|(apply(X10,esk12_2(X9,X10),esk11_2(X9,X10))|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9)))))&(((((member(esk13_2(X9,X10),X9)|(~(esk11_2(X9,X10)=esk12_2(X9,X10))|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9))&((member(esk14_2(X9,X10),X9)|(~(esk11_2(X9,X10)=esk12_2(X9,X10))|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9)))&((member(esk15_2(X9,X10),X9)|(~(esk11_2(X9,X10)=esk12_2(X9,X10))|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9)))&((((apply(X10,esk13_2(X9,X10),esk14_2(X9,X10))|(~(esk11_2(X9,X10)=esk12_2(X9,X10))|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9))&((apply(X10,esk14_2(X9,X10),esk15_2(X9,X10))|(~(esk11_2(X9,X10)=esk12_2(X9,X10))|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9)))&((~(apply(X10,esk13_2(X9,X10),esk15_2(X9,X10)))|(~(esk11_2(X9,X10)=esk12_2(X9,X10))|~(apply(X10,esk10_2(X9,X10),esk10_2(X9,X10)))))|epred1_2(X10,X9)))))))),inference(distribute,[status(thm)],[70])).
% cnf(132,plain,(apply(X1,X3,X3)|~epred1_2(X1,X2)|~member(X3,X2)),inference(split_conjunct,[status(thm)],[71])).
% cnf(135,plain,(member(X1,unordered_pair(X2,X1))),inference(er,[status(thm)],[30,theory(equality)])).
% cnf(137,negated_conjecture,(epred1_2(esk6_0,esk7_0)),inference(spm,[status(thm)],[58,66,theory(equality)])).
% cnf(140,plain,(esk2_3(X1,unordered_pair(X2,X3),X4)=X2|esk2_3(X1,unordered_pair(X2,X3),X4)=X3|upper_bound(X4,X1,unordered_pair(X2,X3))),inference(spm,[status(thm)],[32,25,theory(equality)])).
% cnf(154,plain,(apply(X1,X2,esk5_4(X3,X4,X1,X5))|least_upper_bound(X3,X4,X1,X5)|~member(X2,X4)|~upper_bound(X3,X1,X4)|~member(X3,X4)),inference(spm,[status(thm)],[26,50,theory(equality)])).
% cnf(220,plain,(apply(esk6_0,X1,X1)|~member(X1,esk7_0)),inference(spm,[status(thm)],[132,137,theory(equality)])).
% cnf(278,plain,(upper_bound(X1,X2,unordered_pair(X3,X4))|esk2_3(X2,unordered_pair(X3,X4),X1)=X4|~apply(X2,X3,X1)),inference(spm,[status(thm)],[24,140,theory(equality)])).
% cnf(358,plain,(upper_bound(X1,X2,unordered_pair(X3,X4))|~apply(X2,X4,X1)|~apply(X2,X3,X1)),inference(spm,[status(thm)],[24,278,theory(equality)])).
% cnf(518,plain,(least_upper_bound(X1,X2,X3,X4)|~upper_bound(X1,X3,X2)|~member(X1,X2)),inference(spm,[status(thm)],[49,154,theory(equality)])).
% cnf(521,negated_conjecture,(~upper_bound(esk9_0,esk6_0,unordered_pair(esk8_0,esk9_0))|~member(esk9_0,unordered_pair(esk8_0,esk9_0))),inference(spm,[status(thm)],[62,518,theory(equality)])).
% cnf(525,negated_conjecture,(~upper_bound(esk9_0,esk6_0,unordered_pair(esk8_0,esk9_0))|$false),inference(rw,[status(thm)],[521,135,theory(equality)])).
% cnf(526,negated_conjecture,(~upper_bound(esk9_0,esk6_0,unordered_pair(esk8_0,esk9_0))),inference(cn,[status(thm)],[525,theory(equality)])).
% cnf(527,negated_conjecture,(~apply(esk6_0,esk9_0,esk9_0)|~apply(esk6_0,esk8_0,esk9_0)),inference(spm,[status(thm)],[526,358,theory(equality)])).
% cnf(528,negated_conjecture,(~apply(esk6_0,esk9_0,esk9_0)|$false),inference(rw,[status(thm)],[527,63,theory(equality)])).
% cnf(529,negated_conjecture,(~apply(esk6_0,esk9_0,esk9_0)),inference(cn,[status(thm)],[528,theory(equality)])).
% cnf(535,plain,(~member(esk9_0,esk7_0)),inference(spm,[status(thm)],[529,220,theory(equality)])).
% cnf(536,plain,($false),inference(rw,[status(thm)],[535,64,theory(equality)])).
% cnf(537,plain,($false),inference(cn,[status(thm)],[536,theory(equality)])).
% cnf(538,plain,($false),537,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 253
% # ...of these trivial : 0
% # ...subsumed : 13
% # ...remaining for further processing: 240
% # Other redundant clauses eliminated : 6
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 6
% # Backward-rewritten : 0
% # Generated clauses : 379
% # ...of the previous two non-trivial : 323
% # Contextual simplify-reflections : 2
% # Paramodulations : 369
% # Factorizations : 4
% # Equation resolutions : 6
% # Current number of processed clauses: 141
% # Positive orientable unit clauses: 7
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 131
% # Current number of unprocessed clauses: 235
% # ...number of literals in the above : 1507
% # Clause-clause subsumption calls (NU) : 398
% # Rec. Clause-clause subsumption calls : 216
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 87 leaves, 2.07+/-3.762 terms/leaf
% # Paramod-from index: 34 leaves, 1.32+/-0.898 terms/leaf
% # Paramod-into index: 66 leaves, 1.68+/-1.802 terms/leaf
% # -------------------------------------------------
% # User time : 0.047 s
% # System time : 0.006 s
% # Total time : 0.053 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.23 WC
% FINAL PrfWatch: 0.15 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP30587/SET795+4.tptp
%
%------------------------------------------------------------------------------