TSTP Solution File: SEU169+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU169+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 : art06.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:24:45 EST 2010
% Result : Theorem 1.32s
% Output : Solution 1.32s
% 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/SystemOnTPTP22485/SEU169+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22485/SEU169+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22485/SEU169+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 22581
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.026 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:![X2]:((~(empty(X1))=>(element(X2,X1)<=>in(X2,X1)))&(empty(X1)=>(element(X2,X1)<=>empty(X2)))),file('/tmp/SRASS.s.p', d2_subset_1)).
% fof(7, axiom,![X1]:~(empty(powerset(X1))),file('/tmp/SRASS.s.p', fc1_subset_1)).
% fof(18, axiom,![X1]:union(powerset(X1))=X1,file('/tmp/SRASS.s.p', t99_zfmisc_1)).
% fof(46, axiom,![X1]:![X2]:(X2=union(X1)<=>![X3]:(in(X3,X2)<=>?[X4]:(in(X3,X4)&in(X4,X1)))),file('/tmp/SRASS.s.p', d4_tarski)).
% fof(105, conjecture,![X1]:![X2]:(element(X2,powerset(X1))=>![X3]:(in(X3,X2)=>in(X3,X1))),file('/tmp/SRASS.s.p', l3_subset_1)).
% fof(106, negated_conjecture,~(![X1]:![X2]:(element(X2,powerset(X1))=>![X3]:(in(X3,X2)=>in(X3,X1)))),inference(assume_negation,[status(cth)],[105])).
% fof(109, plain,![X1]:![X2]:((~(empty(X1))=>(element(X2,X1)<=>in(X2,X1)))&(empty(X1)=>(element(X2,X1)<=>empty(X2)))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(110, plain,![X1]:~(empty(powerset(X1))),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(137, plain,![X1]:![X2]:((empty(X1)|((~(element(X2,X1))|in(X2,X1))&(~(in(X2,X1))|element(X2,X1))))&(~(empty(X1))|((~(element(X2,X1))|empty(X2))&(~(empty(X2))|element(X2,X1))))),inference(fof_nnf,[status(thm)],[109])).
% fof(138, plain,![X3]:![X4]:((empty(X3)|((~(element(X4,X3))|in(X4,X3))&(~(in(X4,X3))|element(X4,X3))))&(~(empty(X3))|((~(element(X4,X3))|empty(X4))&(~(empty(X4))|element(X4,X3))))),inference(variable_rename,[status(thm)],[137])).
% fof(139, plain,![X3]:![X4]:((((~(element(X4,X3))|in(X4,X3))|empty(X3))&((~(in(X4,X3))|element(X4,X3))|empty(X3)))&(((~(element(X4,X3))|empty(X4))|~(empty(X3)))&((~(empty(X4))|element(X4,X3))|~(empty(X3))))),inference(distribute,[status(thm)],[138])).
% cnf(143,plain,(empty(X1)|in(X2,X1)|~element(X2,X1)),inference(split_conjunct,[status(thm)],[139])).
% fof(159, plain,![X2]:~(empty(powerset(X2))),inference(variable_rename,[status(thm)],[110])).
% cnf(160,plain,(~empty(powerset(X1))),inference(split_conjunct,[status(thm)],[159])).
% fof(208, plain,![X2]:union(powerset(X2))=X2,inference(variable_rename,[status(thm)],[18])).
% cnf(209,plain,(union(powerset(X1))=X1),inference(split_conjunct,[status(thm)],[208])).
% fof(338, plain,![X1]:![X2]:((~(X2=union(X1))|![X3]:((~(in(X3,X2))|?[X4]:(in(X3,X4)&in(X4,X1)))&(![X4]:(~(in(X3,X4))|~(in(X4,X1)))|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|![X4]:(~(in(X3,X4))|~(in(X4,X1))))&(in(X3,X2)|?[X4]:(in(X3,X4)&in(X4,X1))))|X2=union(X1))),inference(fof_nnf,[status(thm)],[46])).
% fof(339, plain,![X5]:![X6]:((~(X6=union(X5))|![X7]:((~(in(X7,X6))|?[X8]:(in(X7,X8)&in(X8,X5)))&(![X9]:(~(in(X7,X9))|~(in(X9,X5)))|in(X7,X6))))&(?[X10]:((~(in(X10,X6))|![X11]:(~(in(X10,X11))|~(in(X11,X5))))&(in(X10,X6)|?[X12]:(in(X10,X12)&in(X12,X5))))|X6=union(X5))),inference(variable_rename,[status(thm)],[338])).
% fof(340, plain,![X5]:![X6]:((~(X6=union(X5))|![X7]:((~(in(X7,X6))|(in(X7,esk18_3(X5,X6,X7))&in(esk18_3(X5,X6,X7),X5)))&(![X9]:(~(in(X7,X9))|~(in(X9,X5)))|in(X7,X6))))&(((~(in(esk19_2(X5,X6),X6))|![X11]:(~(in(esk19_2(X5,X6),X11))|~(in(X11,X5))))&(in(esk19_2(X5,X6),X6)|(in(esk19_2(X5,X6),esk20_2(X5,X6))&in(esk20_2(X5,X6),X5))))|X6=union(X5))),inference(skolemize,[status(esa)],[339])).
% fof(341, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(esk19_2(X5,X6),X11))|~(in(X11,X5)))|~(in(esk19_2(X5,X6),X6)))&(in(esk19_2(X5,X6),X6)|(in(esk19_2(X5,X6),esk20_2(X5,X6))&in(esk20_2(X5,X6),X5))))|X6=union(X5))&((((~(in(X7,X9))|~(in(X9,X5)))|in(X7,X6))&(~(in(X7,X6))|(in(X7,esk18_3(X5,X6,X7))&in(esk18_3(X5,X6,X7),X5))))|~(X6=union(X5)))),inference(shift_quantors,[status(thm)],[340])).
% fof(342, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(esk19_2(X5,X6),X11))|~(in(X11,X5)))|~(in(esk19_2(X5,X6),X6)))|X6=union(X5))&(((in(esk19_2(X5,X6),esk20_2(X5,X6))|in(esk19_2(X5,X6),X6))|X6=union(X5))&((in(esk20_2(X5,X6),X5)|in(esk19_2(X5,X6),X6))|X6=union(X5))))&((((~(in(X7,X9))|~(in(X9,X5)))|in(X7,X6))|~(X6=union(X5)))&(((in(X7,esk18_3(X5,X6,X7))|~(in(X7,X6)))|~(X6=union(X5)))&((in(esk18_3(X5,X6,X7),X5)|~(in(X7,X6)))|~(X6=union(X5)))))),inference(distribute,[status(thm)],[341])).
% cnf(345,plain,(in(X3,X1)|X1!=union(X2)|~in(X4,X2)|~in(X3,X4)),inference(split_conjunct,[status(thm)],[342])).
% fof(519, negated_conjecture,?[X1]:?[X2]:(element(X2,powerset(X1))&?[X3]:(in(X3,X2)&~(in(X3,X1)))),inference(fof_nnf,[status(thm)],[106])).
% fof(520, negated_conjecture,?[X4]:?[X5]:(element(X5,powerset(X4))&?[X6]:(in(X6,X5)&~(in(X6,X4)))),inference(variable_rename,[status(thm)],[519])).
% fof(521, negated_conjecture,(element(esk28_0,powerset(esk27_0))&(in(esk29_0,esk28_0)&~(in(esk29_0,esk27_0)))),inference(skolemize,[status(esa)],[520])).
% cnf(522,negated_conjecture,(~in(esk29_0,esk27_0)),inference(split_conjunct,[status(thm)],[521])).
% cnf(523,negated_conjecture,(in(esk29_0,esk28_0)),inference(split_conjunct,[status(thm)],[521])).
% cnf(524,negated_conjecture,(element(esk28_0,powerset(esk27_0))),inference(split_conjunct,[status(thm)],[521])).
% cnf(632,negated_conjecture,(empty(powerset(esk27_0))|in(esk28_0,powerset(esk27_0))),inference(spm,[status(thm)],[143,524,theory(equality)])).
% cnf(635,negated_conjecture,(in(esk28_0,powerset(esk27_0))),inference(sr,[status(thm)],[632,160,theory(equality)])).
% cnf(2340,negated_conjecture,(in(X1,X2)|union(powerset(esk27_0))!=X2|~in(X1,esk28_0)),inference(spm,[status(thm)],[345,635,theory(equality)])).
% cnf(2342,negated_conjecture,(in(X1,X2)|esk27_0!=X2|~in(X1,esk28_0)),inference(rw,[status(thm)],[2340,209,theory(equality)])).
% cnf(2516,negated_conjecture,(in(esk29_0,X1)|esk27_0!=X1),inference(spm,[status(thm)],[2342,523,theory(equality)])).
% cnf(2553,negated_conjecture,($false),inference(spm,[status(thm)],[522,2516,theory(equality)])).
% cnf(2554,negated_conjecture,($false),2553,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 385
% # ...of these trivial : 6
% # ...subsumed : 35
% # ...remaining for further processing: 344
% # Other redundant clauses eliminated : 50
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 3
% # Generated clauses : 1732
% # ...of the previous two non-trivial : 1538
% # Contextual simplify-reflections : 1
% # Paramodulations : 1649
% # Factorizations : 14
% # Equation resolutions : 69
% # Current number of processed clauses: 183
% # Positive orientable unit clauses: 27
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 26
% # Non-unit-clauses : 127
% # Current number of unprocessed clauses: 1466
% # ...number of literals in the above : 5026
% # Clause-clause subsumption calls (NU) : 725
% # Rec. Clause-clause subsumption calls : 611
% # Unit Clause-clause subsumption calls : 39
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 37
% # Indexed BW rewrite successes : 29
% # Backwards rewriting index: 145 leaves, 1.68+/-1.893 terms/leaf
% # Paramod-from index: 77 leaves, 1.23+/-0.556 terms/leaf
% # Paramod-into index: 141 leaves, 1.52+/-1.432 terms/leaf
% # -------------------------------------------------
% # User time : 0.096 s
% # System time : 0.004 s
% # Total time : 0.100 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.23 CPU 0.30 WC
% FINAL PrfWatch: 0.23 CPU 0.30 WC
% SZS output end Solution for /tmp/SystemOnTPTP22485/SEU169+2.tptp
%
%------------------------------------------------------------------------------