TSTP Solution File: SET768+4 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : SET768+4 : TPTP v5.0.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art01.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:03:12 EST 2010

% Result   : Theorem 108.91s
% Output   : Solution 117.22s
% 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/SystemOnTPTP22177/SET768+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% not found
% Adding ~C to TBU       ... ~thIII04:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... equivalence:
%  CSA axiom equivalence found
% Looking for CSA axiom ... equivalence_class:
%  CSA axiom equivalence_class found
% Looking for CSA axiom ... equal_set:
%  CSA axiom equal_set found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... pre_order:
%  CSA axiom pre_order found
% Looking for CSA axiom ... subset:
%  CSA axiom subset found
% Looking for CSA axiom ... power_set:
%  CSA axiom power_set found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT   ... 
% no
% Looking for TBU UNS   ... 
% yes - theorem proved
% ---- Selection completed
% Selected axioms are   ... :power_set:subset:pre_order:equal_set:equivalence_class:equivalence (6)
% Unselected axioms are ... :singleton:unordered_pair:partition:intersection:union:empty_set:difference:sum:product:disjoint (10)
% SZS status THM for /tmp/SystemOnTPTP22177/SET768+4.tptp
% Looking for THM       ... 
% found
% SZS output start Solution for /tmp/SystemOnTPTP22177/SET768+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 23549
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.95 CPU 2.02 WC
% PrfWatch: 3.94 CPU 4.03 WC
% PrfWatch: 5.93 CPU 6.04 WC
% # Preprocessing time     : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X2]:![X3]:(subset(X2,X3)<=>![X1]:(member(X1,X2)=>member(X1,X3))),file('/tmp/SRASS.s.p', subset)).
% fof(4, axiom,![X2]:![X3]:(equal_set(X2,X3)<=>(subset(X2,X3)&subset(X3,X2))),file('/tmp/SRASS.s.p', equal_set)).
% fof(5, axiom,![X4]:![X5]:![X2]:![X1]:(member(X1,equivalence_class(X2,X5,X4))<=>(member(X1,X5)&apply(X4,X2,X1))),file('/tmp/SRASS.s.p', equivalence_class)).
% fof(6, axiom,![X2]:![X4]:(equivalence(X4,X2)<=>((![X1]:(member(X1,X2)=>apply(X4,X1,X1))&![X1]:![X6]:((member(X1,X2)&member(X6,X2))=>(apply(X4,X1,X6)=>apply(X4,X6,X1))))&![X1]:![X6]:![X7]:(((member(X1,X2)&member(X6,X2))&member(X7,X2))=>((apply(X4,X1,X6)&apply(X4,X6,X7))=>apply(X4,X1,X7))))),file('/tmp/SRASS.s.p', equivalence)).
% fof(7, conjecture,![X5]:![X4]:![X2]:![X3]:(((equivalence(X4,X5)&member(X2,X5))&member(X3,X5))=>(equal_set(equivalence_class(X2,X5,X4),equivalence_class(X3,X5,X4))<=>apply(X4,X2,X3))),file('/tmp/SRASS.s.p', thIII04)).
% fof(8, negated_conjecture,~(![X5]:![X4]:![X2]:![X3]:(((equivalence(X4,X5)&member(X2,X5))&member(X3,X5))=>(equal_set(equivalence_class(X2,X5,X4),equivalence_class(X3,X5,X4))<=>apply(X4,X2,X3)))),inference(assume_negation,[status(cth)],[7])).
% fof(9, plain,![X2]:![X4]:(epred1_2(X4,X2)<=>((![X1]:(member(X1,X2)=>apply(X4,X1,X1))&![X1]:![X6]:((member(X1,X2)&member(X6,X2))=>(apply(X4,X1,X6)=>apply(X4,X6,X1))))&![X1]:![X6]:![X7]:(((member(X1,X2)&member(X6,X2))&member(X7,X2))=>((apply(X4,X1,X6)&apply(X4,X6,X7))=>apply(X4,X1,X7))))),introduced(definition)).
% fof(10, plain,![X2]:![X4]:(equivalence(X4,X2)<=>epred1_2(X4,X2)),inference(apply_def,[status(esa)],[6,9,theory(equality)])).
% fof(15, plain,![X2]:![X3]:((~(subset(X2,X3))|![X1]:(~(member(X1,X2))|member(X1,X3)))&(?[X1]:(member(X1,X2)&~(member(X1,X3)))|subset(X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(16, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&(?[X7]:(member(X7,X4)&~(member(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[15])).
% fof(17, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[16])).
% fof(18, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[17])).
% fof(19, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(member(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[18])).
% cnf(20,plain,(subset(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[19])).
% cnf(21,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[19])).
% cnf(22,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(42, plain,![X2]:![X3]:((~(equal_set(X2,X3))|(subset(X2,X3)&subset(X3,X2)))&((~(subset(X2,X3))|~(subset(X3,X2)))|equal_set(X2,X3))),inference(fof_nnf,[status(thm)],[4])).
% fof(43, plain,![X4]:![X5]:((~(equal_set(X4,X5))|(subset(X4,X5)&subset(X5,X4)))&((~(subset(X4,X5))|~(subset(X5,X4)))|equal_set(X4,X5))),inference(variable_rename,[status(thm)],[42])).
% fof(44, plain,![X4]:![X5]:(((subset(X4,X5)|~(equal_set(X4,X5)))&(subset(X5,X4)|~(equal_set(X4,X5))))&((~(subset(X4,X5))|~(subset(X5,X4)))|equal_set(X4,X5))),inference(distribute,[status(thm)],[43])).
% cnf(45,plain,(equal_set(X1,X2)|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[44])).
% cnf(46,plain,(subset(X2,X1)|~equal_set(X1,X2)),inference(split_conjunct,[status(thm)],[44])).
% fof(48, plain,![X4]:![X5]:![X2]:![X1]:((~(member(X1,equivalence_class(X2,X5,X4)))|(member(X1,X5)&apply(X4,X2,X1)))&((~(member(X1,X5))|~(apply(X4,X2,X1)))|member(X1,equivalence_class(X2,X5,X4)))),inference(fof_nnf,[status(thm)],[5])).
% fof(49, plain,![X6]:![X7]:![X8]:![X9]:((~(member(X9,equivalence_class(X8,X7,X6)))|(member(X9,X7)&apply(X6,X8,X9)))&((~(member(X9,X7))|~(apply(X6,X8,X9)))|member(X9,equivalence_class(X8,X7,X6)))),inference(variable_rename,[status(thm)],[48])).
% fof(50, plain,![X6]:![X7]:![X8]:![X9]:(((member(X9,X7)|~(member(X9,equivalence_class(X8,X7,X6))))&(apply(X6,X8,X9)|~(member(X9,equivalence_class(X8,X7,X6)))))&((~(member(X9,X7))|~(apply(X6,X8,X9)))|member(X9,equivalence_class(X8,X7,X6)))),inference(distribute,[status(thm)],[49])).
% cnf(51,plain,(member(X1,equivalence_class(X2,X3,X4))|~apply(X4,X2,X1)|~member(X1,X3)),inference(split_conjunct,[status(thm)],[50])).
% cnf(52,plain,(apply(X4,X2,X1)|~member(X1,equivalence_class(X2,X3,X4))),inference(split_conjunct,[status(thm)],[50])).
% cnf(53,plain,(member(X1,X3)|~member(X1,equivalence_class(X2,X3,X4))),inference(split_conjunct,[status(thm)],[50])).
% fof(54, plain,![X2]:![X4]:((~(equivalence(X4,X2))|epred1_2(X4,X2))&(~(epred1_2(X4,X2))|equivalence(X4,X2))),inference(fof_nnf,[status(thm)],[10])).
% fof(55, plain,![X5]:![X6]:((~(equivalence(X6,X5))|epred1_2(X6,X5))&(~(epred1_2(X6,X5))|equivalence(X6,X5))),inference(variable_rename,[status(thm)],[54])).
% cnf(57,plain,(epred1_2(X1,X2)|~equivalence(X1,X2)),inference(split_conjunct,[status(thm)],[55])).
% fof(58, negated_conjecture,?[X5]:?[X4]:?[X2]:?[X3]:(((equivalence(X4,X5)&member(X2,X5))&member(X3,X5))&((~(equal_set(equivalence_class(X2,X5,X4),equivalence_class(X3,X5,X4)))|~(apply(X4,X2,X3)))&(equal_set(equivalence_class(X2,X5,X4),equivalence_class(X3,X5,X4))|apply(X4,X2,X3)))),inference(fof_nnf,[status(thm)],[8])).
% fof(59, negated_conjecture,?[X6]:?[X7]:?[X8]:?[X9]:(((equivalence(X7,X6)&member(X8,X6))&member(X9,X6))&((~(equal_set(equivalence_class(X8,X6,X7),equivalence_class(X9,X6,X7)))|~(apply(X7,X8,X9)))&(equal_set(equivalence_class(X8,X6,X7),equivalence_class(X9,X6,X7))|apply(X7,X8,X9)))),inference(variable_rename,[status(thm)],[58])).
% fof(60, negated_conjecture,(((equivalence(esk7_0,esk6_0)&member(esk8_0,esk6_0))&member(esk9_0,esk6_0))&((~(equal_set(equivalence_class(esk8_0,esk6_0,esk7_0),equivalence_class(esk9_0,esk6_0,esk7_0)))|~(apply(esk7_0,esk8_0,esk9_0)))&(equal_set(equivalence_class(esk8_0,esk6_0,esk7_0),equivalence_class(esk9_0,esk6_0,esk7_0))|apply(esk7_0,esk8_0,esk9_0)))),inference(skolemize,[status(esa)],[59])).
% cnf(61,negated_conjecture,(apply(esk7_0,esk8_0,esk9_0)|equal_set(equivalence_class(esk8_0,esk6_0,esk7_0),equivalence_class(esk9_0,esk6_0,esk7_0))),inference(split_conjunct,[status(thm)],[60])).
% cnf(62,negated_conjecture,(~apply(esk7_0,esk8_0,esk9_0)|~equal_set(equivalence_class(esk8_0,esk6_0,esk7_0),equivalence_class(esk9_0,esk6_0,esk7_0))),inference(split_conjunct,[status(thm)],[60])).
% cnf(63,negated_conjecture,(member(esk9_0,esk6_0)),inference(split_conjunct,[status(thm)],[60])).
% cnf(64,negated_conjecture,(member(esk8_0,esk6_0)),inference(split_conjunct,[status(thm)],[60])).
% cnf(65,negated_conjecture,(equivalence(esk7_0,esk6_0)),inference(split_conjunct,[status(thm)],[60])).
% fof(66, plain,![X2]:![X4]:((~(epred1_2(X4,X2))|((![X1]:(~(member(X1,X2))|apply(X4,X1,X1))&![X1]:![X6]:((~(member(X1,X2))|~(member(X6,X2)))|(~(apply(X4,X1,X6))|apply(X4,X6,X1))))&![X1]:![X6]:![X7]:(((~(member(X1,X2))|~(member(X6,X2)))|~(member(X7,X2)))|((~(apply(X4,X1,X6))|~(apply(X4,X6,X7)))|apply(X4,X1,X7)))))&(((?[X1]:(member(X1,X2)&~(apply(X4,X1,X1)))|?[X1]:?[X6]:((member(X1,X2)&member(X6,X2))&(apply(X4,X1,X6)&~(apply(X4,X6,X1)))))|?[X1]:?[X6]:?[X7]:(((member(X1,X2)&member(X6,X2))&member(X7,X2))&((apply(X4,X1,X6)&apply(X4,X6,X7))&~(apply(X4,X1,X7)))))|epred1_2(X4,X2))),inference(fof_nnf,[status(thm)],[9])).
% fof(67, plain,![X8]:![X9]:((~(epred1_2(X9,X8))|((![X10]:(~(member(X10,X8))|apply(X9,X10,X10))&![X11]:![X12]:((~(member(X11,X8))|~(member(X12,X8)))|(~(apply(X9,X11,X12))|apply(X9,X12,X11))))&![X13]:![X14]:![X15]:(((~(member(X13,X8))|~(member(X14,X8)))|~(member(X15,X8)))|((~(apply(X9,X13,X14))|~(apply(X9,X14,X15)))|apply(X9,X13,X15)))))&(((?[X16]:(member(X16,X8)&~(apply(X9,X16,X16)))|?[X17]:?[X18]:((member(X17,X8)&member(X18,X8))&(apply(X9,X17,X18)&~(apply(X9,X18,X17)))))|?[X19]:?[X20]:?[X21]:(((member(X19,X8)&member(X20,X8))&member(X21,X8))&((apply(X9,X19,X20)&apply(X9,X20,X21))&~(apply(X9,X19,X21)))))|epred1_2(X9,X8))),inference(variable_rename,[status(thm)],[66])).
% fof(68, plain,![X8]:![X9]:((~(epred1_2(X9,X8))|((![X10]:(~(member(X10,X8))|apply(X9,X10,X10))&![X11]:![X12]:((~(member(X11,X8))|~(member(X12,X8)))|(~(apply(X9,X11,X12))|apply(X9,X12,X11))))&![X13]:![X14]:![X15]:(((~(member(X13,X8))|~(member(X14,X8)))|~(member(X15,X8)))|((~(apply(X9,X13,X14))|~(apply(X9,X14,X15)))|apply(X9,X13,X15)))))&((((member(esk10_2(X8,X9),X8)&~(apply(X9,esk10_2(X8,X9),esk10_2(X8,X9))))|((member(esk11_2(X8,X9),X8)&member(esk12_2(X8,X9),X8))&(apply(X9,esk11_2(X8,X9),esk12_2(X8,X9))&~(apply(X9,esk12_2(X8,X9),esk11_2(X8,X9))))))|(((member(esk13_2(X8,X9),X8)&member(esk14_2(X8,X9),X8))&member(esk15_2(X8,X9),X8))&((apply(X9,esk13_2(X8,X9),esk14_2(X8,X9))&apply(X9,esk14_2(X8,X9),esk15_2(X8,X9)))&~(apply(X9,esk13_2(X8,X9),esk15_2(X8,X9))))))|epred1_2(X9,X8))),inference(skolemize,[status(esa)],[67])).
% fof(69, plain,![X8]:![X9]:![X10]:![X11]:![X12]:![X13]:![X14]:![X15]:((((((~(member(X13,X8))|~(member(X14,X8)))|~(member(X15,X8)))|((~(apply(X9,X13,X14))|~(apply(X9,X14,X15)))|apply(X9,X13,X15)))&(((~(member(X11,X8))|~(member(X12,X8)))|(~(apply(X9,X11,X12))|apply(X9,X12,X11)))&(~(member(X10,X8))|apply(X9,X10,X10))))|~(epred1_2(X9,X8)))&((((member(esk10_2(X8,X9),X8)&~(apply(X9,esk10_2(X8,X9),esk10_2(X8,X9))))|((member(esk11_2(X8,X9),X8)&member(esk12_2(X8,X9),X8))&(apply(X9,esk11_2(X8,X9),esk12_2(X8,X9))&~(apply(X9,esk12_2(X8,X9),esk11_2(X8,X9))))))|(((member(esk13_2(X8,X9),X8)&member(esk14_2(X8,X9),X8))&member(esk15_2(X8,X9),X8))&((apply(X9,esk13_2(X8,X9),esk14_2(X8,X9))&apply(X9,esk14_2(X8,X9),esk15_2(X8,X9)))&~(apply(X9,esk13_2(X8,X9),esk15_2(X8,X9))))))|epred1_2(X9,X8))),inference(shift_quantors,[status(thm)],[68])).
% fof(70, plain,![X8]:![X9]:![X10]:![X11]:![X12]:![X13]:![X14]:![X15]:((((((~(member(X13,X8))|~(member(X14,X8)))|~(member(X15,X8)))|((~(apply(X9,X13,X14))|~(apply(X9,X14,X15)))|apply(X9,X13,X15)))|~(epred1_2(X9,X8)))&((((~(member(X11,X8))|~(member(X12,X8)))|(~(apply(X9,X11,X12))|apply(X9,X12,X11)))|~(epred1_2(X9,X8)))&((~(member(X10,X8))|apply(X9,X10,X10))|~(epred1_2(X9,X8)))))&((((((((member(esk13_2(X8,X9),X8)|(member(esk11_2(X8,X9),X8)|member(esk10_2(X8,X9),X8)))|epred1_2(X9,X8))&((member(esk14_2(X8,X9),X8)|(member(esk11_2(X8,X9),X8)|member(esk10_2(X8,X9),X8)))|epred1_2(X9,X8)))&((member(esk15_2(X8,X9),X8)|(member(esk11_2(X8,X9),X8)|member(esk10_2(X8,X9),X8)))|epred1_2(X9,X8)))&((((apply(X9,esk13_2(X8,X9),esk14_2(X8,X9))|(member(esk11_2(X8,X9),X8)|member(esk10_2(X8,X9),X8)))|epred1_2(X9,X8))&((apply(X9,esk14_2(X8,X9),esk15_2(X8,X9))|(member(esk11_2(X8,X9),X8)|member(esk10_2(X8,X9),X8)))|epred1_2(X9,X8)))&((~(apply(X9,esk13_2(X8,X9),esk15_2(X8,X9)))|(member(esk11_2(X8,X9),X8)|member(esk10_2(X8,X9),X8)))|epred1_2(X9,X8))))&(((((member(esk13_2(X8,X9),X8)|(member(esk12_2(X8,X9),X8)|member(esk10_2(X8,X9),X8)))|epred1_2(X9,X8))&((member(esk14_2(X8,X9),X8)|(member(esk12_2(X8,X9),X8)|member(esk10_2(X8,X9),X8)))|epred1_2(X9,X8)))&((member(esk15_2(X8,X9),X8)|(member(esk12_2(X8,X9),X8)|member(esk10_2(X8,X9),X8)))|epred1_2(X9,X8)))&((((apply(X9,esk13_2(X8,X9),esk14_2(X8,X9))|(member(esk12_2(X8,X9),X8)|member(esk10_2(X8,X9),X8)))|epred1_2(X9,X8))&((apply(X9,esk14_2(X8,X9),esk15_2(X8,X9))|(member(esk12_2(X8,X9),X8)|member(esk10_2(X8,X9),X8)))|epred1_2(X9,X8)))&((~(apply(X9,esk13_2(X8,X9),esk15_2(X8,X9)))|(member(esk12_2(X8,X9),X8)|member(esk10_2(X8,X9),X8)))|epred1_2(X9,X8)))))&((((((member(esk13_2(X8,X9),X8)|(apply(X9,esk11_2(X8,X9),esk12_2(X8,X9))|member(esk10_2(X8,X9),X8)))|epred1_2(X9,X8))&((member(esk14_2(X8,X9),X8)|(apply(X9,esk11_2(X8,X9),esk12_2(X8,X9))|member(esk10_2(X8,X9),X8)))|epred1_2(X9,X8)))&((member(esk15_2(X8,X9),X8)|(apply(X9,esk11_2(X8,X9),esk12_2(X8,X9))|member(esk10_2(X8,X9),X8)))|epred1_2(X9,X8)))&((((apply(X9,esk13_2(X8,X9),esk14_2(X8,X9))|(apply(X9,esk11_2(X8,X9),esk12_2(X8,X9))|member(esk10_2(X8,X9),X8)))|epred1_2(X9,X8))&((apply(X9,esk14_2(X8,X9),esk15_2(X8,X9))|(apply(X9,esk11_2(X8,X9),esk12_2(X8,X9))|member(esk10_2(X8,X9),X8)))|epred1_2(X9,X8)))&((~(apply(X9,esk13_2(X8,X9),esk15_2(X8,X9)))|(apply(X9,esk11_2(X8,X9),esk12_2(X8,X9))|member(esk10_2(X8,X9),X8)))|epred1_2(X9,X8))))&(((((member(esk13_2(X8,X9),X8)|(~(apply(X9,esk12_2(X8,X9),esk11_2(X8,X9)))|member(esk10_2(X8,X9),X8)))|epred1_2(X9,X8))&((member(esk14_2(X8,X9),X8)|(~(apply(X9,esk12_2(X8,X9),esk11_2(X8,X9)))|member(esk10_2(X8,X9),X8)))|epred1_2(X9,X8)))&((member(esk15_2(X8,X9),X8)|(~(apply(X9,esk12_2(X8,X9),esk11_2(X8,X9)))|member(esk10_2(X8,X9),X8)))|epred1_2(X9,X8)))&((((apply(X9,esk13_2(X8,X9),esk14_2(X8,X9))|(~(apply(X9,esk12_2(X8,X9),esk11_2(X8,X9)))|member(esk10_2(X8,X9),X8)))|epred1_2(X9,X8))&((apply(X9,esk14_2(X8,X9),esk15_2(X8,X9))|(~(apply(X9,esk12_2(X8,X9),esk11_2(X8,X9)))|member(esk10_2(X8,X9),X8)))|epred1_2(X9,X8)))&((~(apply(X9,esk13_2(X8,X9),esk15_2(X8,X9)))|(~(apply(X9,esk12_2(X8,X9),esk11_2(X8,X9)))|member(esk10_2(X8,X9),X8)))|epred1_2(X9,X8))))))&(((((((member(esk13_2(X8,X9),X8)|(member(esk11_2(X8,X9),X8)|~(apply(X9,esk10_2(X8,X9),esk10_2(X8,X9)))))|epred1_2(X9,X8))&((member(esk14_2(X8,X9),X8)|(member(esk11_2(X8,X9),X8)|~(apply(X9,esk10_2(X8,X9),esk10_2(X8,X9)))))|epred1_2(X9,X8)))&((member(esk15_2(X8,X9),X8)|(member(esk11_2(X8,X9),X8)|~(apply(X9,esk10_2(X8,X9),esk10_2(X8,X9)))))|epred1_2(X9,X8)))&((((apply(X9,esk13_2(X8,X9),esk14_2(X8,X9))|(member(esk11_2(X8,X9),X8)|~(apply(X9,esk10_2(X8,X9),esk10_2(X8,X9)))))|epred1_2(X9,X8))&((apply(X9,esk14_2(X8,X9),esk15_2(X8,X9))|(member(esk11_2(X8,X9),X8)|~(apply(X9,esk10_2(X8,X9),esk10_2(X8,X9)))))|epred1_2(X9,X8)))&((~(apply(X9,esk13_2(X8,X9),esk15_2(X8,X9)))|(member(esk11_2(X8,X9),X8)|~(apply(X9,esk10_2(X8,X9),esk10_2(X8,X9)))))|epred1_2(X9,X8))))&(((((member(esk13_2(X8,X9),X8)|(member(esk12_2(X8,X9),X8)|~(apply(X9,esk10_2(X8,X9),esk10_2(X8,X9)))))|epred1_2(X9,X8))&((member(esk14_2(X8,X9),X8)|(member(esk12_2(X8,X9),X8)|~(apply(X9,esk10_2(X8,X9),esk10_2(X8,X9)))))|epred1_2(X9,X8)))&((member(esk15_2(X8,X9),X8)|(member(esk12_2(X8,X9),X8)|~(apply(X9,esk10_2(X8,X9),esk10_2(X8,X9)))))|epred1_2(X9,X8)))&((((apply(X9,esk13_2(X8,X9),esk14_2(X8,X9))|(member(esk12_2(X8,X9),X8)|~(apply(X9,esk10_2(X8,X9),esk10_2(X8,X9)))))|epred1_2(X9,X8))&((apply(X9,esk14_2(X8,X9),esk15_2(X8,X9))|(member(esk12_2(X8,X9),X8)|~(apply(X9,esk10_2(X8,X9),esk10_2(X8,X9)))))|epred1_2(X9,X8)))&((~(apply(X9,esk13_2(X8,X9),esk15_2(X8,X9)))|(member(esk12_2(X8,X9),X8)|~(apply(X9,esk10_2(X8,X9),esk10_2(X8,X9)))))|epred1_2(X9,X8)))))&((((((member(esk13_2(X8,X9),X8)|(apply(X9,esk11_2(X8,X9),esk12_2(X8,X9))|~(apply(X9,esk10_2(X8,X9),esk10_2(X8,X9)))))|epred1_2(X9,X8))&((member(esk14_2(X8,X9),X8)|(apply(X9,esk11_2(X8,X9),esk12_2(X8,X9))|~(apply(X9,esk10_2(X8,X9),esk10_2(X8,X9)))))|epred1_2(X9,X8)))&((member(esk15_2(X8,X9),X8)|(apply(X9,esk11_2(X8,X9),esk12_2(X8,X9))|~(apply(X9,esk10_2(X8,X9),esk10_2(X8,X9)))))|epred1_2(X9,X8)))&((((apply(X9,esk13_2(X8,X9),esk14_2(X8,X9))|(apply(X9,esk11_2(X8,X9),esk12_2(X8,X9))|~(apply(X9,esk10_2(X8,X9),esk10_2(X8,X9)))))|epred1_2(X9,X8))&((apply(X9,esk14_2(X8,X9),esk15_2(X8,X9))|(apply(X9,esk11_2(X8,X9),esk12_2(X8,X9))|~(apply(X9,esk10_2(X8,X9),esk10_2(X8,X9)))))|epred1_2(X9,X8)))&((~(apply(X9,esk13_2(X8,X9),esk15_2(X8,X9)))|(apply(X9,esk11_2(X8,X9),esk12_2(X8,X9))|~(apply(X9,esk10_2(X8,X9),esk10_2(X8,X9)))))|epred1_2(X9,X8))))&(((((member(esk13_2(X8,X9),X8)|(~(apply(X9,esk12_2(X8,X9),esk11_2(X8,X9)))|~(apply(X9,esk10_2(X8,X9),esk10_2(X8,X9)))))|epred1_2(X9,X8))&((member(esk14_2(X8,X9),X8)|(~(apply(X9,esk12_2(X8,X9),esk11_2(X8,X9)))|~(apply(X9,esk10_2(X8,X9),esk10_2(X8,X9)))))|epred1_2(X9,X8)))&((member(esk15_2(X8,X9),X8)|(~(apply(X9,esk12_2(X8,X9),esk11_2(X8,X9)))|~(apply(X9,esk10_2(X8,X9),esk10_2(X8,X9)))))|epred1_2(X9,X8)))&((((apply(X9,esk13_2(X8,X9),esk14_2(X8,X9))|(~(apply(X9,esk12_2(X8,X9),esk11_2(X8,X9)))|~(apply(X9,esk10_2(X8,X9),esk10_2(X8,X9)))))|epred1_2(X9,X8))&((apply(X9,esk14_2(X8,X9),esk15_2(X8,X9))|(~(apply(X9,esk12_2(X8,X9),esk11_2(X8,X9)))|~(apply(X9,esk10_2(X8,X9),esk10_2(X8,X9)))))|epred1_2(X9,X8)))&((~(apply(X9,esk13_2(X8,X9),esk15_2(X8,X9)))|(~(apply(X9,esk12_2(X8,X9),esk11_2(X8,X9)))|~(apply(X9,esk10_2(X8,X9),esk10_2(X8,X9)))))|epred1_2(X9,X8)))))))),inference(distribute,[status(thm)],[69])).
% cnf(119,plain,(apply(X1,X3,X3)|~epred1_2(X1,X2)|~member(X3,X2)),inference(split_conjunct,[status(thm)],[70])).
% cnf(120,plain,(apply(X1,X3,X4)|~epred1_2(X1,X2)|~apply(X1,X4,X3)|~member(X3,X2)|~member(X4,X2)),inference(split_conjunct,[status(thm)],[70])).
% cnf(121,plain,(apply(X1,X3,X4)|~epred1_2(X1,X2)|~apply(X1,X5,X4)|~apply(X1,X3,X5)|~member(X4,X2)|~member(X5,X2)|~member(X3,X2)),inference(split_conjunct,[status(thm)],[70])).
% cnf(122,negated_conjecture,(subset(equivalence_class(esk9_0,esk6_0,esk7_0),equivalence_class(esk8_0,esk6_0,esk7_0))|apply(esk7_0,esk8_0,esk9_0)),inference(spm,[status(thm)],[46,61,theory(equality)])).
% cnf(124,negated_conjecture,(epred1_2(esk7_0,esk6_0)),inference(spm,[status(thm)],[57,65,theory(equality)])).
% cnf(125,plain,(member(esk1_2(equivalence_class(X1,X2,X3),X4),X2)|subset(equivalence_class(X1,X2,X3),X4)),inference(spm,[status(thm)],[53,21,theory(equality)])).
% cnf(126,plain,(apply(X1,X2,esk1_2(equivalence_class(X2,X3,X1),X4))|subset(equivalence_class(X2,X3,X1),X4)),inference(spm,[status(thm)],[52,21,theory(equality)])).
% cnf(201,plain,(apply(esk7_0,X1,X1)|~member(X1,esk6_0)),inference(spm,[status(thm)],[119,124,theory(equality)])).
% cnf(220,negated_conjecture,(apply(esk7_0,esk9_0,esk9_0)),inference(spm,[status(thm)],[201,63,theory(equality)])).
% cnf(227,negated_conjecture,(member(esk9_0,equivalence_class(esk9_0,X1,esk7_0))|~member(esk9_0,X1)),inference(spm,[status(thm)],[51,220,theory(equality)])).
% cnf(233,negated_conjecture,(member(X1,equivalence_class(esk8_0,esk6_0,esk7_0))|apply(esk7_0,esk8_0,esk9_0)|~member(X1,equivalence_class(esk9_0,esk6_0,esk7_0))),inference(spm,[status(thm)],[22,122,theory(equality)])).
% cnf(240,negated_conjecture,(member(esk9_0,equivalence_class(esk9_0,esk6_0,esk7_0))),inference(spm,[status(thm)],[227,63,theory(equality)])).
% cnf(337,plain,(apply(X1,X2,esk1_2(equivalence_class(X3,X4,X1),X5))|subset(equivalence_class(X3,X4,X1),X5)|~epred1_2(X1,X6)|~apply(X1,X2,X3)|~member(X3,X6)|~member(esk1_2(equivalence_class(X3,X4,X1),X5),X6)|~member(X2,X6)),inference(spm,[status(thm)],[121,126,theory(equality)])).
% cnf(378,negated_conjecture,(apply(esk7_0,esk8_0,esk9_0)|member(esk9_0,equivalence_class(esk8_0,esk6_0,esk7_0))),inference(spm,[status(thm)],[233,240,theory(equality)])).
% cnf(385,negated_conjecture,(apply(esk7_0,esk8_0,esk9_0)),inference(csr,[status(thm)],[378,52])).
% cnf(388,plain,(apply(esk7_0,esk9_0,esk8_0)|~epred1_2(esk7_0,X1)|~member(esk8_0,X1)|~member(esk9_0,X1)),inference(spm,[status(thm)],[120,385,theory(equality)])).
% cnf(395,negated_conjecture,(~equal_set(equivalence_class(esk8_0,esk6_0,esk7_0),equivalence_class(esk9_0,esk6_0,esk7_0))|$false),inference(rw,[status(thm)],[62,385,theory(equality)])).
% cnf(396,negated_conjecture,(~equal_set(equivalence_class(esk8_0,esk6_0,esk7_0),equivalence_class(esk9_0,esk6_0,esk7_0))),inference(cn,[status(thm)],[395,theory(equality)])).
% cnf(520,negated_conjecture,(apply(esk7_0,esk9_0,esk8_0)|~member(esk8_0,esk6_0)|~member(esk9_0,esk6_0)),inference(spm,[status(thm)],[388,124,theory(equality)])).
% cnf(521,negated_conjecture,(apply(esk7_0,esk9_0,esk8_0)|$false|~member(esk9_0,esk6_0)),inference(rw,[status(thm)],[520,64,theory(equality)])).
% cnf(522,negated_conjecture,(apply(esk7_0,esk9_0,esk8_0)|$false|$false),inference(rw,[status(thm)],[521,63,theory(equality)])).
% cnf(523,negated_conjecture,(apply(esk7_0,esk9_0,esk8_0)),inference(cn,[status(thm)],[522,theory(equality)])).
% cnf(5785,plain,(apply(X1,X2,esk1_2(equivalence_class(X3,X4,X1),X5))|subset(equivalence_class(X3,X4,X1),X5)|~epred1_2(X1,X4)|~apply(X1,X2,X3)|~member(X3,X4)|~member(X2,X4)),inference(spm,[status(thm)],[337,125,theory(equality)])).
% cnf(54682,negated_conjecture,(apply(esk7_0,esk9_0,esk1_2(equivalence_class(esk8_0,X1,esk7_0),X2))|subset(equivalence_class(esk8_0,X1,esk7_0),X2)|~epred1_2(esk7_0,X1)|~member(esk8_0,X1)|~member(esk9_0,X1)),inference(spm,[status(thm)],[5785,523,theory(equality)])).
% cnf(54683,negated_conjecture,(apply(esk7_0,esk8_0,esk1_2(equivalence_class(esk9_0,X1,esk7_0),X2))|subset(equivalence_class(esk9_0,X1,esk7_0),X2)|~epred1_2(esk7_0,X1)|~member(esk9_0,X1)|~member(esk8_0,X1)),inference(spm,[status(thm)],[5785,385,theory(equality)])).
% cnf(107475,negated_conjecture,(apply(esk7_0,esk9_0,esk1_2(equivalence_class(esk8_0,esk6_0,esk7_0),X1))|subset(equivalence_class(esk8_0,esk6_0,esk7_0),X1)|~member(esk8_0,esk6_0)|~member(esk9_0,esk6_0)),inference(spm,[status(thm)],[54682,124,theory(equality)])).
% cnf(107476,negated_conjecture,(apply(esk7_0,esk9_0,esk1_2(equivalence_class(esk8_0,esk6_0,esk7_0),X1))|subset(equivalence_class(esk8_0,esk6_0,esk7_0),X1)|$false|~member(esk9_0,esk6_0)),inference(rw,[status(thm)],[107475,64,theory(equality)])).
% cnf(107477,negated_conjecture,(apply(esk7_0,esk9_0,esk1_2(equivalence_class(esk8_0,esk6_0,esk7_0),X1))|subset(equivalence_class(esk8_0,esk6_0,esk7_0),X1)|$false|$false),inference(rw,[status(thm)],[107476,63,theory(equality)])).
% cnf(107478,negated_conjecture,(apply(esk7_0,esk9_0,esk1_2(equivalence_class(esk8_0,esk6_0,esk7_0),X1))|subset(equivalence_class(esk8_0,esk6_0,esk7_0),X1)),inference(cn,[status(thm)],[107477,theory(equality)])).
% cnf(107509,negated_conjecture,(member(esk1_2(equivalence_class(esk8_0,esk6_0,esk7_0),X1),equivalence_class(esk9_0,X2,esk7_0))|subset(equivalence_class(esk8_0,esk6_0,esk7_0),X1)|~member(esk1_2(equivalence_class(esk8_0,esk6_0,esk7_0),X1),X2)),inference(spm,[status(thm)],[51,107478,theory(equality)])).
% cnf(107552,negated_conjecture,(apply(esk7_0,esk8_0,esk1_2(equivalence_class(esk9_0,esk6_0,esk7_0),X1))|subset(equivalence_class(esk9_0,esk6_0,esk7_0),X1)|~member(esk9_0,esk6_0)|~member(esk8_0,esk6_0)),inference(spm,[status(thm)],[54683,124,theory(equality)])).
% cnf(107553,negated_conjecture,(apply(esk7_0,esk8_0,esk1_2(equivalence_class(esk9_0,esk6_0,esk7_0),X1))|subset(equivalence_class(esk9_0,esk6_0,esk7_0),X1)|$false|~member(esk8_0,esk6_0)),inference(rw,[status(thm)],[107552,63,theory(equality)])).
% cnf(107554,negated_conjecture,(apply(esk7_0,esk8_0,esk1_2(equivalence_class(esk9_0,esk6_0,esk7_0),X1))|subset(equivalence_class(esk9_0,esk6_0,esk7_0),X1)|$false|$false),inference(rw,[status(thm)],[107553,64,theory(equality)])).
% cnf(107555,negated_conjecture,(apply(esk7_0,esk8_0,esk1_2(equivalence_class(esk9_0,esk6_0,esk7_0),X1))|subset(equivalence_class(esk9_0,esk6_0,esk7_0),X1)),inference(cn,[status(thm)],[107554,theory(equality)])).
% cnf(107586,negated_conjecture,(member(esk1_2(equivalence_class(esk9_0,esk6_0,esk7_0),X1),equivalence_class(esk8_0,X2,esk7_0))|subset(equivalence_class(esk9_0,esk6_0,esk7_0),X1)|~member(esk1_2(equivalence_class(esk9_0,esk6_0,esk7_0),X1),X2)),inference(spm,[status(thm)],[51,107555,theory(equality)])).
% cnf(143346,negated_conjecture,(subset(equivalence_class(esk8_0,esk6_0,esk7_0),X1)|member(esk1_2(equivalence_class(esk8_0,esk6_0,esk7_0),X1),equivalence_class(esk9_0,esk6_0,esk7_0))),inference(spm,[status(thm)],[107509,125,theory(equality)])).
% cnf(143393,negated_conjecture,(subset(equivalence_class(esk8_0,esk6_0,esk7_0),equivalence_class(esk9_0,esk6_0,esk7_0))),inference(spm,[status(thm)],[20,143346,theory(equality)])).
% cnf(152717,negated_conjecture,(subset(equivalence_class(esk9_0,esk6_0,esk7_0),X1)|member(esk1_2(equivalence_class(esk9_0,esk6_0,esk7_0),X1),equivalence_class(esk8_0,esk6_0,esk7_0))),inference(spm,[status(thm)],[107586,125,theory(equality)])).
% cnf(152789,negated_conjecture,(subset(equivalence_class(esk9_0,esk6_0,esk7_0),equivalence_class(esk8_0,esk6_0,esk7_0))),inference(spm,[status(thm)],[20,152717,theory(equality)])).
% cnf(152802,negated_conjecture,(equal_set(equivalence_class(esk8_0,esk6_0,esk7_0),equivalence_class(esk9_0,esk6_0,esk7_0))|~subset(equivalence_class(esk8_0,esk6_0,esk7_0),equivalence_class(esk9_0,esk6_0,esk7_0))),inference(spm,[status(thm)],[45,152789,theory(equality)])).
% cnf(152807,negated_conjecture,(equal_set(equivalence_class(esk8_0,esk6_0,esk7_0),equivalence_class(esk9_0,esk6_0,esk7_0))|$false),inference(rw,[status(thm)],[152802,143393,theory(equality)])).
% cnf(152808,negated_conjecture,(equal_set(equivalence_class(esk8_0,esk6_0,esk7_0),equivalence_class(esk9_0,esk6_0,esk7_0))),inference(cn,[status(thm)],[152807,theory(equality)])).
% cnf(152809,negated_conjecture,($false),inference(sr,[status(thm)],[152808,396,theory(equality)])).
% cnf(152810,negated_conjecture,($false),152809,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 8895
% # ...of these trivial                : 1322
% # ...subsumed                        : 3234
% # ...remaining for further processing: 4339
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 47
% # Backward-rewritten                 : 9
% # Generated clauses                  : 104395
% # ...of the previous two non-trivial : 57700
% # Contextual simplify-reflections    : 252
% # Paramodulations                    : 104395
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 4283
% #    Positive orientable unit clauses: 2605
% #    Positive unorientable unit clauses: 0
% #    Negative unit clauses           : 1
% #    Non-unit-clauses                : 1677
% # Current number of unprocessed clauses: 48631
% # ...number of literals in the above : 109605
% # Clause-clause subsumption calls (NU) : 138748
% # Rec. Clause-clause subsumption calls : 124859
% # Unit Clause-clause subsumption calls : 29112
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 760131
% # Indexed BW rewrite successes       : 3
% # Backwards rewriting index:   852 leaves,   8.49+/-54.431 terms/leaf
% # Paramod-from index:          248 leaves,  15.05+/-84.526 terms/leaf
% # Paramod-into index:          619 leaves,  10.82+/-63.638 terms/leaf
% # -------------------------------------------------
% # User time              : 6.045 s
% # System time            : 0.142 s
% # Total time             : 6.187 s
% # Maximum resident set size: 0 pages
% PrfWatch: 7.64 CPU 7.75 WC
% FINAL PrfWatch: 7.64 CPU 7.75 WC
% SZS output end Solution for /tmp/SystemOnTPTP22177/SET768+4.tptp
% 
%------------------------------------------------------------------------------