%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU134+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 : art02.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:13:02 EST 2010
% Result : Theorem 0.97s
% Output : Solution 0.97s
% 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/SystemOnTPTP16975/SEU134+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16975/SEU134+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16975/SEU134+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 17071
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(set_difference(X1,X2)=empty_set<=>subset(X1,X2)),file('/tmp/SRASS.s.p', l32_xboole_1)).
% fof(15, axiom,![X1]:(empty(X1)=>X1=empty_set),file('/tmp/SRASS.s.p', t6_boole)).
% fof(23, axiom,?[X1]:empty(X1),file('/tmp/SRASS.s.p', rc1_xboole_0)).
% fof(47, conjecture,![X1]:![X2]:(set_difference(X1,X2)=empty_set<=>subset(X1,X2)),file('/tmp/SRASS.s.p', t37_xboole_1)).
% fof(48, negated_conjecture,~(![X1]:![X2]:(set_difference(X1,X2)=empty_set<=>subset(X1,X2))),inference(assume_negation,[status(cth)],[47])).
% fof(63, plain,![X1]:![X2]:((~(set_difference(X1,X2)=empty_set)|subset(X1,X2))&(~(subset(X1,X2))|set_difference(X1,X2)=empty_set)),inference(fof_nnf,[status(thm)],[2])).
% fof(64, plain,![X3]:![X4]:((~(set_difference(X3,X4)=empty_set)|subset(X3,X4))&(~(subset(X3,X4))|set_difference(X3,X4)=empty_set)),inference(variable_rename,[status(thm)],[63])).
% cnf(65,plain,(set_difference(X1,X2)=empty_set|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[64])).
% cnf(66,plain,(subset(X1,X2)|set_difference(X1,X2)!=empty_set),inference(split_conjunct,[status(thm)],[64])).
% fof(107, plain,![X1]:(~(empty(X1))|X1=empty_set),inference(fof_nnf,[status(thm)],[15])).
% fof(108, plain,![X2]:(~(empty(X2))|X2=empty_set),inference(variable_rename,[status(thm)],[107])).
% cnf(109,plain,(X1=empty_set|~empty(X1)),inference(split_conjunct,[status(thm)],[108])).
% fof(127, plain,?[X2]:empty(X2),inference(variable_rename,[status(thm)],[23])).
% fof(128, plain,empty(esk3_0),inference(skolemize,[status(esa)],[127])).
% cnf(129,plain,(empty(esk3_0)),inference(split_conjunct,[status(thm)],[128])).
% fof(220, 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)],[48])).
% fof(221, 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)],[220])).
% fof(222, negated_conjecture,((~(set_difference(esk11_0,esk12_0)=empty_set)|~(subset(esk11_0,esk12_0)))&(set_difference(esk11_0,esk12_0)=empty_set|subset(esk11_0,esk12_0))),inference(skolemize,[status(esa)],[221])).
% cnf(223,negated_conjecture,(subset(esk11_0,esk12_0)|set_difference(esk11_0,esk12_0)=empty_set),inference(split_conjunct,[status(thm)],[222])).
% cnf(224,negated_conjecture,(~subset(esk11_0,esk12_0)|set_difference(esk11_0,esk12_0)!=empty_set),inference(split_conjunct,[status(thm)],[222])).
% cnf(238,negated_conjecture,(~subset(esk11_0,esk12_0)),inference(spm,[status(thm)],[224,65,theory(equality)])).
% cnf(247,plain,(empty_set=esk3_0),inference(spm,[status(thm)],[109,129,theory(equality)])).
% cnf(685,negated_conjecture,(set_difference(esk11_0,esk12_0)=empty_set),inference(sr,[status(thm)],[223,238,theory(equality)])).
% cnf(687,plain,(subset(X1,X2)|set_difference(X1,X2)!=esk3_0),inference(rw,[status(thm)],[66,247,theory(equality)])).
% cnf(704,negated_conjecture,(set_difference(esk11_0,esk12_0)=esk3_0),inference(rw,[status(thm)],[685,247,theory(equality)])).
% cnf(796,negated_conjecture,(subset(esk11_0,esk12_0)),inference(spm,[status(thm)],[687,704,theory(equality)])).
% cnf(798,negated_conjecture,($false),inference(sr,[status(thm)],[796,238,theory(equality)])).
% cnf(799,negated_conjecture,($false),798,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 153
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 152
% # Other redundant clauses eliminated : 23
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 16
% # Generated clauses : 483
% # ...of the previous two non-trivial : 396
% # Contextual simplify-reflections : 0
% # Paramodulations : 438
% # Factorizations : 12
% # Equation resolutions : 32
% # Current number of processed clauses: 65
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 4
% # Non-unit-clauses : 44
% # Current number of unprocessed clauses: 248
% # ...number of literals in the above : 737
% # Clause-clause subsumption calls (NU) : 170
% # Rec. Clause-clause subsumption calls : 156
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 32
% # Indexed BW rewrite successes : 26
% # Backwards rewriting index: 49 leaves, 1.73+/-1.536 terms/leaf
% # Paramod-from index: 27 leaves, 1.44+/-0.737 terms/leaf
% # Paramod-into index: 46 leaves, 1.57+/-1.154 terms/leaf
% # -------------------------------------------------
% # User time : 0.030 s
% # System time : 0.005 s
% # Total time : 0.035 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.20 WC
% FINAL PrfWatch: 0.12 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP16975/SEU134+2.tptp
%
%------------------------------------------------------------------------------