%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET809+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 : art04.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:10:35 EST 2010
% Result : Theorem 0.94s
% Output : Solution 0.94s
% 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/SystemOnTPTP29546/SET809+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29546/SET809+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29546/SET809+4.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 29642
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X3]:![X4]:(apply(member_predicate,X3,X4)<=>member(X3,X4)),file('/tmp/SRASS.s.p', rel_member)).
% fof(4, axiom,![X5]:![X6]:(strict_well_order(X5,X6)<=>(strict_order(X5,X6)&![X1]:((subset(X1,X6)&?[X3]:member(X3,X1))=>?[X4]:least(X4,X5,X1)))),file('/tmp/SRASS.s.p', strict_well_order)).
% fof(6, axiom,![X1]:(member(X1,on)<=>((set(X1)&strict_well_order(member_predicate,X1))&![X3]:(member(X3,X1)=>subset(X3,X1)))),file('/tmp/SRASS.s.p', ordinal_number)).
% fof(9, axiom,![X5]:![X6]:(strict_order(X5,X6)<=>(![X3]:![X4]:((member(X3,X6)&member(X4,X6))=>~((apply(X5,X3,X4)&apply(X5,X4,X3))))&![X3]:![X4]:![X7]:(((member(X3,X6)&member(X4,X6))&member(X7,X6))=>((apply(X5,X3,X4)&apply(X5,X4,X7))=>apply(X5,X3,X7))))),file('/tmp/SRASS.s.p', strict_order)).
% fof(20, conjecture,![X1]:(member(X1,on)=>~(member(X1,X1))),file('/tmp/SRASS.s.p', thV2)).
% fof(21, negated_conjecture,~(![X1]:(member(X1,on)=>~(member(X1,X1)))),inference(assume_negation,[status(cth)],[20])).
% fof(24, negated_conjecture,~(![X1]:(member(X1,on)=>~(member(X1,X1)))),inference(fof_simplification,[status(thm)],[21,theory(equality)])).
% fof(37, plain,![X3]:![X4]:((~(apply(member_predicate,X3,X4))|member(X3,X4))&(~(member(X3,X4))|apply(member_predicate,X3,X4))),inference(fof_nnf,[status(thm)],[3])).
% fof(38, plain,![X5]:![X6]:((~(apply(member_predicate,X5,X6))|member(X5,X6))&(~(member(X5,X6))|apply(member_predicate,X5,X6))),inference(variable_rename,[status(thm)],[37])).
% cnf(39,plain,(apply(member_predicate,X1,X2)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[38])).
% fof(41, plain,![X5]:![X6]:((~(strict_well_order(X5,X6))|(strict_order(X5,X6)&![X1]:((~(subset(X1,X6))|![X3]:~(member(X3,X1)))|?[X4]:least(X4,X5,X1))))&((~(strict_order(X5,X6))|?[X1]:((subset(X1,X6)&?[X3]:member(X3,X1))&![X4]:~(least(X4,X5,X1))))|strict_well_order(X5,X6))),inference(fof_nnf,[status(thm)],[4])).
% fof(42, plain,![X7]:![X8]:((~(strict_well_order(X7,X8))|(strict_order(X7,X8)&![X9]:((~(subset(X9,X8))|![X10]:~(member(X10,X9)))|?[X11]:least(X11,X7,X9))))&((~(strict_order(X7,X8))|?[X12]:((subset(X12,X8)&?[X13]:member(X13,X12))&![X14]:~(least(X14,X7,X12))))|strict_well_order(X7,X8))),inference(variable_rename,[status(thm)],[41])).
% fof(43, plain,![X7]:![X8]:((~(strict_well_order(X7,X8))|(strict_order(X7,X8)&![X9]:((~(subset(X9,X8))|![X10]:~(member(X10,X9)))|least(esk2_3(X7,X8,X9),X7,X9))))&((~(strict_order(X7,X8))|((subset(esk3_2(X7,X8),X8)&member(esk4_2(X7,X8),esk3_2(X7,X8)))&![X14]:~(least(X14,X7,esk3_2(X7,X8)))))|strict_well_order(X7,X8))),inference(skolemize,[status(esa)],[42])).
% fof(44, plain,![X7]:![X8]:![X9]:![X10]:![X14]:((((~(least(X14,X7,esk3_2(X7,X8)))&(subset(esk3_2(X7,X8),X8)&member(esk4_2(X7,X8),esk3_2(X7,X8))))|~(strict_order(X7,X8)))|strict_well_order(X7,X8))&((((~(member(X10,X9))|~(subset(X9,X8)))|least(esk2_3(X7,X8,X9),X7,X9))&strict_order(X7,X8))|~(strict_well_order(X7,X8)))),inference(shift_quantors,[status(thm)],[43])).
% fof(45, plain,![X7]:![X8]:![X9]:![X10]:![X14]:((((~(least(X14,X7,esk3_2(X7,X8)))|~(strict_order(X7,X8)))|strict_well_order(X7,X8))&(((subset(esk3_2(X7,X8),X8)|~(strict_order(X7,X8)))|strict_well_order(X7,X8))&((member(esk4_2(X7,X8),esk3_2(X7,X8))|~(strict_order(X7,X8)))|strict_well_order(X7,X8))))&((((~(member(X10,X9))|~(subset(X9,X8)))|least(esk2_3(X7,X8,X9),X7,X9))|~(strict_well_order(X7,X8)))&(strict_order(X7,X8)|~(strict_well_order(X7,X8))))),inference(distribute,[status(thm)],[44])).
% cnf(46,plain,(strict_order(X1,X2)|~strict_well_order(X1,X2)),inference(split_conjunct,[status(thm)],[45])).
% fof(55, plain,![X1]:((~(member(X1,on))|((set(X1)&strict_well_order(member_predicate,X1))&![X3]:(~(member(X3,X1))|subset(X3,X1))))&(((~(set(X1))|~(strict_well_order(member_predicate,X1)))|?[X3]:(member(X3,X1)&~(subset(X3,X1))))|member(X1,on))),inference(fof_nnf,[status(thm)],[6])).
% fof(56, plain,![X4]:((~(member(X4,on))|((set(X4)&strict_well_order(member_predicate,X4))&![X5]:(~(member(X5,X4))|subset(X5,X4))))&(((~(set(X4))|~(strict_well_order(member_predicate,X4)))|?[X6]:(member(X6,X4)&~(subset(X6,X4))))|member(X4,on))),inference(variable_rename,[status(thm)],[55])).
% fof(57, plain,![X4]:((~(member(X4,on))|((set(X4)&strict_well_order(member_predicate,X4))&![X5]:(~(member(X5,X4))|subset(X5,X4))))&(((~(set(X4))|~(strict_well_order(member_predicate,X4)))|(member(esk5_1(X4),X4)&~(subset(esk5_1(X4),X4))))|member(X4,on))),inference(skolemize,[status(esa)],[56])).
% fof(58, plain,![X4]:![X5]:((((~(member(X5,X4))|subset(X5,X4))&(set(X4)&strict_well_order(member_predicate,X4)))|~(member(X4,on)))&(((~(set(X4))|~(strict_well_order(member_predicate,X4)))|(member(esk5_1(X4),X4)&~(subset(esk5_1(X4),X4))))|member(X4,on))),inference(shift_quantors,[status(thm)],[57])).
% fof(59, plain,![X4]:![X5]:((((~(member(X5,X4))|subset(X5,X4))|~(member(X4,on)))&((set(X4)|~(member(X4,on)))&(strict_well_order(member_predicate,X4)|~(member(X4,on)))))&(((member(esk5_1(X4),X4)|(~(set(X4))|~(strict_well_order(member_predicate,X4))))|member(X4,on))&((~(subset(esk5_1(X4),X4))|(~(set(X4))|~(strict_well_order(member_predicate,X4))))|member(X4,on)))),inference(distribute,[status(thm)],[58])).
% cnf(62,plain,(strict_well_order(member_predicate,X1)|~member(X1,on)),inference(split_conjunct,[status(thm)],[59])).
% fof(77, plain,![X5]:![X6]:((~(strict_order(X5,X6))|(![X3]:![X4]:((~(member(X3,X6))|~(member(X4,X6)))|(~(apply(X5,X3,X4))|~(apply(X5,X4,X3))))&![X3]:![X4]:![X7]:(((~(member(X3,X6))|~(member(X4,X6)))|~(member(X7,X6)))|((~(apply(X5,X3,X4))|~(apply(X5,X4,X7)))|apply(X5,X3,X7)))))&((?[X3]:?[X4]:((member(X3,X6)&member(X4,X6))&(apply(X5,X3,X4)&apply(X5,X4,X3)))|?[X3]:?[X4]:?[X7]:(((member(X3,X6)&member(X4,X6))&member(X7,X6))&((apply(X5,X3,X4)&apply(X5,X4,X7))&~(apply(X5,X3,X7)))))|strict_order(X5,X6))),inference(fof_nnf,[status(thm)],[9])).
% fof(78, plain,![X8]:![X9]:((~(strict_order(X8,X9))|(![X10]:![X11]:((~(member(X10,X9))|~(member(X11,X9)))|(~(apply(X8,X10,X11))|~(apply(X8,X11,X10))))&![X12]:![X13]:![X14]:(((~(member(X12,X9))|~(member(X13,X9)))|~(member(X14,X9)))|((~(apply(X8,X12,X13))|~(apply(X8,X13,X14)))|apply(X8,X12,X14)))))&((?[X15]:?[X16]:((member(X15,X9)&member(X16,X9))&(apply(X8,X15,X16)&apply(X8,X16,X15)))|?[X17]:?[X18]:?[X19]:(((member(X17,X9)&member(X18,X9))&member(X19,X9))&((apply(X8,X17,X18)&apply(X8,X18,X19))&~(apply(X8,X17,X19)))))|strict_order(X8,X9))),inference(variable_rename,[status(thm)],[77])).
% fof(79, plain,![X8]:![X9]:((~(strict_order(X8,X9))|(![X10]:![X11]:((~(member(X10,X9))|~(member(X11,X9)))|(~(apply(X8,X10,X11))|~(apply(X8,X11,X10))))&![X12]:![X13]:![X14]:(((~(member(X12,X9))|~(member(X13,X9)))|~(member(X14,X9)))|((~(apply(X8,X12,X13))|~(apply(X8,X13,X14)))|apply(X8,X12,X14)))))&((((member(esk6_2(X8,X9),X9)&member(esk7_2(X8,X9),X9))&(apply(X8,esk6_2(X8,X9),esk7_2(X8,X9))&apply(X8,esk7_2(X8,X9),esk6_2(X8,X9))))|(((member(esk8_2(X8,X9),X9)&member(esk9_2(X8,X9),X9))&member(esk10_2(X8,X9),X9))&((apply(X8,esk8_2(X8,X9),esk9_2(X8,X9))&apply(X8,esk9_2(X8,X9),esk10_2(X8,X9)))&~(apply(X8,esk8_2(X8,X9),esk10_2(X8,X9))))))|strict_order(X8,X9))),inference(skolemize,[status(esa)],[78])).
% fof(80, plain,![X8]:![X9]:![X10]:![X11]:![X12]:![X13]:![X14]:((((((~(member(X12,X9))|~(member(X13,X9)))|~(member(X14,X9)))|((~(apply(X8,X12,X13))|~(apply(X8,X13,X14)))|apply(X8,X12,X14)))&((~(member(X10,X9))|~(member(X11,X9)))|(~(apply(X8,X10,X11))|~(apply(X8,X11,X10)))))|~(strict_order(X8,X9)))&((((member(esk6_2(X8,X9),X9)&member(esk7_2(X8,X9),X9))&(apply(X8,esk6_2(X8,X9),esk7_2(X8,X9))&apply(X8,esk7_2(X8,X9),esk6_2(X8,X9))))|(((member(esk8_2(X8,X9),X9)&member(esk9_2(X8,X9),X9))&member(esk10_2(X8,X9),X9))&((apply(X8,esk8_2(X8,X9),esk9_2(X8,X9))&apply(X8,esk9_2(X8,X9),esk10_2(X8,X9)))&~(apply(X8,esk8_2(X8,X9),esk10_2(X8,X9))))))|strict_order(X8,X9))),inference(shift_quantors,[status(thm)],[79])).
% fof(81, plain,![X8]:![X9]:![X10]:![X11]:![X12]:![X13]:![X14]:((((((~(member(X12,X9))|~(member(X13,X9)))|~(member(X14,X9)))|((~(apply(X8,X12,X13))|~(apply(X8,X13,X14)))|apply(X8,X12,X14)))|~(strict_order(X8,X9)))&(((~(member(X10,X9))|~(member(X11,X9)))|(~(apply(X8,X10,X11))|~(apply(X8,X11,X10))))|~(strict_order(X8,X9))))&(((((((member(esk8_2(X8,X9),X9)|member(esk6_2(X8,X9),X9))|strict_order(X8,X9))&((member(esk9_2(X8,X9),X9)|member(esk6_2(X8,X9),X9))|strict_order(X8,X9)))&((member(esk10_2(X8,X9),X9)|member(esk6_2(X8,X9),X9))|strict_order(X8,X9)))&((((apply(X8,esk8_2(X8,X9),esk9_2(X8,X9))|member(esk6_2(X8,X9),X9))|strict_order(X8,X9))&((apply(X8,esk9_2(X8,X9),esk10_2(X8,X9))|member(esk6_2(X8,X9),X9))|strict_order(X8,X9)))&((~(apply(X8,esk8_2(X8,X9),esk10_2(X8,X9)))|member(esk6_2(X8,X9),X9))|strict_order(X8,X9))))&(((((member(esk8_2(X8,X9),X9)|member(esk7_2(X8,X9),X9))|strict_order(X8,X9))&((member(esk9_2(X8,X9),X9)|member(esk7_2(X8,X9),X9))|strict_order(X8,X9)))&((member(esk10_2(X8,X9),X9)|member(esk7_2(X8,X9),X9))|strict_order(X8,X9)))&((((apply(X8,esk8_2(X8,X9),esk9_2(X8,X9))|member(esk7_2(X8,X9),X9))|strict_order(X8,X9))&((apply(X8,esk9_2(X8,X9),esk10_2(X8,X9))|member(esk7_2(X8,X9),X9))|strict_order(X8,X9)))&((~(apply(X8,esk8_2(X8,X9),esk10_2(X8,X9)))|member(esk7_2(X8,X9),X9))|strict_order(X8,X9)))))&((((((member(esk8_2(X8,X9),X9)|apply(X8,esk6_2(X8,X9),esk7_2(X8,X9)))|strict_order(X8,X9))&((member(esk9_2(X8,X9),X9)|apply(X8,esk6_2(X8,X9),esk7_2(X8,X9)))|strict_order(X8,X9)))&((member(esk10_2(X8,X9),X9)|apply(X8,esk6_2(X8,X9),esk7_2(X8,X9)))|strict_order(X8,X9)))&((((apply(X8,esk8_2(X8,X9),esk9_2(X8,X9))|apply(X8,esk6_2(X8,X9),esk7_2(X8,X9)))|strict_order(X8,X9))&((apply(X8,esk9_2(X8,X9),esk10_2(X8,X9))|apply(X8,esk6_2(X8,X9),esk7_2(X8,X9)))|strict_order(X8,X9)))&((~(apply(X8,esk8_2(X8,X9),esk10_2(X8,X9)))|apply(X8,esk6_2(X8,X9),esk7_2(X8,X9)))|strict_order(X8,X9))))&(((((member(esk8_2(X8,X9),X9)|apply(X8,esk7_2(X8,X9),esk6_2(X8,X9)))|strict_order(X8,X9))&((member(esk9_2(X8,X9),X9)|apply(X8,esk7_2(X8,X9),esk6_2(X8,X9)))|strict_order(X8,X9)))&((member(esk10_2(X8,X9),X9)|apply(X8,esk7_2(X8,X9),esk6_2(X8,X9)))|strict_order(X8,X9)))&((((apply(X8,esk8_2(X8,X9),esk9_2(X8,X9))|apply(X8,esk7_2(X8,X9),esk6_2(X8,X9)))|strict_order(X8,X9))&((apply(X8,esk9_2(X8,X9),esk10_2(X8,X9))|apply(X8,esk7_2(X8,X9),esk6_2(X8,X9)))|strict_order(X8,X9)))&((~(apply(X8,esk8_2(X8,X9),esk10_2(X8,X9)))|apply(X8,esk7_2(X8,X9),esk6_2(X8,X9)))|strict_order(X8,X9))))))),inference(distribute,[status(thm)],[80])).
% cnf(106,plain,(~strict_order(X1,X2)|~apply(X1,X3,X4)|~apply(X1,X4,X3)|~member(X3,X2)|~member(X4,X2)),inference(split_conjunct,[status(thm)],[81])).
% fof(168, negated_conjecture,?[X1]:(member(X1,on)&member(X1,X1)),inference(fof_nnf,[status(thm)],[24])).
% fof(169, negated_conjecture,?[X2]:(member(X2,on)&member(X2,X2)),inference(variable_rename,[status(thm)],[168])).
% fof(170, negated_conjecture,(member(esk14_0,on)&member(esk14_0,esk14_0)),inference(skolemize,[status(esa)],[169])).
% cnf(171,negated_conjecture,(member(esk14_0,esk14_0)),inference(split_conjunct,[status(thm)],[170])).
% cnf(172,negated_conjecture,(member(esk14_0,on)),inference(split_conjunct,[status(thm)],[170])).
% cnf(177,negated_conjecture,(strict_well_order(member_predicate,esk14_0)),inference(spm,[status(thm)],[62,172,theory(equality)])).
% cnf(178,negated_conjecture,(apply(member_predicate,esk14_0,esk14_0)),inference(spm,[status(thm)],[39,171,theory(equality)])).
% cnf(737,negated_conjecture,(strict_order(member_predicate,esk14_0)),inference(spm,[status(thm)],[46,177,theory(equality)])).
% cnf(739,negated_conjecture,(~strict_order(member_predicate,X1)|~apply(member_predicate,esk14_0,esk14_0)|~member(esk14_0,X1)),inference(spm,[status(thm)],[106,178,theory(equality)])).
% cnf(741,negated_conjecture,(~strict_order(member_predicate,X1)|$false|~member(esk14_0,X1)),inference(rw,[status(thm)],[739,178,theory(equality)])).
% cnf(742,negated_conjecture,(~strict_order(member_predicate,X1)|~member(esk14_0,X1)),inference(cn,[status(thm)],[741,theory(equality)])).
% cnf(857,negated_conjecture,(~strict_order(member_predicate,esk14_0)),inference(spm,[status(thm)],[742,171,theory(equality)])).
% cnf(861,negated_conjecture,($false),inference(rw,[status(thm)],[857,737,theory(equality)])).
% cnf(862,negated_conjecture,($false),inference(cn,[status(thm)],[861,theory(equality)])).
% cnf(863,negated_conjecture,($false),862,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 200
% # ...of these trivial : 11
% # ...subsumed : 2
% # ...remaining for further processing: 187
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 653
% # ...of the previous two non-trivial : 630
% # Contextual simplify-reflections : 0
% # Paramodulations : 650
% # Factorizations : 0
% # Equation resolutions : 3
% # Current number of processed clauses: 104
% # Positive orientable unit clauses: 22
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 79
% # Current number of unprocessed clauses: 590
% # ...number of literals in the above : 1959
% # Clause-clause subsumption calls (NU) : 146
% # Rec. Clause-clause subsumption calls : 95
% # Unit Clause-clause subsumption calls : 77
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 27
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 97 leaves, 1.48+/-1.309 terms/leaf
% # Paramod-from index: 44 leaves, 1.09+/-0.358 terms/leaf
% # Paramod-into index: 85 leaves, 1.33+/-0.726 terms/leaf
% # -------------------------------------------------
% # User time : 0.042 s
% # System time : 0.005 s
% # Total time : 0.047 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.22 WC
% FINAL PrfWatch: 0.14 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP29546/SET809+4.tptp
%
%------------------------------------------------------------------------------