%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU131+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 01:17:14 EST 2010
% Result : Theorem 1.14s
% Output : Solution 1.14s
% 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/SystemOnTPTP17877/SEU131+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17877/SEU131+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17877/SEU131+1.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 18009
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:set_difference(X1,empty_set)=X1,file('/tmp/SRASS.s.p', t3_boole)).
% fof(4, axiom,![X1]:(empty(X1)=>X1=empty_set),file('/tmp/SRASS.s.p', t6_boole)).
% fof(5, axiom,![X1]:![X2]:![X3]:(X3=set_difference(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)&~(in(X4,X2))))),file('/tmp/SRASS.s.p', d4_xboole_0)).
% fof(6, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(9, axiom,?[X1]:empty(X1),file('/tmp/SRASS.s.p', rc1_xboole_0)).
% fof(12, axiom,![X1]:![X2]:(![X3]:(in(X3,X1)<=>in(X3,X2))=>X1=X2),file('/tmp/SRASS.s.p', t2_tarski)).
% fof(13, axiom,![X1]:![X2]:~((in(X1,X2)&empty(X2))),file('/tmp/SRASS.s.p', t7_boole)).
% fof(16, conjecture,![X1]:![X2]:(set_difference(X1,X2)=empty_set<=>subset(X1,X2)),file('/tmp/SRASS.s.p', l32_xboole_1)).
% fof(17, negated_conjecture,~(![X1]:![X2]:(set_difference(X1,X2)=empty_set<=>subset(X1,X2))),inference(assume_negation,[status(cth)],[16])).
% fof(18, plain,![X1]:![X2]:![X3]:(X3=set_difference(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)&~(in(X4,X2))))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(23, plain,![X2]:set_difference(X2,empty_set)=X2,inference(variable_rename,[status(thm)],[2])).
% cnf(24,plain,(set_difference(X1,empty_set)=X1),inference(split_conjunct,[status(thm)],[23])).
% fof(27, plain,![X1]:(~(empty(X1))|X1=empty_set),inference(fof_nnf,[status(thm)],[4])).
% fof(28, plain,![X2]:(~(empty(X2))|X2=empty_set),inference(variable_rename,[status(thm)],[27])).
% cnf(29,plain,(X1=empty_set|~empty(X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X1]:![X2]:![X3]:((~(X3=set_difference(X1,X2))|![X4]:((~(in(X4,X3))|(in(X4,X1)&~(in(X4,X2))))&((~(in(X4,X1))|in(X4,X2))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|(~(in(X4,X1))|in(X4,X2)))&(in(X4,X3)|(in(X4,X1)&~(in(X4,X2)))))|X3=set_difference(X1,X2))),inference(fof_nnf,[status(thm)],[18])).
% fof(31, plain,![X5]:![X6]:![X7]:((~(X7=set_difference(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)&~(in(X8,X6))))&((~(in(X8,X5))|in(X8,X6))|in(X8,X7))))&(?[X9]:((~(in(X9,X7))|(~(in(X9,X5))|in(X9,X6)))&(in(X9,X7)|(in(X9,X5)&~(in(X9,X6)))))|X7=set_difference(X5,X6))),inference(variable_rename,[status(thm)],[30])).
% fof(32, plain,![X5]:![X6]:![X7]:((~(X7=set_difference(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)&~(in(X8,X6))))&((~(in(X8,X5))|in(X8,X6))|in(X8,X7))))&(((~(in(esk1_3(X5,X6,X7),X7))|(~(in(esk1_3(X5,X6,X7),X5))|in(esk1_3(X5,X6,X7),X6)))&(in(esk1_3(X5,X6,X7),X7)|(in(esk1_3(X5,X6,X7),X5)&~(in(esk1_3(X5,X6,X7),X6)))))|X7=set_difference(X5,X6))),inference(skolemize,[status(esa)],[31])).
% fof(33, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(in(X8,X5)&~(in(X8,X6))))&((~(in(X8,X5))|in(X8,X6))|in(X8,X7)))|~(X7=set_difference(X5,X6)))&(((~(in(esk1_3(X5,X6,X7),X7))|(~(in(esk1_3(X5,X6,X7),X5))|in(esk1_3(X5,X6,X7),X6)))&(in(esk1_3(X5,X6,X7),X7)|(in(esk1_3(X5,X6,X7),X5)&~(in(esk1_3(X5,X6,X7),X6)))))|X7=set_difference(X5,X6))),inference(shift_quantors,[status(thm)],[32])).
% fof(34, plain,![X5]:![X6]:![X7]:![X8]:(((((in(X8,X5)|~(in(X8,X7)))|~(X7=set_difference(X5,X6)))&((~(in(X8,X6))|~(in(X8,X7)))|~(X7=set_difference(X5,X6))))&(((~(in(X8,X5))|in(X8,X6))|in(X8,X7))|~(X7=set_difference(X5,X6))))&(((~(in(esk1_3(X5,X6,X7),X7))|(~(in(esk1_3(X5,X6,X7),X5))|in(esk1_3(X5,X6,X7),X6)))|X7=set_difference(X5,X6))&(((in(esk1_3(X5,X6,X7),X5)|in(esk1_3(X5,X6,X7),X7))|X7=set_difference(X5,X6))&((~(in(esk1_3(X5,X6,X7),X6))|in(esk1_3(X5,X6,X7),X7))|X7=set_difference(X5,X6))))),inference(distribute,[status(thm)],[33])).
% cnf(35,plain,(X1=set_difference(X2,X3)|in(esk1_3(X2,X3,X1),X1)|~in(esk1_3(X2,X3,X1),X3)),inference(split_conjunct,[status(thm)],[34])).
% cnf(36,plain,(X1=set_difference(X2,X3)|in(esk1_3(X2,X3,X1),X1)|in(esk1_3(X2,X3,X1),X2)),inference(split_conjunct,[status(thm)],[34])).
% cnf(38,plain,(in(X4,X1)|in(X4,X3)|X1!=set_difference(X2,X3)|~in(X4,X2)),inference(split_conjunct,[status(thm)],[34])).
% cnf(39,plain,(X1!=set_difference(X2,X3)|~in(X4,X1)|~in(X4,X3)),inference(split_conjunct,[status(thm)],[34])).
% cnf(40,plain,(in(X4,X2)|X1!=set_difference(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[34])).
% fof(41, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(in(X3,X1))|in(X3,X2)))&(?[X3]:(in(X3,X1)&~(in(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[6])).
% fof(42, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&(?[X7]:(in(X7,X4)&~(in(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[41])).
% fof(43, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk2_2(X4,X5),X4)&~(in(esk2_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[42])).
% fof(44, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk2_2(X4,X5),X4)&~(in(esk2_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[43])).
% fof(45, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk2_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk2_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[44])).
% cnf(46,plain,(subset(X1,X2)|~in(esk2_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[45])).
% cnf(47,plain,(subset(X1,X2)|in(esk2_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[45])).
% cnf(48,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[45])).
% fof(53, plain,?[X2]:empty(X2),inference(variable_rename,[status(thm)],[9])).
% fof(54, plain,empty(esk3_0),inference(skolemize,[status(esa)],[53])).
% cnf(55,plain,(empty(esk3_0)),inference(split_conjunct,[status(thm)],[54])).
% fof(62, plain,![X1]:![X2]:(?[X3]:((~(in(X3,X1))|~(in(X3,X2)))&(in(X3,X1)|in(X3,X2)))|X1=X2),inference(fof_nnf,[status(thm)],[12])).
% fof(63, plain,![X4]:![X5]:(?[X6]:((~(in(X6,X4))|~(in(X6,X5)))&(in(X6,X4)|in(X6,X5)))|X4=X5),inference(variable_rename,[status(thm)],[62])).
% fof(64, plain,![X4]:![X5]:(((~(in(esk5_2(X4,X5),X4))|~(in(esk5_2(X4,X5),X5)))&(in(esk5_2(X4,X5),X4)|in(esk5_2(X4,X5),X5)))|X4=X5),inference(skolemize,[status(esa)],[63])).
% fof(65, plain,![X4]:![X5]:(((~(in(esk5_2(X4,X5),X4))|~(in(esk5_2(X4,X5),X5)))|X4=X5)&((in(esk5_2(X4,X5),X4)|in(esk5_2(X4,X5),X5))|X4=X5)),inference(distribute,[status(thm)],[64])).
% cnf(66,plain,(X1=X2|in(esk5_2(X1,X2),X2)|in(esk5_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[65])).
% fof(68, plain,![X1]:![X2]:(~(in(X1,X2))|~(empty(X2))),inference(fof_nnf,[status(thm)],[13])).
% fof(69, plain,![X3]:![X4]:(~(in(X3,X4))|~(empty(X4))),inference(variable_rename,[status(thm)],[68])).
% cnf(70,plain,(~empty(X1)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[69])).
% fof(73, negated_conjecture,?[X1]:?[X2]:((~(set_difference(X1,X2)=empty_set)|~(subset(X1,X2)))&(set_difference(X1,X2)=empty_set|subset(X1,X2))),inference(fof_nnf,[status(thm)],[17])).
% fof(74, negated_conjecture,?[X3]:?[X4]:((~(set_difference(X3,X4)=empty_set)|~(subset(X3,X4)))&(set_difference(X3,X4)=empty_set|subset(X3,X4))),inference(variable_rename,[status(thm)],[73])).
% fof(75, negated_conjecture,((~(set_difference(esk6_0,esk7_0)=empty_set)|~(subset(esk6_0,esk7_0)))&(set_difference(esk6_0,esk7_0)=empty_set|subset(esk6_0,esk7_0))),inference(skolemize,[status(esa)],[74])).
% cnf(76,negated_conjecture,(subset(esk6_0,esk7_0)|set_difference(esk6_0,esk7_0)=empty_set),inference(split_conjunct,[status(thm)],[75])).
% cnf(77,negated_conjecture,(~subset(esk6_0,esk7_0)|set_difference(esk6_0,esk7_0)!=empty_set),inference(split_conjunct,[status(thm)],[75])).
% cnf(79,plain,(empty_set=esk3_0),inference(spm,[status(thm)],[29,55,theory(equality)])).
% cnf(88,plain,(in(X1,X2)|~in(X1,set_difference(X2,X3))),inference(er,[status(thm)],[40,theory(equality)])).
% cnf(92,plain,(~in(X1,X2)|~in(X1,set_difference(X3,X2))),inference(er,[status(thm)],[39,theory(equality)])).
% cnf(94,plain,(X1!=X2|~in(X3,empty_set)|~in(X3,X2)),inference(spm,[status(thm)],[39,24,theory(equality)])).
% cnf(95,plain,(~in(X1,empty_set)|~in(X1,X2)),inference(er,[status(thm)],[94,theory(equality)])).
% cnf(103,plain,(in(X1,X2)|in(X1,set_difference(X3,X2))|~in(X1,X3)),inference(er,[status(thm)],[38,theory(equality)])).
% cnf(114,plain,(set_difference(X1,X1)=X2|in(esk1_3(X1,X1,X2),X2)),inference(spm,[status(thm)],[35,36,theory(equality)])).
% cnf(125,plain,(~in(X1,esk3_0)|~in(X1,X2)),inference(rw,[status(thm)],[95,79,theory(equality)])).
% cnf(126,negated_conjecture,(set_difference(esk6_0,esk7_0)!=esk3_0|~subset(esk6_0,esk7_0)),inference(rw,[status(thm)],[77,79,theory(equality)])).
% cnf(127,negated_conjecture,(set_difference(esk6_0,esk7_0)=esk3_0|subset(esk6_0,esk7_0)),inference(rw,[status(thm)],[76,79,theory(equality)])).
% cnf(133,negated_conjecture,(in(X1,esk7_0)|set_difference(esk6_0,esk7_0)=esk3_0|~in(X1,esk6_0)),inference(spm,[status(thm)],[48,127,theory(equality)])).
% cnf(148,plain,(set_difference(X1,X2)=X3|in(esk5_2(set_difference(X1,X2),X3),X3)|~in(esk5_2(set_difference(X1,X2),X3),X2)),inference(spm,[status(thm)],[92,66,theory(equality)])).
% cnf(153,plain,(set_difference(X1,X1)=X2|~empty(X2)),inference(spm,[status(thm)],[70,114,theory(equality)])).
% cnf(172,plain,(set_difference(X1,X1)=esk3_0),inference(spm,[status(thm)],[153,55,theory(equality)])).
% cnf(174,plain,(in(X1,X2)|~in(X1,esk3_0)),inference(spm,[status(thm)],[88,172,theory(equality)])).
% cnf(246,plain,(~in(X1,esk3_0)),inference(csr,[status(thm)],[174,125])).
% cnf(247,plain,(X1=esk3_0|in(esk5_2(X1,esk3_0),X1)),inference(spm,[status(thm)],[246,66,theory(equality)])).
% cnf(309,plain,(in(esk5_2(set_difference(X1,X2),esk3_0),X1)|set_difference(X1,X2)=esk3_0),inference(spm,[status(thm)],[88,247,theory(equality)])).
% cnf(654,negated_conjecture,(set_difference(esk6_0,esk7_0)=esk3_0|in(esk5_2(set_difference(esk6_0,X1),esk3_0),esk7_0)|set_difference(esk6_0,X1)=esk3_0),inference(spm,[status(thm)],[133,309,theory(equality)])).
% cnf(704,negated_conjecture,(set_difference(esk6_0,esk7_0)=esk3_0|in(esk5_2(set_difference(esk6_0,esk7_0),esk3_0),esk3_0)),inference(spm,[status(thm)],[148,654,theory(equality)])).
% cnf(709,negated_conjecture,(set_difference(esk6_0,esk7_0)=esk3_0),inference(sr,[status(thm)],[704,246,theory(equality)])).
% cnf(716,negated_conjecture,(in(X1,esk3_0)|in(X1,esk7_0)|~in(X1,esk6_0)),inference(spm,[status(thm)],[103,709,theory(equality)])).
% cnf(743,negated_conjecture,($false|~subset(esk6_0,esk7_0)),inference(rw,[status(thm)],[126,709,theory(equality)])).
% cnf(744,negated_conjecture,(~subset(esk6_0,esk7_0)),inference(cn,[status(thm)],[743,theory(equality)])).
% cnf(746,negated_conjecture,(in(X1,esk7_0)|~in(X1,esk6_0)),inference(sr,[status(thm)],[716,246,theory(equality)])).
% cnf(761,negated_conjecture,(subset(X1,esk7_0)|~in(esk2_2(X1,esk7_0),esk6_0)),inference(spm,[status(thm)],[46,746,theory(equality)])).
% cnf(769,negated_conjecture,(subset(esk6_0,esk7_0)),inference(spm,[status(thm)],[761,47,theory(equality)])).
% cnf(770,negated_conjecture,($false),inference(sr,[status(thm)],[769,744,theory(equality)])).
% cnf(771,negated_conjecture,($false),770,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 232
% # ...of these trivial : 1
% # ...subsumed : 103
% # ...remaining for further processing: 128
% # Other redundant clauses eliminated : 12
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 7
% # Backward-rewritten : 24
% # Generated clauses : 507
% # ...of the previous two non-trivial : 395
% # Contextual simplify-reflections : 42
% # Paramodulations : 486
% # Factorizations : 4
% # Equation resolutions : 16
% # Current number of processed clauses: 73
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 7
% # Non-unit-clauses : 57
% # Current number of unprocessed clauses: 133
% # ...number of literals in the above : 400
% # Clause-clause subsumption calls (NU) : 498
% # Rec. Clause-clause subsumption calls : 458
% # Unit Clause-clause subsumption calls : 26
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 10
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 48 leaves, 1.62+/-1.235 terms/leaf
% # Paramod-from index: 19 leaves, 1.42+/-0.936 terms/leaf
% # Paramod-into index: 46 leaves, 1.52+/-1.078 terms/leaf
% # -------------------------------------------------
% # User time : 0.029 s
% # System time : 0.004 s
% # Total time : 0.033 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.21 WC
% FINAL PrfWatch: 0.14 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP17877/SEU131+1.tptp
%
%------------------------------------------------------------------------------