%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU125+2 : 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:11:01 EST 2010
% Result : Theorem 1.04s
% Output : Solution 1.04s
% 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/SystemOnTPTP16571/SEU125+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16571/SEU125+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16571/SEU125+2.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 16667
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(7, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(15, axiom,![X1]:![X2]:![X3]:(X3=set_union2(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)|in(X4,X2)))),file('/tmp/SRASS.s.p', d2_xboole_0)).
% fof(32, conjecture,![X1]:![X2]:![X3]:((subset(X1,X2)&subset(X3,X2))=>subset(set_union2(X1,X3),X2)),file('/tmp/SRASS.s.p', t8_xboole_1)).
% fof(33, negated_conjecture,~(![X1]:![X2]:![X3]:((subset(X1,X2)&subset(X3,X2))=>subset(set_union2(X1,X3),X2))),inference(assume_negation,[status(cth)],[32])).
% fof(58, 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)],[7])).
% fof(59, 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)],[58])).
% fof(60, 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)],[59])).
% fof(61, 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)],[60])).
% fof(62, 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)],[61])).
% cnf(63,plain,(subset(X1,X2)|~in(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[62])).
% cnf(64,plain,(subset(X1,X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[62])).
% cnf(65,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[62])).
% fof(86, plain,![X1]:![X2]:![X3]:((~(X3=set_union2(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_union2(X1,X2))),inference(fof_nnf,[status(thm)],[15])).
% fof(87, plain,![X5]:![X6]:![X7]:((~(X7=set_union2(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_union2(X5,X6))),inference(variable_rename,[status(thm)],[86])).
% fof(88, plain,![X5]:![X6]:![X7]:((~(X7=set_union2(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)|in(X8,X6)))&((~(in(X8,X5))&~(in(X8,X6)))|in(X8,X7))))&(((~(in(esk4_3(X5,X6,X7),X7))|(~(in(esk4_3(X5,X6,X7),X5))&~(in(esk4_3(X5,X6,X7),X6))))&(in(esk4_3(X5,X6,X7),X7)|(in(esk4_3(X5,X6,X7),X5)|in(esk4_3(X5,X6,X7),X6))))|X7=set_union2(X5,X6))),inference(skolemize,[status(esa)],[87])).
% fof(89, 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_union2(X5,X6)))&(((~(in(esk4_3(X5,X6,X7),X7))|(~(in(esk4_3(X5,X6,X7),X5))&~(in(esk4_3(X5,X6,X7),X6))))&(in(esk4_3(X5,X6,X7),X7)|(in(esk4_3(X5,X6,X7),X5)|in(esk4_3(X5,X6,X7),X6))))|X7=set_union2(X5,X6))),inference(shift_quantors,[status(thm)],[88])).
% fof(90, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(in(X8,X5)|in(X8,X6)))|~(X7=set_union2(X5,X6)))&(((~(in(X8,X5))|in(X8,X7))|~(X7=set_union2(X5,X6)))&((~(in(X8,X6))|in(X8,X7))|~(X7=set_union2(X5,X6)))))&((((~(in(esk4_3(X5,X6,X7),X5))|~(in(esk4_3(X5,X6,X7),X7)))|X7=set_union2(X5,X6))&((~(in(esk4_3(X5,X6,X7),X6))|~(in(esk4_3(X5,X6,X7),X7)))|X7=set_union2(X5,X6)))&((in(esk4_3(X5,X6,X7),X7)|(in(esk4_3(X5,X6,X7),X5)|in(esk4_3(X5,X6,X7),X6)))|X7=set_union2(X5,X6)))),inference(distribute,[status(thm)],[89])).
% cnf(96,plain,(in(X4,X3)|in(X4,X2)|X1!=set_union2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[90])).
% fof(154, negated_conjecture,?[X1]:?[X2]:?[X3]:((subset(X1,X2)&subset(X3,X2))&~(subset(set_union2(X1,X3),X2))),inference(fof_nnf,[status(thm)],[33])).
% fof(155, negated_conjecture,?[X4]:?[X5]:?[X6]:((subset(X4,X5)&subset(X6,X5))&~(subset(set_union2(X4,X6),X5))),inference(variable_rename,[status(thm)],[154])).
% fof(156, negated_conjecture,((subset(esk9_0,esk10_0)&subset(esk11_0,esk10_0))&~(subset(set_union2(esk9_0,esk11_0),esk10_0))),inference(skolemize,[status(esa)],[155])).
% cnf(157,negated_conjecture,(~subset(set_union2(esk9_0,esk11_0),esk10_0)),inference(split_conjunct,[status(thm)],[156])).
% cnf(158,negated_conjecture,(subset(esk11_0,esk10_0)),inference(split_conjunct,[status(thm)],[156])).
% cnf(159,negated_conjecture,(subset(esk9_0,esk10_0)),inference(split_conjunct,[status(thm)],[156])).
% cnf(199,negated_conjecture,(in(esk1_2(set_union2(esk9_0,esk11_0),esk10_0),set_union2(esk9_0,esk11_0))),inference(spm,[status(thm)],[157,64,theory(equality)])).
% cnf(203,negated_conjecture,(~in(esk1_2(set_union2(esk9_0,esk11_0),esk10_0),esk10_0)),inference(spm,[status(thm)],[157,63,theory(equality)])).
% cnf(214,negated_conjecture,(in(X1,esk10_0)|~in(X1,esk11_0)),inference(spm,[status(thm)],[65,158,theory(equality)])).
% cnf(215,negated_conjecture,(in(X1,esk10_0)|~in(X1,esk9_0)),inference(spm,[status(thm)],[65,159,theory(equality)])).
% cnf(265,plain,(in(X1,X2)|in(X1,X3)|~in(X1,set_union2(X3,X2))),inference(er,[status(thm)],[96,theory(equality)])).
% cnf(1879,negated_conjecture,(in(esk1_2(set_union2(esk9_0,esk11_0),esk10_0),esk9_0)|in(esk1_2(set_union2(esk9_0,esk11_0),esk10_0),esk11_0)),inference(spm,[status(thm)],[265,199,theory(equality)])).
% cnf(3045,negated_conjecture,(in(esk1_2(set_union2(esk9_0,esk11_0),esk10_0),esk10_0)|in(esk1_2(set_union2(esk9_0,esk11_0),esk10_0),esk9_0)),inference(spm,[status(thm)],[214,1879,theory(equality)])).
% cnf(3059,negated_conjecture,(in(esk1_2(set_union2(esk9_0,esk11_0),esk10_0),esk9_0)),inference(sr,[status(thm)],[3045,203,theory(equality)])).
% cnf(3072,negated_conjecture,(in(esk1_2(set_union2(esk9_0,esk11_0),esk10_0),esk10_0)),inference(spm,[status(thm)],[215,3059,theory(equality)])).
% cnf(3087,negated_conjecture,($false),inference(sr,[status(thm)],[3072,203,theory(equality)])).
% cnf(3088,negated_conjecture,($false),3087,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 751
% # ...of these trivial : 11
% # ...subsumed : 427
% # ...remaining for further processing: 313
% # Other redundant clauses eliminated : 17
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 4
% # Generated clauses : 2441
% # ...of the previous two non-trivial : 2199
% # Contextual simplify-reflections : 59
% # Paramodulations : 2401
% # Factorizations : 8
% # Equation resolutions : 29
% # Current number of processed clauses: 254
% # Positive orientable unit clauses: 23
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 17
% # Non-unit-clauses : 212
% # Current number of unprocessed clauses: 1481
% # ...number of literals in the above : 5224
% # Clause-clause subsumption calls (NU) : 1795
% # Rec. Clause-clause subsumption calls : 1716
% # Unit Clause-clause subsumption calls : 149
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 29
% # Indexed BW rewrite successes : 24
% # Backwards rewriting index: 178 leaves, 1.40+/-1.238 terms/leaf
% # Paramod-from index: 67 leaves, 1.30+/-0.962 terms/leaf
% # Paramod-into index: 163 leaves, 1.33+/-1.090 terms/leaf
% # -------------------------------------------------
% # User time : 0.103 s
% # System time : 0.007 s
% # Total time : 0.110 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.23 CPU 0.31 WC
% FINAL PrfWatch: 0.23 CPU 0.31 WC
% SZS output end Solution for /tmp/SystemOnTPTP16571/SEU125+2.tptp
%
%------------------------------------------------------------------------------