TSTP Solution File: SEU094+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU094+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 01:05:59 EST 2010
% Result : Theorem 1.25s
% Output : Solution 1.25s
% 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/SystemOnTPTP9588/SEU094+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9588/SEU094+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9588/SEU094+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 9720
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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]:((finite(X1)&![X2]:(in(X2,X1)=>finite(X2)))=>finite(union(X1))),file('/tmp/SRASS.s.p', l22_finset_1)).
% fof(3, axiom,![X1]:![X2]:(in(X1,X2)=>subset(X1,union(X2))),file('/tmp/SRASS.s.p', t92_zfmisc_1)).
% fof(8, axiom,![X1]:(finite(X1)<=>finite(powerset(X1))),file('/tmp/SRASS.s.p', t24_finset_1)).
% fof(16, axiom,![X1]:![X2]:((subset(X1,X2)&finite(X2))=>finite(X1)),file('/tmp/SRASS.s.p', t13_finset_1)).
% fof(21, axiom,![X1]:subset(X1,powerset(union(X1))),file('/tmp/SRASS.s.p', t100_zfmisc_1)).
% fof(60, conjecture,![X1]:((finite(X1)&![X2]:(in(X2,X1)=>finite(X2)))<=>finite(union(X1))),file('/tmp/SRASS.s.p', t25_finset_1)).
% fof(61, negated_conjecture,~(![X1]:((finite(X1)&![X2]:(in(X2,X1)=>finite(X2)))<=>finite(union(X1)))),inference(assume_negation,[status(cth)],[60])).
% fof(76, plain,![X1]:((~(finite(X1))|?[X2]:(in(X2,X1)&~(finite(X2))))|finite(union(X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(77, plain,![X3]:((~(finite(X3))|?[X4]:(in(X4,X3)&~(finite(X4))))|finite(union(X3))),inference(variable_rename,[status(thm)],[76])).
% fof(78, plain,![X3]:((~(finite(X3))|(in(esk1_1(X3),X3)&~(finite(esk1_1(X3)))))|finite(union(X3))),inference(skolemize,[status(esa)],[77])).
% fof(79, plain,![X3]:(((in(esk1_1(X3),X3)|~(finite(X3)))|finite(union(X3)))&((~(finite(esk1_1(X3)))|~(finite(X3)))|finite(union(X3)))),inference(distribute,[status(thm)],[78])).
% cnf(80,plain,(finite(union(X1))|~finite(X1)|~finite(esk1_1(X1))),inference(split_conjunct,[status(thm)],[79])).
% cnf(81,plain,(finite(union(X1))|in(esk1_1(X1),X1)|~finite(X1)),inference(split_conjunct,[status(thm)],[79])).
% fof(82, plain,![X1]:![X2]:(~(in(X1,X2))|subset(X1,union(X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(83, plain,![X3]:![X4]:(~(in(X3,X4))|subset(X3,union(X4))),inference(variable_rename,[status(thm)],[82])).
% cnf(84,plain,(subset(X1,union(X2))|~in(X1,X2)),inference(split_conjunct,[status(thm)],[83])).
% fof(98, plain,![X1]:((~(finite(X1))|finite(powerset(X1)))&(~(finite(powerset(X1)))|finite(X1))),inference(fof_nnf,[status(thm)],[8])).
% fof(99, plain,![X2]:((~(finite(X2))|finite(powerset(X2)))&(~(finite(powerset(X2)))|finite(X2))),inference(variable_rename,[status(thm)],[98])).
% cnf(101,plain,(finite(powerset(X1))|~finite(X1)),inference(split_conjunct,[status(thm)],[99])).
% fof(126, plain,![X1]:![X2]:((~(subset(X1,X2))|~(finite(X2)))|finite(X1)),inference(fof_nnf,[status(thm)],[16])).
% fof(127, plain,![X3]:![X4]:((~(subset(X3,X4))|~(finite(X4)))|finite(X3)),inference(variable_rename,[status(thm)],[126])).
% cnf(128,plain,(finite(X1)|~finite(X2)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[127])).
% fof(152, plain,![X2]:subset(X2,powerset(union(X2))),inference(variable_rename,[status(thm)],[21])).
% cnf(153,plain,(subset(X1,powerset(union(X1)))),inference(split_conjunct,[status(thm)],[152])).
% fof(340, negated_conjecture,?[X1]:(((~(finite(X1))|?[X2]:(in(X2,X1)&~(finite(X2))))|~(finite(union(X1))))&((finite(X1)&![X2]:(~(in(X2,X1))|finite(X2)))|finite(union(X1)))),inference(fof_nnf,[status(thm)],[61])).
% fof(341, negated_conjecture,?[X3]:(((~(finite(X3))|?[X4]:(in(X4,X3)&~(finite(X4))))|~(finite(union(X3))))&((finite(X3)&![X5]:(~(in(X5,X3))|finite(X5)))|finite(union(X3)))),inference(variable_rename,[status(thm)],[340])).
% fof(342, negated_conjecture,(((~(finite(esk28_0))|(in(esk29_0,esk28_0)&~(finite(esk29_0))))|~(finite(union(esk28_0))))&((finite(esk28_0)&![X5]:(~(in(X5,esk28_0))|finite(X5)))|finite(union(esk28_0)))),inference(skolemize,[status(esa)],[341])).
% fof(343, negated_conjecture,![X5]:((((~(in(X5,esk28_0))|finite(X5))&finite(esk28_0))|finite(union(esk28_0)))&((~(finite(esk28_0))|(in(esk29_0,esk28_0)&~(finite(esk29_0))))|~(finite(union(esk28_0))))),inference(shift_quantors,[status(thm)],[342])).
% fof(344, negated_conjecture,![X5]:((((~(in(X5,esk28_0))|finite(X5))|finite(union(esk28_0)))&(finite(esk28_0)|finite(union(esk28_0))))&(((in(esk29_0,esk28_0)|~(finite(esk28_0)))|~(finite(union(esk28_0))))&((~(finite(esk29_0))|~(finite(esk28_0)))|~(finite(union(esk28_0)))))),inference(distribute,[status(thm)],[343])).
% cnf(345,negated_conjecture,(~finite(union(esk28_0))|~finite(esk28_0)|~finite(esk29_0)),inference(split_conjunct,[status(thm)],[344])).
% cnf(346,negated_conjecture,(in(esk29_0,esk28_0)|~finite(union(esk28_0))|~finite(esk28_0)),inference(split_conjunct,[status(thm)],[344])).
% cnf(347,negated_conjecture,(finite(union(esk28_0))|finite(esk28_0)),inference(split_conjunct,[status(thm)],[344])).
% cnf(348,negated_conjecture,(finite(union(esk28_0))|finite(X1)|~in(X1,esk28_0)),inference(split_conjunct,[status(thm)],[344])).
% cnf(375,plain,(finite(X1)|~finite(powerset(union(X1)))),inference(spm,[status(thm)],[128,153,theory(equality)])).
% cnf(376,plain,(finite(X1)|~finite(union(X2))|~in(X1,X2)),inference(spm,[status(thm)],[128,84,theory(equality)])).
% cnf(422,negated_conjecture,(finite(union(esk28_0))|finite(esk1_1(esk28_0))|~finite(esk28_0)),inference(spm,[status(thm)],[348,81,theory(equality)])).
% cnf(575,negated_conjecture,(finite(union(esk28_0))|finite(esk1_1(esk28_0))),inference(csr,[status(thm)],[422,347])).
% cnf(576,negated_conjecture,(finite(union(esk28_0))|~finite(esk28_0)),inference(spm,[status(thm)],[80,575,theory(equality)])).
% cnf(577,negated_conjecture,(finite(union(esk28_0))),inference(csr,[status(thm)],[576,347])).
% cnf(580,negated_conjecture,(in(esk29_0,esk28_0)|$false|~finite(esk28_0)),inference(rw,[status(thm)],[346,577,theory(equality)])).
% cnf(581,negated_conjecture,(in(esk29_0,esk28_0)|~finite(esk28_0)),inference(cn,[status(thm)],[580,theory(equality)])).
% cnf(582,negated_conjecture,($false|~finite(esk28_0)|~finite(esk29_0)),inference(rw,[status(thm)],[345,577,theory(equality)])).
% cnf(583,negated_conjecture,(~finite(esk28_0)|~finite(esk29_0)),inference(cn,[status(thm)],[582,theory(equality)])).
% cnf(590,plain,(finite(X1)|~finite(union(X1))),inference(spm,[status(thm)],[375,101,theory(equality)])).
% cnf(595,negated_conjecture,(finite(esk28_0)),inference(spm,[status(thm)],[590,577,theory(equality)])).
% cnf(603,negated_conjecture,(in(esk29_0,esk28_0)|$false),inference(rw,[status(thm)],[581,595,theory(equality)])).
% cnf(604,negated_conjecture,(in(esk29_0,esk28_0)),inference(cn,[status(thm)],[603,theory(equality)])).
% cnf(605,negated_conjecture,($false|~finite(esk29_0)),inference(rw,[status(thm)],[583,595,theory(equality)])).
% cnf(606,negated_conjecture,(~finite(esk29_0)),inference(cn,[status(thm)],[605,theory(equality)])).
% cnf(618,negated_conjecture,(finite(X1)|~in(X1,esk28_0)),inference(spm,[status(thm)],[376,577,theory(equality)])).
% cnf(625,negated_conjecture,(finite(esk29_0)),inference(spm,[status(thm)],[618,604,theory(equality)])).
% cnf(628,negated_conjecture,($false),inference(sr,[status(thm)],[625,606,theory(equality)])).
% cnf(629,negated_conjecture,($false),628,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 347
% # ...of these trivial : 8
% # ...subsumed : 17
% # ...remaining for further processing: 322
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 42
% # Generated clauses : 153
% # ...of the previous two non-trivial : 124
% # Contextual simplify-reflections : 16
% # Paramodulations : 150
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 138
% # Positive orientable unit clauses: 72
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 15
% # Non-unit-clauses : 51
% # Current number of unprocessed clauses: 38
% # ...number of literals in the above : 99
% # Clause-clause subsumption calls (NU) : 106
% # Rec. Clause-clause subsumption calls : 96
% # Unit Clause-clause subsumption calls : 74
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 15
% # Indexed BW rewrite successes : 10
% # Backwards rewriting index: 149 leaves, 1.09+/-0.365 terms/leaf
% # Paramod-from index: 92 leaves, 1.01+/-0.104 terms/leaf
% # Paramod-into index: 146 leaves, 1.05+/-0.256 terms/leaf
% # -------------------------------------------------
% # User time : 0.030 s
% # System time : 0.004 s
% # Total time : 0.034 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.20 WC
% FINAL PrfWatch: 0.14 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP9588/SEU094+1.tptp
%
%------------------------------------------------------------------------------