%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU354+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 : art04.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 03:57:03 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/SystemOnTPTP4939/SEU354+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP4939/SEU354+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4939/SEU354+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 5035
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:?[X2]:(element(X2,powerset(X1))&~(proper_element(X2,powerset(X1)))),file('/tmp/SRASS.s.p', rc2_tex_2)).
% fof(3, axiom,![X1]:![X2]:(element(X2,X1)=>(proper_element(X2,X1)<=>~(X2=union(X1)))),file('/tmp/SRASS.s.p', d2_tex_2)).
% fof(4, axiom,![X1]:union(powerset(X1))=X1,file('/tmp/SRASS.s.p', t99_zfmisc_1)).
% fof(43, conjecture,![X1]:![X2]:(element(X2,powerset(X1))=>(proper_element(X2,powerset(X1))<=>~(X2=X1))),file('/tmp/SRASS.s.p', t5_tex_2)).
% fof(44, negated_conjecture,~(![X1]:![X2]:(element(X2,powerset(X1))=>(proper_element(X2,powerset(X1))<=>~(X2=X1)))),inference(assume_negation,[status(cth)],[43])).
% fof(45, plain,![X1]:?[X2]:(element(X2,powerset(X1))&~(proper_element(X2,powerset(X1)))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(53, plain,![X3]:?[X4]:(element(X4,powerset(X3))&~(proper_element(X4,powerset(X3)))),inference(variable_rename,[status(thm)],[45])).
% fof(54, plain,![X3]:(element(esk2_1(X3),powerset(X3))&~(proper_element(esk2_1(X3),powerset(X3)))),inference(skolemize,[status(esa)],[53])).
% cnf(55,plain,(~proper_element(esk2_1(X1),powerset(X1))),inference(split_conjunct,[status(thm)],[54])).
% cnf(56,plain,(element(esk2_1(X1),powerset(X1))),inference(split_conjunct,[status(thm)],[54])).
% fof(57, plain,![X1]:![X2]:(~(element(X2,X1))|((~(proper_element(X2,X1))|~(X2=union(X1)))&(X2=union(X1)|proper_element(X2,X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(58, plain,![X3]:![X4]:(~(element(X4,X3))|((~(proper_element(X4,X3))|~(X4=union(X3)))&(X4=union(X3)|proper_element(X4,X3)))),inference(variable_rename,[status(thm)],[57])).
% fof(59, plain,![X3]:![X4]:(((~(proper_element(X4,X3))|~(X4=union(X3)))|~(element(X4,X3)))&((X4=union(X3)|proper_element(X4,X3))|~(element(X4,X3)))),inference(distribute,[status(thm)],[58])).
% cnf(60,plain,(proper_element(X1,X2)|X1=union(X2)|~element(X1,X2)),inference(split_conjunct,[status(thm)],[59])).
% fof(62, plain,![X2]:union(powerset(X2))=X2,inference(variable_rename,[status(thm)],[4])).
% cnf(63,plain,(union(powerset(X1))=X1),inference(split_conjunct,[status(thm)],[62])).
% fof(222, negated_conjecture,?[X1]:?[X2]:(element(X2,powerset(X1))&((~(proper_element(X2,powerset(X1)))|X2=X1)&(proper_element(X2,powerset(X1))|~(X2=X1)))),inference(fof_nnf,[status(thm)],[44])).
% fof(223, negated_conjecture,?[X3]:?[X4]:(element(X4,powerset(X3))&((~(proper_element(X4,powerset(X3)))|X4=X3)&(proper_element(X4,powerset(X3))|~(X4=X3)))),inference(variable_rename,[status(thm)],[222])).
% fof(224, negated_conjecture,(element(esk7_0,powerset(esk6_0))&((~(proper_element(esk7_0,powerset(esk6_0)))|esk7_0=esk6_0)&(proper_element(esk7_0,powerset(esk6_0))|~(esk7_0=esk6_0)))),inference(skolemize,[status(esa)],[223])).
% cnf(225,negated_conjecture,(proper_element(esk7_0,powerset(esk6_0))|esk7_0!=esk6_0),inference(split_conjunct,[status(thm)],[224])).
% cnf(226,negated_conjecture,(esk7_0=esk6_0|~proper_element(esk7_0,powerset(esk6_0))),inference(split_conjunct,[status(thm)],[224])).
% cnf(227,negated_conjecture,(element(esk7_0,powerset(esk6_0))),inference(split_conjunct,[status(thm)],[224])).
% cnf(432,negated_conjecture,(union(powerset(esk6_0))=esk7_0|proper_element(esk7_0,powerset(esk6_0))),inference(pm,[status(thm)],[60,227,theory(equality)])).
% cnf(435,plain,(union(powerset(X1))=esk2_1(X1)|proper_element(esk2_1(X1),powerset(X1))),inference(pm,[status(thm)],[60,56,theory(equality)])).
% cnf(438,negated_conjecture,(esk6_0=esk7_0|proper_element(esk7_0,powerset(esk6_0))),inference(rw,[status(thm)],[432,63,theory(equality)])).
% cnf(441,plain,(X1=esk2_1(X1)|proper_element(esk2_1(X1),powerset(X1))),inference(rw,[status(thm)],[435,63,theory(equality)])).
% cnf(442,plain,(esk2_1(X1)=X1),inference(sr,[status(thm)],[441,55,theory(equality)])).
% cnf(632,plain,(~proper_element(X1,powerset(X1))),inference(rw,[status(thm)],[55,442,theory(equality)])).
% cnf(1265,negated_conjecture,(esk6_0=esk7_0),inference(pm,[status(thm)],[226,438,theory(equality)])).
% cnf(1330,negated_conjecture,(proper_element(esk7_0,powerset(esk7_0))|esk6_0!=esk7_0),inference(rw,[status(thm)],[225,1265,theory(equality)])).
% cnf(1331,negated_conjecture,(proper_element(esk7_0,powerset(esk7_0))|$false),inference(rw,[status(thm)],[1330,1265,theory(equality)])).
% cnf(1332,negated_conjecture,(proper_element(esk7_0,powerset(esk7_0))),inference(cn,[status(thm)],[1331,theory(equality)])).
% cnf(1333,negated_conjecture,($false),inference(sr,[status(thm)],[1332,632,theory(equality)])).
% cnf(1334,negated_conjecture,($false),1333,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 395
% # ...of these trivial : 48
% # ...subsumed : 22
% # ...remaining for further processing: 325
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 65
% # Generated clauses : 796
% # ...of the previous two non-trivial : 663
% # Contextual simplify-reflections : 0
% # Paramodulations : 790
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 260
% # Positive orientable unit clauses: 67
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 7
% # Non-unit-clauses : 186
% # Current number of unprocessed clauses: 182
% # ...number of literals in the above : 262
% # Clause-clause subsumption calls (NU) : 222
% # Rec. Clause-clause subsumption calls : 215
% # Unit Clause-clause subsumption calls : 254
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 60
% # Indexed BW rewrite successes : 10
% # Backwards rewriting index: 152 leaves, 1.24+/-0.628 terms/leaf
% # Paramod-from index: 67 leaves, 1.06+/-0.237 terms/leaf
% # Paramod-into index: 116 leaves, 1.16+/-0.551 terms/leaf
% # -------------------------------------------------
% # User time : 0.038 s
% # System time : 0.007 s
% # Total time : 0.045 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.22 WC
% FINAL PrfWatch: 0.13 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP4939/SEU354+1.tptp
%
%------------------------------------------------------------------------------