TSTP Solution File: SEU173+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU173+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 : 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:25:42 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/SystemOnTPTP22744/SEU173+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP22744/SEU173+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22744/SEU173+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 22840
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, 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]:![X2]:~((in(X1,X2)&empty(X2))),file('/tmp/SRASS.s.p', t7_boole)).
% fof(11, 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(19, conjecture,![X1]:![X2]:(![X3]:(in(X3,X1)=>in(X3,X2))=>element(X1,powerset(X2))),file('/tmp/SRASS.s.p', l71_subset_1)).
% fof(20, negated_conjecture,~(![X1]:![X2]:(![X3]:(in(X3,X1)=>in(X3,X2))=>element(X1,powerset(X2)))),inference(assume_negation,[status(cth)],[19])).
% fof(23, plain,![X1]:![X2]:((~(empty(X1))=>(element(X2,X1)<=>in(X2,X1)))&(empty(X1)=>(element(X2,X1)<=>empty(X2)))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(42, 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)],[23])).
% fof(43, 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)],[42])).
% fof(44, 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)],[43])).
% cnf(47,plain,(empty(X1)|element(X2,X1)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[44])).
% fof(51, plain,![X1]:![X2]:(~(in(X1,X2))|~(empty(X2))),inference(fof_nnf,[status(thm)],[7])).
% fof(52, plain,![X3]:![X4]:(~(in(X3,X4))|~(empty(X4))),inference(variable_rename,[status(thm)],[51])).
% cnf(53,plain,(~empty(X1)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[52])).
% fof(62, 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)],[11])).
% fof(63, 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)],[62])).
% fof(64, plain,![X4]:![X5]:((~(X5=powerset(X4))|![X6]:((~(in(X6,X5))|subset(X6,X4))&(~(subset(X6,X4))|in(X6,X5))))&(((~(in(esk6_2(X4,X5),X5))|~(subset(esk6_2(X4,X5),X4)))&(in(esk6_2(X4,X5),X5)|subset(esk6_2(X4,X5),X4)))|X5=powerset(X4))),inference(skolemize,[status(esa)],[63])).
% fof(65, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|subset(X6,X4))&(~(subset(X6,X4))|in(X6,X5)))|~(X5=powerset(X4)))&(((~(in(esk6_2(X4,X5),X5))|~(subset(esk6_2(X4,X5),X4)))&(in(esk6_2(X4,X5),X5)|subset(esk6_2(X4,X5),X4)))|X5=powerset(X4))),inference(shift_quantors,[status(thm)],[64])).
% fof(66, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|subset(X6,X4))|~(X5=powerset(X4)))&((~(subset(X6,X4))|in(X6,X5))|~(X5=powerset(X4))))&(((~(in(esk6_2(X4,X5),X5))|~(subset(esk6_2(X4,X5),X4)))|X5=powerset(X4))&((in(esk6_2(X4,X5),X5)|subset(esk6_2(X4,X5),X4))|X5=powerset(X4)))),inference(distribute,[status(thm)],[65])).
% cnf(69,plain,(in(X3,X1)|X1!=powerset(X2)|~subset(X3,X2)),inference(split_conjunct,[status(thm)],[66])).
% fof(71, 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(72, 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)],[71])).
% fof(73, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk7_2(X4,X5),X4)&~(in(esk7_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[72])).
% fof(74, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk7_2(X4,X5),X4)&~(in(esk7_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[73])).
% fof(75, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk7_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk7_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[74])).
% cnf(76,plain,(subset(X1,X2)|~in(esk7_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[75])).
% cnf(77,plain,(subset(X1,X2)|in(esk7_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[75])).
% fof(89, negated_conjecture,?[X1]:?[X2]:(![X3]:(~(in(X3,X1))|in(X3,X2))&~(element(X1,powerset(X2)))),inference(fof_nnf,[status(thm)],[20])).
% fof(90, negated_conjecture,?[X4]:?[X5]:(![X6]:(~(in(X6,X4))|in(X6,X5))&~(element(X4,powerset(X5)))),inference(variable_rename,[status(thm)],[89])).
% fof(91, negated_conjecture,(![X6]:(~(in(X6,esk8_0))|in(X6,esk9_0))&~(element(esk8_0,powerset(esk9_0)))),inference(skolemize,[status(esa)],[90])).
% fof(92, negated_conjecture,![X6]:((~(in(X6,esk8_0))|in(X6,esk9_0))&~(element(esk8_0,powerset(esk9_0)))),inference(shift_quantors,[status(thm)],[91])).
% cnf(93,negated_conjecture,(~element(esk8_0,powerset(esk9_0))),inference(split_conjunct,[status(thm)],[92])).
% cnf(94,negated_conjecture,(in(X1,esk9_0)|~in(X1,esk8_0)),inference(split_conjunct,[status(thm)],[92])).
% cnf(105,plain,(element(X2,X1)|~in(X2,X1)),inference(csr,[status(thm)],[47,53])).
% cnf(113,negated_conjecture,(in(esk7_2(esk8_0,X1),esk9_0)|subset(esk8_0,X1)),inference(spm,[status(thm)],[94,77,theory(equality)])).
% cnf(202,negated_conjecture,(subset(esk8_0,esk9_0)),inference(spm,[status(thm)],[76,113,theory(equality)])).
% cnf(204,negated_conjecture,(in(esk8_0,X1)|powerset(esk9_0)!=X1),inference(spm,[status(thm)],[69,202,theory(equality)])).
% cnf(207,negated_conjecture,(in(esk8_0,powerset(esk9_0))),inference(er,[status(thm)],[204,theory(equality)])).
% cnf(210,negated_conjecture,(element(esk8_0,powerset(esk9_0))),inference(spm,[status(thm)],[105,207,theory(equality)])).
% cnf(213,negated_conjecture,($false),inference(sr,[status(thm)],[210,93,theory(equality)])).
% cnf(214,negated_conjecture,($false),213,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 71
% # ...of these trivial : 2
% # ...subsumed : 8
% # ...remaining for further processing: 61
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 89
% # ...of the previous two non-trivial : 70
% # Contextual simplify-reflections : 4
% # Paramodulations : 85
% # Factorizations : 0
% # Equation resolutions : 4
% # Current number of processed clauses: 57
% # Positive orientable unit clauses: 14
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 5
% # Non-unit-clauses : 38
% # Current number of unprocessed clauses: 16
% # ...number of literals in the above : 45
% # Clause-clause subsumption calls (NU) : 43
% # Rec. Clause-clause subsumption calls : 43
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 8
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 60 leaves, 1.17+/-0.553 terms/leaf
% # Paramod-from index: 23 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 51 leaves, 1.16+/-0.459 terms/leaf
% # -------------------------------------------------
% # User time : 0.015 s
% # System time : 0.003 s
% # Total time : 0.018 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.17 WC
% FINAL PrfWatch: 0.11 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP22744/SEU173+1.tptp
%
%------------------------------------------------------------------------------