TSTP Solution File: SEU164+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU164+3 : TPTP v5.0.0. Bugfixed v4.0.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:23:07 EST 2010
% Result : Theorem 2.65s
% Output : Solution 2.65s
% 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/SystemOnTPTP21708/SEU164+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21708/SEU164+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21708/SEU164+3.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 21804
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, 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(3, axiom,![X1]:![X2]:(X2=powerset(X1)<=>![X3]:(in(X3,X2)<=>subset(X3,X1))),file('/tmp/SRASS.s.p', d1_zfmisc_1)).
% fof(5, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(6, axiom,![X1]:![X2]:subset(X1,X1),file('/tmp/SRASS.s.p', reflexivity_r1_tarski)).
% fof(11, conjecture,![X1]:union(powerset(X1))=X1,file('/tmp/SRASS.s.p', t99_zfmisc_1)).
% fof(12, negated_conjecture,~(![X1]:union(powerset(X1))=X1),inference(assume_negation,[status(cth)],[11])).
% fof(15, 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)],[1])).
% fof(16, 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)],[15])).
% fof(17, plain,![X5]:![X6]:((~(X6=union(X5))|![X7]:((~(in(X7,X6))|(in(X7,esk1_3(X5,X6,X7))&in(esk1_3(X5,X6,X7),X5)))&(![X9]:(~(in(X7,X9))|~(in(X9,X5)))|in(X7,X6))))&(((~(in(esk2_2(X5,X6),X6))|![X11]:(~(in(esk2_2(X5,X6),X11))|~(in(X11,X5))))&(in(esk2_2(X5,X6),X6)|(in(esk2_2(X5,X6),esk3_2(X5,X6))&in(esk3_2(X5,X6),X5))))|X6=union(X5))),inference(skolemize,[status(esa)],[16])).
% fof(18, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(esk2_2(X5,X6),X11))|~(in(X11,X5)))|~(in(esk2_2(X5,X6),X6)))&(in(esk2_2(X5,X6),X6)|(in(esk2_2(X5,X6),esk3_2(X5,X6))&in(esk3_2(X5,X6),X5))))|X6=union(X5))&((((~(in(X7,X9))|~(in(X9,X5)))|in(X7,X6))&(~(in(X7,X6))|(in(X7,esk1_3(X5,X6,X7))&in(esk1_3(X5,X6,X7),X5))))|~(X6=union(X5)))),inference(shift_quantors,[status(thm)],[17])).
% fof(19, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(in(esk2_2(X5,X6),X11))|~(in(X11,X5)))|~(in(esk2_2(X5,X6),X6)))|X6=union(X5))&(((in(esk2_2(X5,X6),esk3_2(X5,X6))|in(esk2_2(X5,X6),X6))|X6=union(X5))&((in(esk3_2(X5,X6),X5)|in(esk2_2(X5,X6),X6))|X6=union(X5))))&((((~(in(X7,X9))|~(in(X9,X5)))|in(X7,X6))|~(X6=union(X5)))&(((in(X7,esk1_3(X5,X6,X7))|~(in(X7,X6)))|~(X6=union(X5)))&((in(esk1_3(X5,X6,X7),X5)|~(in(X7,X6)))|~(X6=union(X5)))))),inference(distribute,[status(thm)],[18])).
% cnf(23,plain,(X1=union(X2)|in(esk2_2(X2,X1),X1)|in(esk3_2(X2,X1),X2)),inference(split_conjunct,[status(thm)],[19])).
% cnf(24,plain,(X1=union(X2)|in(esk2_2(X2,X1),X1)|in(esk2_2(X2,X1),esk3_2(X2,X1))),inference(split_conjunct,[status(thm)],[19])).
% cnf(25,plain,(X1=union(X2)|~in(esk2_2(X2,X1),X1)|~in(X3,X2)|~in(esk2_2(X2,X1),X3)),inference(split_conjunct,[status(thm)],[19])).
% fof(32, 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)],[3])).
% fof(33, 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)],[32])).
% fof(34, 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)],[33])).
% fof(35, 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)],[34])).
% fof(36, 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)],[35])).
% cnf(39,plain,(in(X3,X1)|X1!=powerset(X2)|~subset(X3,X2)),inference(split_conjunct,[status(thm)],[36])).
% cnf(40,plain,(subset(X3,X2)|X1!=powerset(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[36])).
% fof(44, 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)],[5])).
% fof(45, 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)],[44])).
% fof(46, 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)],[45])).
% fof(47, 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)],[46])).
% fof(48, 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)],[47])).
% cnf(51,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[48])).
% fof(52, plain,![X3]:![X4]:subset(X3,X3),inference(variable_rename,[status(thm)],[6])).
% cnf(53,plain,(subset(X1,X1)),inference(split_conjunct,[status(thm)],[52])).
% fof(73, negated_conjecture,?[X1]:~(union(powerset(X1))=X1),inference(fof_nnf,[status(thm)],[12])).
% fof(74, negated_conjecture,?[X2]:~(union(powerset(X2))=X2),inference(variable_rename,[status(thm)],[73])).
% fof(75, negated_conjecture,~(union(powerset(esk10_0))=esk10_0),inference(skolemize,[status(esa)],[74])).
% cnf(76,negated_conjecture,(union(powerset(esk10_0))!=esk10_0),inference(split_conjunct,[status(thm)],[75])).
% cnf(82,plain,(in(X1,X2)|powerset(X1)!=X2),inference(spm,[status(thm)],[39,53,theory(equality)])).
% cnf(181,plain,(union(X1)=X2|in(esk3_2(X1,X2),X1)|~in(esk2_2(X1,X2),X2)|~in(X2,X1)),inference(spm,[status(thm)],[25,23,theory(equality)])).
% cnf(207,plain,(in(X1,powerset(X1))),inference(er,[status(thm)],[82,theory(equality)])).
% cnf(26712,plain,(union(X1)=X2|in(esk3_2(X1,X2),X1)|~in(X2,X1)),inference(csr,[status(thm)],[181,23])).
% cnf(26823,plain,(union(powerset(X1))=X1|in(esk3_2(powerset(X1),X1),powerset(X1))),inference(spm,[status(thm)],[26712,207,theory(equality)])).
% cnf(26901,plain,(subset(esk3_2(powerset(X1),X1),X2)|union(powerset(X1))=X1|powerset(X2)!=powerset(X1)),inference(spm,[status(thm)],[40,26823,theory(equality)])).
% cnf(30668,plain,(union(powerset(X1))=X1|subset(esk3_2(powerset(X1),X1),X1)),inference(er,[status(thm)],[26901,theory(equality)])).
% cnf(30720,negated_conjecture,(subset(esk3_2(powerset(esk10_0),esk10_0),esk10_0)),inference(spm,[status(thm)],[76,30668,theory(equality)])).
% cnf(31018,negated_conjecture,(in(X1,esk10_0)|~in(X1,esk3_2(powerset(esk10_0),esk10_0))),inference(spm,[status(thm)],[51,30720,theory(equality)])).
% cnf(31516,negated_conjecture,(in(esk2_2(powerset(esk10_0),esk10_0),esk10_0)|union(powerset(esk10_0))=esk10_0),inference(spm,[status(thm)],[31018,24,theory(equality)])).
% cnf(31524,negated_conjecture,(in(esk2_2(powerset(esk10_0),esk10_0),esk10_0)),inference(sr,[status(thm)],[31516,76,theory(equality)])).
% cnf(31539,negated_conjecture,(union(powerset(esk10_0))=esk10_0|~in(esk2_2(powerset(esk10_0),esk10_0),esk10_0)|~in(esk10_0,powerset(esk10_0))),inference(spm,[status(thm)],[25,31524,theory(equality)])).
% cnf(31559,negated_conjecture,(union(powerset(esk10_0))=esk10_0|$false|~in(esk10_0,powerset(esk10_0))),inference(rw,[status(thm)],[31539,31524,theory(equality)])).
% cnf(31560,negated_conjecture,(union(powerset(esk10_0))=esk10_0|$false|$false),inference(rw,[status(thm)],[31559,207,theory(equality)])).
% cnf(31561,negated_conjecture,(union(powerset(esk10_0))=esk10_0),inference(cn,[status(thm)],[31560,theory(equality)])).
% cnf(31562,negated_conjecture,($false),inference(sr,[status(thm)],[31561,76,theory(equality)])).
% cnf(31563,negated_conjecture,($false),31562,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 857
% # ...of these trivial : 2
% # ...subsumed : 286
% # ...remaining for further processing: 569
% # Other redundant clauses eliminated : 1526
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 0
% # Generated clauses : 31298
% # ...of the previous two non-trivial : 29529
% # Contextual simplify-reflections : 1
% # Paramodulations : 29656
% # Factorizations : 22
% # Equation resolutions : 1620
% # Current number of processed clauses: 541
% # Positive orientable unit clauses: 34
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 124
% # Non-unit-clauses : 383
% # Current number of unprocessed clauses: 28690
% # ...number of literals in the above : 156752
% # Clause-clause subsumption calls (NU) : 5183
% # Rec. Clause-clause subsumption calls : 4259
% # Unit Clause-clause subsumption calls : 1300
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 101
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 270 leaves, 2.54+/-4.464 terms/leaf
% # Paramod-from index: 119 leaves, 1.51+/-1.011 terms/leaf
% # Paramod-into index: 242 leaves, 2.52+/-4.653 terms/leaf
% # -------------------------------------------------
% # User time : 1.287 s
% # System time : 0.027 s
% # Total time : 1.314 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.86 CPU 1.94 WC
% FINAL PrfWatch: 1.86 CPU 1.94 WC
% SZS output end Solution for /tmp/SystemOnTPTP21708/SEU164+3.tptp
%
%------------------------------------------------------------------------------