TSTP Solution File: SEU173+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU173+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:25:48 EST 2010
% Result : Theorem 1.42s
% Output : Solution 1.42s
% 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/SystemOnTPTP24632/SEU173+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24632/SEU173+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24632/SEU173+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 24728
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.027 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(8, 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(10, axiom,![X1]:![X2]:(X2=powerset(X1)<=>![X3]:(in(X3,X2)<=>subset(X3,X1))),file('/tmp/SRASS.s.p', d1_zfmisc_1)).
% fof(12, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(21, axiom,![X1]:![X2]:~((in(X1,X2)&empty(X2))),file('/tmp/SRASS.s.p', t7_boole)).
% fof(113, conjecture,![X1]:![X2]:(![X3]:(in(X3,X1)=>in(X3,X2))=>element(X1,powerset(X2))),file('/tmp/SRASS.s.p', l71_subset_1)).
% fof(114, negated_conjecture,~(![X1]:![X2]:(![X3]:(in(X3,X1)=>in(X3,X2))=>element(X1,powerset(X2)))),inference(assume_negation,[status(cth)],[113])).
% fof(117, plain,![X1]:![X2]:((~(empty(X1))=>(element(X2,X1)<=>in(X2,X1)))&(empty(X1)=>(element(X2,X1)<=>empty(X2)))),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(160, 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)],[117])).
% fof(161, 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)],[160])).
% fof(162, 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)],[161])).
% cnf(165,plain,(empty(X1)|element(X2,X1)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[162])).
% fof(173, plain,![X1]:![X2]:((~(X2=powerset(X1))|![X3]:((~(in(X3,X2))|subset(X3,X1))&(~(subset(X3,X1))|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|~(subset(X3,X1)))&(in(X3,X2)|subset(X3,X1)))|X2=powerset(X1))),inference(fof_nnf,[status(thm)],[10])).
% fof(174, plain,![X4]:![X5]:((~(X5=powerset(X4))|![X6]:((~(in(X6,X5))|subset(X6,X4))&(~(subset(X6,X4))|in(X6,X5))))&(?[X7]:((~(in(X7,X5))|~(subset(X7,X4)))&(in(X7,X5)|subset(X7,X4)))|X5=powerset(X4))),inference(variable_rename,[status(thm)],[173])).
% fof(175, plain,![X4]:![X5]:((~(X5=powerset(X4))|![X6]:((~(in(X6,X5))|subset(X6,X4))&(~(subset(X6,X4))|in(X6,X5))))&(((~(in(esk5_2(X4,X5),X5))|~(subset(esk5_2(X4,X5),X4)))&(in(esk5_2(X4,X5),X5)|subset(esk5_2(X4,X5),X4)))|X5=powerset(X4))),inference(skolemize,[status(esa)],[174])).
% fof(176, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|subset(X6,X4))&(~(subset(X6,X4))|in(X6,X5)))|~(X5=powerset(X4)))&(((~(in(esk5_2(X4,X5),X5))|~(subset(esk5_2(X4,X5),X4)))&(in(esk5_2(X4,X5),X5)|subset(esk5_2(X4,X5),X4)))|X5=powerset(X4))),inference(shift_quantors,[status(thm)],[175])).
% fof(177, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|subset(X6,X4))|~(X5=powerset(X4)))&((~(subset(X6,X4))|in(X6,X5))|~(X5=powerset(X4))))&(((~(in(esk5_2(X4,X5),X5))|~(subset(esk5_2(X4,X5),X4)))|X5=powerset(X4))&((in(esk5_2(X4,X5),X5)|subset(esk5_2(X4,X5),X4))|X5=powerset(X4)))),inference(distribute,[status(thm)],[176])).
% cnf(180,plain,(in(X3,X1)|X1!=powerset(X2)|~subset(X3,X2)),inference(split_conjunct,[status(thm)],[177])).
% fof(185, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(in(X3,X1))|in(X3,X2)))&(?[X3]:(in(X3,X1)&~(in(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[12])).
% fof(186, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&(?[X7]:(in(X7,X4)&~(in(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[185])).
% fof(187, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk6_2(X4,X5),X4)&~(in(esk6_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[186])).
% fof(188, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk6_2(X4,X5),X4)&~(in(esk6_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[187])).
% fof(189, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk6_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk6_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[188])).
% cnf(190,plain,(subset(X1,X2)|~in(esk6_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[189])).
% cnf(191,plain,(subset(X1,X2)|in(esk6_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[189])).
% fof(224, plain,![X1]:![X2]:(~(in(X1,X2))|~(empty(X2))),inference(fof_nnf,[status(thm)],[21])).
% fof(225, plain,![X3]:![X4]:(~(in(X3,X4))|~(empty(X4))),inference(variable_rename,[status(thm)],[224])).
% cnf(226,plain,(~empty(X1)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[225])).
% fof(558, negated_conjecture,?[X1]:?[X2]:(![X3]:(~(in(X3,X1))|in(X3,X2))&~(element(X1,powerset(X2)))),inference(fof_nnf,[status(thm)],[114])).
% fof(559, negated_conjecture,?[X4]:?[X5]:(![X6]:(~(in(X6,X4))|in(X6,X5))&~(element(X4,powerset(X5)))),inference(variable_rename,[status(thm)],[558])).
% fof(560, negated_conjecture,(![X6]:(~(in(X6,esk28_0))|in(X6,esk29_0))&~(element(esk28_0,powerset(esk29_0)))),inference(skolemize,[status(esa)],[559])).
% fof(561, negated_conjecture,![X6]:((~(in(X6,esk28_0))|in(X6,esk29_0))&~(element(esk28_0,powerset(esk29_0)))),inference(shift_quantors,[status(thm)],[560])).
% cnf(562,negated_conjecture,(~element(esk28_0,powerset(esk29_0))),inference(split_conjunct,[status(thm)],[561])).
% cnf(563,negated_conjecture,(in(X1,esk29_0)|~in(X1,esk28_0)),inference(split_conjunct,[status(thm)],[561])).
% cnf(626,plain,(element(X2,X1)|~in(X2,X1)),inference(csr,[status(thm)],[165,226])).
% cnf(636,negated_conjecture,(~in(esk28_0,powerset(esk29_0))),inference(spm,[status(thm)],[562,626,theory(equality)])).
% cnf(799,negated_conjecture,(in(esk6_2(esk28_0,X1),esk29_0)|subset(esk28_0,X1)),inference(spm,[status(thm)],[563,191,theory(equality)])).
% cnf(3032,negated_conjecture,(subset(esk28_0,esk29_0)),inference(spm,[status(thm)],[190,799,theory(equality)])).
% cnf(3038,negated_conjecture,(in(esk28_0,X1)|powerset(esk29_0)!=X1),inference(spm,[status(thm)],[180,3032,theory(equality)])).
% cnf(3057,negated_conjecture,($false),inference(spm,[status(thm)],[636,3038,theory(equality)])).
% cnf(3058,negated_conjecture,($false),3057,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 483
% # ...of these trivial : 7
% # ...subsumed : 78
% # ...remaining for further processing: 398
% # Other redundant clauses eliminated : 57
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 5
% # Generated clauses : 2150
% # ...of the previous two non-trivial : 1911
% # Contextual simplify-reflections : 3
% # Paramodulations : 2058
% # Factorizations : 14
% # Equation resolutions : 78
% # Current number of processed clauses: 224
% # Positive orientable unit clauses: 29
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 29
% # Non-unit-clauses : 163
% # Current number of unprocessed clauses: 1739
% # ...number of literals in the above : 5991
% # Clause-clause subsumption calls (NU) : 900
% # Rec. Clause-clause subsumption calls : 761
% # Unit Clause-clause subsumption calls : 89
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 37
% # Indexed BW rewrite successes : 28
% # Backwards rewriting index: 174 leaves, 1.64+/-1.801 terms/leaf
% # Paramod-from index: 92 leaves, 1.22+/-0.528 terms/leaf
% # Paramod-into index: 168 leaves, 1.49+/-1.367 terms/leaf
% # -------------------------------------------------
% # User time : 0.109 s
% # System time : 0.010 s
% # Total time : 0.119 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.25 CPU 0.33 WC
% FINAL PrfWatch: 0.25 CPU 0.33 WC
% SZS output end Solution for /tmp/SystemOnTPTP24632/SEU173+2.tptp
%
%------------------------------------------------------------------------------