%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU145+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 : art07.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 01:17:16 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP20198/SEU145+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP20198/SEU145+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20198/SEU145+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 20294
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(4, axiom,![X1]:![X2]:(X2=singleton(X1)<=>![X3]:(in(X3,X2)<=>X3=X1)),file('/tmp/SRASS.s.p', d1_tarski)).
% 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(8, conjecture,![X1]:![X2]:![X3]:(subset(X1,X2)=>(in(X3,X1)|subset(X1,set_difference(X2,singleton(X3))))),file('/tmp/SRASS.s.p', l3_zfmisc_1)).
% fof(9, negated_conjecture,~(![X1]:![X2]:![X3]:(subset(X1,X2)=>(in(X3,X1)|subset(X1,set_difference(X2,singleton(X3)))))),inference(assume_negation,[status(cth)],[8])).
% fof(11, 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(15, 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)],[2])).
% fof(16, 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)],[15])).
% fof(17, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[16])).
% fof(18, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[17])).
% fof(19, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[18])).
% cnf(20,plain,(subset(X1,X2)|~in(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[19])).
% cnf(21,plain,(subset(X1,X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[19])).
% cnf(22,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(25, plain,![X1]:![X2]:((~(X2=singleton(X1))|![X3]:((~(in(X3,X2))|X3=X1)&(~(X3=X1)|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|~(X3=X1))&(in(X3,X2)|X3=X1))|X2=singleton(X1))),inference(fof_nnf,[status(thm)],[4])).
% fof(26, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(?[X7]:((~(in(X7,X5))|~(X7=X4))&(in(X7,X5)|X7=X4))|X5=singleton(X4))),inference(variable_rename,[status(thm)],[25])).
% fof(27, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(((~(in(esk2_2(X4,X5),X5))|~(esk2_2(X4,X5)=X4))&(in(esk2_2(X4,X5),X5)|esk2_2(X4,X5)=X4))|X5=singleton(X4))),inference(skolemize,[status(esa)],[26])).
% fof(28, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5)))|~(X5=singleton(X4)))&(((~(in(esk2_2(X4,X5),X5))|~(esk2_2(X4,X5)=X4))&(in(esk2_2(X4,X5),X5)|esk2_2(X4,X5)=X4))|X5=singleton(X4))),inference(shift_quantors,[status(thm)],[27])).
% fof(29, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)|~(X5=singleton(X4)))&((~(X6=X4)|in(X6,X5))|~(X5=singleton(X4))))&(((~(in(esk2_2(X4,X5),X5))|~(esk2_2(X4,X5)=X4))|X5=singleton(X4))&((in(esk2_2(X4,X5),X5)|esk2_2(X4,X5)=X4)|X5=singleton(X4)))),inference(distribute,[status(thm)],[28])).
% cnf(33,plain,(X3=X2|X1!=singleton(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[29])).
% fof(34, 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)],[11])).
% fof(35, 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)],[34])).
% fof(36, 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(esk3_3(X5,X6,X7),X7))|(~(in(esk3_3(X5,X6,X7),X5))|in(esk3_3(X5,X6,X7),X6)))&(in(esk3_3(X5,X6,X7),X7)|(in(esk3_3(X5,X6,X7),X5)&~(in(esk3_3(X5,X6,X7),X6)))))|X7=set_difference(X5,X6))),inference(skolemize,[status(esa)],[35])).
% fof(37, 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(esk3_3(X5,X6,X7),X7))|(~(in(esk3_3(X5,X6,X7),X5))|in(esk3_3(X5,X6,X7),X6)))&(in(esk3_3(X5,X6,X7),X7)|(in(esk3_3(X5,X6,X7),X5)&~(in(esk3_3(X5,X6,X7),X6)))))|X7=set_difference(X5,X6))),inference(shift_quantors,[status(thm)],[36])).
% fof(38, 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(esk3_3(X5,X6,X7),X7))|(~(in(esk3_3(X5,X6,X7),X5))|in(esk3_3(X5,X6,X7),X6)))|X7=set_difference(X5,X6))&(((in(esk3_3(X5,X6,X7),X5)|in(esk3_3(X5,X6,X7),X7))|X7=set_difference(X5,X6))&((~(in(esk3_3(X5,X6,X7),X6))|in(esk3_3(X5,X6,X7),X7))|X7=set_difference(X5,X6))))),inference(distribute,[status(thm)],[37])).
% cnf(42,plain,(in(X4,X1)|in(X4,X3)|X1!=set_difference(X2,X3)|~in(X4,X2)),inference(split_conjunct,[status(thm)],[38])).
% fof(47, negated_conjecture,?[X1]:?[X2]:?[X3]:(subset(X1,X2)&(~(in(X3,X1))&~(subset(X1,set_difference(X2,singleton(X3)))))),inference(fof_nnf,[status(thm)],[9])).
% fof(48, negated_conjecture,?[X4]:?[X5]:?[X6]:(subset(X4,X5)&(~(in(X6,X4))&~(subset(X4,set_difference(X5,singleton(X6)))))),inference(variable_rename,[status(thm)],[47])).
% fof(49, negated_conjecture,(subset(esk4_0,esk5_0)&(~(in(esk6_0,esk4_0))&~(subset(esk4_0,set_difference(esk5_0,singleton(esk6_0)))))),inference(skolemize,[status(esa)],[48])).
% cnf(50,negated_conjecture,(~subset(esk4_0,set_difference(esk5_0,singleton(esk6_0)))),inference(split_conjunct,[status(thm)],[49])).
% cnf(51,negated_conjecture,(~in(esk6_0,esk4_0)),inference(split_conjunct,[status(thm)],[49])).
% cnf(52,negated_conjecture,(subset(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[49])).
% cnf(62,plain,(X1=X2|~in(X2,singleton(X1))),inference(er,[status(thm)],[33,theory(equality)])).
% cnf(64,negated_conjecture,(in(X1,esk5_0)|~in(X1,esk4_0)),inference(spm,[status(thm)],[22,52,theory(equality)])).
% cnf(67,plain,(in(X1,set_difference(X2,X3))|in(X1,X3)|~in(X1,X2)),inference(er,[status(thm)],[42,theory(equality)])).
% cnf(80,negated_conjecture,(in(esk1_2(esk4_0,X1),esk5_0)|subset(esk4_0,X1)),inference(spm,[status(thm)],[64,21,theory(equality)])).
% cnf(133,negated_conjecture,(in(esk1_2(esk4_0,X1),set_difference(esk5_0,X2))|in(esk1_2(esk4_0,X1),X2)|subset(esk4_0,X1)),inference(spm,[status(thm)],[67,80,theory(equality)])).
% cnf(289,negated_conjecture,(subset(esk4_0,set_difference(esk5_0,X1))|in(esk1_2(esk4_0,set_difference(esk5_0,X1)),X1)),inference(spm,[status(thm)],[20,133,theory(equality)])).
% cnf(360,negated_conjecture,(X1=esk1_2(esk4_0,set_difference(esk5_0,singleton(X1)))|subset(esk4_0,set_difference(esk5_0,singleton(X1)))),inference(spm,[status(thm)],[62,289,theory(equality)])).
% cnf(381,negated_conjecture,(subset(esk4_0,set_difference(esk5_0,singleton(X1)))|in(X1,esk4_0)),inference(spm,[status(thm)],[21,360,theory(equality)])).
% cnf(398,negated_conjecture,(in(esk6_0,esk4_0)),inference(spm,[status(thm)],[50,381,theory(equality)])).
% cnf(399,negated_conjecture,($false),inference(sr,[status(thm)],[398,51,theory(equality)])).
% cnf(400,negated_conjecture,($false),399,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 110
% # ...of these trivial : 0
% # ...subsumed : 22
% # ...remaining for further processing: 88
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 304
% # ...of the previous two non-trivial : 257
% # Contextual simplify-reflections : 3
% # Paramodulations : 295
% # Factorizations : 2
% # Equation resolutions : 7
% # Current number of processed clauses: 87
% # Positive orientable unit clauses: 7
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 3
% # Non-unit-clauses : 77
% # Current number of unprocessed clauses: 165
% # ...number of literals in the above : 464
% # Clause-clause subsumption calls (NU) : 394
% # Rec. Clause-clause subsumption calls : 364
% # Unit Clause-clause subsumption calls : 23
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 88 leaves, 1.58+/-1.294 terms/leaf
% # Paramod-from index: 35 leaves, 1.26+/-0.602 terms/leaf
% # Paramod-into index: 81 leaves, 1.49+/-1.020 terms/leaf
% # -------------------------------------------------
% # User time : 0.020 s
% # System time : 0.004 s
% # Total time : 0.024 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP20198/SEU145+1.tptp
%
%------------------------------------------------------------------------------