%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU126+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 : 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 01:11:16 EST 2010
% Result : Theorem 1.12s
% Output : Solution 1.12s
% 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/SystemOnTPTP9270/SEU126+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9270/SEU126+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9270/SEU126+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 9366
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:set_union2(X1,X2)=set_union2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_xboole_0)).
% fof(2, axiom,![X1]:![X2]:(X1=X2<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', d10_xboole_0)).
% fof(4, axiom,![X1]:![X2]:subset(X1,X1),file('/tmp/SRASS.s.p', reflexivity_r1_tarski)).
% fof(6, axiom,![X1]:![X2]:subset(X1,set_union2(X1,X2)),file('/tmp/SRASS.s.p', t7_xboole_1)).
% fof(7, axiom,![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, conjecture,![X1]:![X2]:(subset(X1,X2)=>set_union2(X1,X2)=X2),file('/tmp/SRASS.s.p', t12_xboole_1)).
% fof(34, negated_conjecture,~(![X1]:![X2]:(subset(X1,X2)=>set_union2(X1,X2)=X2)),inference(assume_negation,[status(cth)],[33])).
% fof(42, plain,![X3]:![X4]:set_union2(X3,X4)=set_union2(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(43,plain,(set_union2(X1,X2)=set_union2(X2,X1)),inference(split_conjunct,[status(thm)],[42])).
% fof(44, plain,![X1]:![X2]:((~(X1=X2)|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[2])).
% fof(45, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[44])).
% fof(46, plain,![X3]:![X4]:(((subset(X3,X4)|~(X3=X4))&(subset(X4,X3)|~(X3=X4)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(distribute,[status(thm)],[45])).
% cnf(47,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[46])).
% fof(52, plain,![X3]:![X4]:subset(X3,X3),inference(variable_rename,[status(thm)],[4])).
% cnf(53,plain,(subset(X1,X1)),inference(split_conjunct,[status(thm)],[52])).
% fof(57, plain,![X3]:![X4]:subset(X3,set_union2(X3,X4)),inference(variable_rename,[status(thm)],[6])).
% cnf(58,plain,(subset(X1,set_union2(X1,X2))),inference(split_conjunct,[status(thm)],[57])).
% fof(59, plain,![X1]:![X2]:![X3]:((~(subset(X1,X2))|~(subset(X3,X2)))|subset(set_union2(X1,X3),X2)),inference(fof_nnf,[status(thm)],[7])).
% fof(60, plain,![X4]:![X5]:![X6]:((~(subset(X4,X5))|~(subset(X6,X5)))|subset(set_union2(X4,X6),X5)),inference(variable_rename,[status(thm)],[59])).
% cnf(61,plain,(subset(set_union2(X1,X2),X3)|~subset(X2,X3)|~subset(X1,X3)),inference(split_conjunct,[status(thm)],[60])).
% fof(158, negated_conjecture,?[X1]:?[X2]:(subset(X1,X2)&~(set_union2(X1,X2)=X2)),inference(fof_nnf,[status(thm)],[34])).
% fof(159, negated_conjecture,?[X3]:?[X4]:(subset(X3,X4)&~(set_union2(X3,X4)=X4)),inference(variable_rename,[status(thm)],[158])).
% fof(160, negated_conjecture,(subset(esk9_0,esk10_0)&~(set_union2(esk9_0,esk10_0)=esk10_0)),inference(skolemize,[status(esa)],[159])).
% cnf(161,negated_conjecture,(set_union2(esk9_0,esk10_0)!=esk10_0),inference(split_conjunct,[status(thm)],[160])).
% cnf(162,negated_conjecture,(subset(esk9_0,esk10_0)),inference(split_conjunct,[status(thm)],[160])).
% cnf(167,negated_conjecture,(set_union2(esk10_0,esk9_0)!=esk10_0),inference(rw,[status(thm)],[161,43,theory(equality)])).
% cnf(188,plain,(set_union2(X1,X2)=X1|~subset(set_union2(X1,X2),X1)),inference(spm,[status(thm)],[47,58,theory(equality)])).
% cnf(513,plain,(set_union2(X1,X2)=X1|~subset(X2,X1)|~subset(X1,X1)),inference(spm,[status(thm)],[188,61,theory(equality)])).
% cnf(514,plain,(set_union2(X1,X2)=X1|~subset(X2,X1)|$false),inference(rw,[status(thm)],[513,53,theory(equality)])).
% cnf(515,plain,(set_union2(X1,X2)=X1|~subset(X2,X1)),inference(cn,[status(thm)],[514,theory(equality)])).
% cnf(528,negated_conjecture,(~subset(esk9_0,esk10_0)),inference(spm,[status(thm)],[167,515,theory(equality)])).
% cnf(543,negated_conjecture,($false),inference(rw,[status(thm)],[528,162,theory(equality)])).
% cnf(544,negated_conjecture,($false),inference(cn,[status(thm)],[543,theory(equality)])).
% cnf(545,negated_conjecture,($false),544,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 142
% # ...of these trivial : 2
% # ...subsumed : 17
% # ...remaining for further processing: 123
% # Other redundant clauses eliminated : 17
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 329
% # ...of the previous two non-trivial : 243
% # Contextual simplify-reflections : 0
% # Paramodulations : 299
% # Factorizations : 6
% # Equation resolutions : 24
% # Current number of processed clauses: 71
% # Positive orientable unit clauses: 12
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 4
% # Non-unit-clauses : 53
% # Current number of unprocessed clauses: 198
% # ...number of literals in the above : 697
% # Clause-clause subsumption calls (NU) : 136
% # Rec. Clause-clause subsumption calls : 131
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 26
% # Indexed BW rewrite successes : 21
% # Backwards rewriting index: 45 leaves, 1.73+/-1.467 terms/leaf
% # Paramod-from index: 21 leaves, 1.57+/-0.849 terms/leaf
% # Paramod-into index: 41 leaves, 1.63+/-1.245 terms/leaf
% # -------------------------------------------------
% # User time : 0.023 s
% # System time : 0.007 s
% # Total time : 0.030 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.20 WC
% FINAL PrfWatch: 0.14 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP9270/SEU126+2.tptp
%
%------------------------------------------------------------------------------