%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU172+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 : art05.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:25:24 EST 2010
% Result : Theorem 0.90s
% Output : Solution 0.90s
% 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/SystemOnTPTP21102/SEU172+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP21102/SEU172+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21102/SEU172+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 21198
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(7, axiom,![X1]:![X2]:(element(X2,powerset(X1))=>subset_complement(X1,X2)=set_difference(X1,X2)),file('/tmp/SRASS.s.p', d5_subset_1)).
% fof(14, 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(22, conjecture,![X1]:![X2]:![X3]:(element(X3,powerset(X1))=>~((in(X2,subset_complement(X1,X3))&in(X2,X3)))),file('/tmp/SRASS.s.p', t54_subset_1)).
% fof(23, negated_conjecture,~(![X1]:![X2]:![X3]:(element(X3,powerset(X1))=>~((in(X2,subset_complement(X1,X3))&in(X2,X3))))),inference(assume_negation,[status(cth)],[22])).
% fof(28, plain,![X1]:![X2]:![X3]:(X3=set_difference(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)&~(in(X4,X2))))),inference(fof_simplification,[status(thm)],[14,theory(equality)])).
% fof(51, plain,![X1]:![X2]:(~(element(X2,powerset(X1)))|subset_complement(X1,X2)=set_difference(X1,X2)),inference(fof_nnf,[status(thm)],[7])).
% fof(52, plain,![X3]:![X4]:(~(element(X4,powerset(X3)))|subset_complement(X3,X4)=set_difference(X3,X4)),inference(variable_rename,[status(thm)],[51])).
% cnf(53,plain,(subset_complement(X1,X2)=set_difference(X1,X2)|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[52])).
% fof(69, 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)],[28])).
% fof(70, 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)],[69])).
% fof(71, 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(esk6_3(X5,X6,X7),X7))|(~(in(esk6_3(X5,X6,X7),X5))|in(esk6_3(X5,X6,X7),X6)))&(in(esk6_3(X5,X6,X7),X7)|(in(esk6_3(X5,X6,X7),X5)&~(in(esk6_3(X5,X6,X7),X6)))))|X7=set_difference(X5,X6))),inference(skolemize,[status(esa)],[70])).
% fof(72, 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(esk6_3(X5,X6,X7),X7))|(~(in(esk6_3(X5,X6,X7),X5))|in(esk6_3(X5,X6,X7),X6)))&(in(esk6_3(X5,X6,X7),X7)|(in(esk6_3(X5,X6,X7),X5)&~(in(esk6_3(X5,X6,X7),X6)))))|X7=set_difference(X5,X6))),inference(shift_quantors,[status(thm)],[71])).
% fof(73, 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(esk6_3(X5,X6,X7),X7))|(~(in(esk6_3(X5,X6,X7),X5))|in(esk6_3(X5,X6,X7),X6)))|X7=set_difference(X5,X6))&(((in(esk6_3(X5,X6,X7),X5)|in(esk6_3(X5,X6,X7),X7))|X7=set_difference(X5,X6))&((~(in(esk6_3(X5,X6,X7),X6))|in(esk6_3(X5,X6,X7),X7))|X7=set_difference(X5,X6))))),inference(distribute,[status(thm)],[72])).
% cnf(78,plain,(X1!=set_difference(X2,X3)|~in(X4,X1)|~in(X4,X3)),inference(split_conjunct,[status(thm)],[73])).
% fof(91, negated_conjecture,?[X1]:?[X2]:?[X3]:(element(X3,powerset(X1))&(in(X2,subset_complement(X1,X3))&in(X2,X3))),inference(fof_nnf,[status(thm)],[23])).
% fof(92, negated_conjecture,?[X4]:?[X5]:?[X6]:(element(X6,powerset(X4))&(in(X5,subset_complement(X4,X6))&in(X5,X6))),inference(variable_rename,[status(thm)],[91])).
% fof(93, negated_conjecture,(element(esk9_0,powerset(esk7_0))&(in(esk8_0,subset_complement(esk7_0,esk9_0))&in(esk8_0,esk9_0))),inference(skolemize,[status(esa)],[92])).
% cnf(94,negated_conjecture,(in(esk8_0,esk9_0)),inference(split_conjunct,[status(thm)],[93])).
% cnf(95,negated_conjecture,(in(esk8_0,subset_complement(esk7_0,esk9_0))),inference(split_conjunct,[status(thm)],[93])).
% cnf(96,negated_conjecture,(element(esk9_0,powerset(esk7_0))),inference(split_conjunct,[status(thm)],[93])).
% cnf(106,negated_conjecture,(subset_complement(esk7_0,esk9_0)=set_difference(esk7_0,esk9_0)),inference(spm,[status(thm)],[53,96,theory(equality)])).
% cnf(128,plain,(~in(X1,X2)|~in(X1,set_difference(X3,X2))),inference(er,[status(thm)],[78,theory(equality)])).
% cnf(138,negated_conjecture,(in(esk8_0,set_difference(esk7_0,esk9_0))),inference(rw,[status(thm)],[95,106,theory(equality)])).
% cnf(163,negated_conjecture,(~in(esk8_0,esk9_0)),inference(spm,[status(thm)],[128,138,theory(equality)])).
% cnf(164,negated_conjecture,($false),inference(rw,[status(thm)],[163,94,theory(equality)])).
% cnf(165,negated_conjecture,($false),inference(cn,[status(thm)],[164,theory(equality)])).
% cnf(166,negated_conjecture,($false),165,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 71
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 69
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 6
% # Generated clauses : 51
% # ...of the previous two non-trivial : 47
% # Contextual simplify-reflections : 0
% # Paramodulations : 43
% # Factorizations : 2
% # Equation resolutions : 6
% # Current number of processed clauses: 36
% # Positive orientable unit clauses: 13
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 17
% # Current number of unprocessed clauses: 27
% # ...number of literals in the above : 61
% # Clause-clause subsumption calls (NU) : 53
% # Rec. Clause-clause subsumption calls : 42
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 42 leaves, 1.26+/-0.874 terms/leaf
% # Paramod-from index: 17 leaves, 1.06+/-0.235 terms/leaf
% # Paramod-into index: 41 leaves, 1.17+/-0.489 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.003 s
% # Total time : 0.017 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP21102/SEU172+1.tptp
%
%------------------------------------------------------------------------------