%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU139+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:14:38 EST 2010
% Result : Theorem 0.98s
% Output : Solution 0.98s
% 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/SystemOnTPTP17866/SEU139+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17866/SEU139+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17866/SEU139+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 17962
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.018 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(proper_subset(X1,X2)=>~(proper_subset(X2,X1))),file('/tmp/SRASS.s.p', antisymmetry_r2_xboole_0)).
% fof(2, axiom,![X1]:![X2]:~(proper_subset(X1,X1)),file('/tmp/SRASS.s.p', irreflexivity_r2_xboole_0)).
% fof(5, axiom,![X1]:![X2]:(proper_subset(X1,X2)<=>(subset(X1,X2)&~(X1=X2))),file('/tmp/SRASS.s.p', d8_xboole_0)).
% fof(55, conjecture,![X1]:![X2]:~((subset(X1,X2)&proper_subset(X2,X1))),file('/tmp/SRASS.s.p', t60_xboole_1)).
% fof(56, negated_conjecture,~(![X1]:![X2]:~((subset(X1,X2)&proper_subset(X2,X1)))),inference(assume_negation,[status(cth)],[55])).
% fof(57, plain,![X1]:![X2]:(proper_subset(X1,X2)=>~(proper_subset(X2,X1))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(58, plain,![X1]:![X2]:~(proper_subset(X1,X1)),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(67, plain,![X1]:![X2]:(~(proper_subset(X1,X2))|~(proper_subset(X2,X1))),inference(fof_nnf,[status(thm)],[57])).
% fof(68, plain,![X3]:![X4]:(~(proper_subset(X3,X4))|~(proper_subset(X4,X3))),inference(variable_rename,[status(thm)],[67])).
% cnf(69,plain,(~proper_subset(X1,X2)|~proper_subset(X2,X1)),inference(split_conjunct,[status(thm)],[68])).
% fof(70, plain,![X3]:![X4]:~(proper_subset(X3,X3)),inference(variable_rename,[status(thm)],[58])).
% cnf(71,plain,(~proper_subset(X1,X1)),inference(split_conjunct,[status(thm)],[70])).
% fof(77, plain,![X1]:![X2]:((~(proper_subset(X1,X2))|(subset(X1,X2)&~(X1=X2)))&((~(subset(X1,X2))|X1=X2)|proper_subset(X1,X2))),inference(fof_nnf,[status(thm)],[5])).
% fof(78, plain,![X3]:![X4]:((~(proper_subset(X3,X4))|(subset(X3,X4)&~(X3=X4)))&((~(subset(X3,X4))|X3=X4)|proper_subset(X3,X4))),inference(variable_rename,[status(thm)],[77])).
% fof(79, plain,![X3]:![X4]:(((subset(X3,X4)|~(proper_subset(X3,X4)))&(~(X3=X4)|~(proper_subset(X3,X4))))&((~(subset(X3,X4))|X3=X4)|proper_subset(X3,X4))),inference(distribute,[status(thm)],[78])).
% cnf(80,plain,(proper_subset(X1,X2)|X1=X2|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[79])).
% fof(254, negated_conjecture,?[X1]:?[X2]:(subset(X1,X2)&proper_subset(X2,X1)),inference(fof_nnf,[status(thm)],[56])).
% fof(255, negated_conjecture,?[X3]:?[X4]:(subset(X3,X4)&proper_subset(X4,X3)),inference(variable_rename,[status(thm)],[254])).
% fof(256, negated_conjecture,(subset(esk11_0,esk12_0)&proper_subset(esk12_0,esk11_0)),inference(skolemize,[status(esa)],[255])).
% cnf(257,negated_conjecture,(proper_subset(esk12_0,esk11_0)),inference(split_conjunct,[status(thm)],[256])).
% cnf(258,negated_conjecture,(subset(esk11_0,esk12_0)),inference(split_conjunct,[status(thm)],[256])).
% cnf(308,negated_conjecture,(~proper_subset(esk11_0,esk12_0)),inference(spm,[status(thm)],[69,257,theory(equality)])).
% cnf(735,negated_conjecture,(esk11_0=esk12_0|~subset(esk11_0,esk12_0)),inference(spm,[status(thm)],[308,80,theory(equality)])).
% cnf(736,negated_conjecture,(esk11_0=esk12_0|$false),inference(rw,[status(thm)],[735,258,theory(equality)])).
% cnf(737,negated_conjecture,(esk11_0=esk12_0),inference(cn,[status(thm)],[736,theory(equality)])).
% cnf(740,negated_conjecture,(proper_subset(esk12_0,esk12_0)),inference(rw,[status(thm)],[257,737,theory(equality)])).
% cnf(741,negated_conjecture,($false),inference(sr,[status(thm)],[740,71,theory(equality)])).
% cnf(742,negated_conjecture,($false),741,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 155
% # ...of these trivial : 1
% # ...subsumed : 5
% # ...remaining for further processing: 149
% # Other redundant clauses eliminated : 19
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 385
% # ...of the previous two non-trivial : 297
% # Contextual simplify-reflections : 0
% # Paramodulations : 344
% # Factorizations : 14
% # Equation resolutions : 27
% # Current number of processed clauses: 71
% # Positive orientable unit clauses: 14
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 2
% # Non-unit-clauses : 52
% # Current number of unprocessed clauses: 287
% # ...number of literals in the above : 705
% # Clause-clause subsumption calls (NU) : 194
% # Rec. Clause-clause subsumption calls : 180
% # Unit Clause-clause subsumption calls : 10
% # Rewrite failures with RHS unbound : 4
% # Indexed BW rewrite attempts : 37
% # Indexed BW rewrite successes : 27
% # Backwards rewriting index: 48 leaves, 1.85+/-1.695 terms/leaf
% # Paramod-from index: 29 leaves, 1.41+/-0.720 terms/leaf
% # Paramod-into index: 44 leaves, 1.70+/-1.375 terms/leaf
% # -------------------------------------------------
% # User time : 0.029 s
% # System time : 0.005 s
% # Total time : 0.034 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.20 WC
% FINAL PrfWatch: 0.11 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP17866/SEU139+2.tptp
%
%------------------------------------------------------------------------------