TSTP Solution File: SEU118+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU118+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 : art04.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:09:05 EST 2010
% Result : Theorem 0.93s
% Output : Solution 0.93s
% 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/SystemOnTPTP14153/SEU118+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14153/SEU118+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14153/SEU118+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 14249
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(finite(X1)=>![X2]:(element(X2,powerset(X1))=>finite(X2))),file('/tmp/SRASS.s.p', cc2_finset_1)).
% fof(12, axiom,![X1]:![X2]:(element(X1,powerset(X2))<=>subset(X1,X2)),file('/tmp/SRASS.s.p', t3_subset)).
% fof(13, axiom,![X1]:preboolean(finite_subsets(X1)),file('/tmp/SRASS.s.p', dt_k5_finsub_1)).
% fof(20, axiom,![X1]:![X2]:(in(X1,X2)=>element(X1,X2)),file('/tmp/SRASS.s.p', t1_subset)).
% fof(26, axiom,![X1]:![X2]:(preboolean(X2)=>(X2=finite_subsets(X1)<=>![X3]:(in(X3,X2)<=>(subset(X3,X1)&finite(X3))))),file('/tmp/SRASS.s.p', d5_finsub_1)).
% fof(33, conjecture,![X1]:![X2]:(element(X2,powerset(X1))=>(finite(X1)=>element(X2,finite_subsets(X1)))),file('/tmp/SRASS.s.p', t34_finsub_1)).
% fof(34, negated_conjecture,~(![X1]:![X2]:(element(X2,powerset(X1))=>(finite(X1)=>element(X2,finite_subsets(X1))))),inference(assume_negation,[status(cth)],[33])).
% fof(45, plain,![X1]:(~(finite(X1))|![X2]:(~(element(X2,powerset(X1)))|finite(X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(46, plain,![X3]:(~(finite(X3))|![X4]:(~(element(X4,powerset(X3)))|finite(X4))),inference(variable_rename,[status(thm)],[45])).
% fof(47, plain,![X3]:![X4]:((~(element(X4,powerset(X3)))|finite(X4))|~(finite(X3))),inference(shift_quantors,[status(thm)],[46])).
% cnf(48,plain,(finite(X2)|~finite(X1)|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[47])).
% fof(91, plain,![X1]:![X2]:((~(element(X1,powerset(X2)))|subset(X1,X2))&(~(subset(X1,X2))|element(X1,powerset(X2)))),inference(fof_nnf,[status(thm)],[12])).
% fof(92, plain,![X3]:![X4]:((~(element(X3,powerset(X4)))|subset(X3,X4))&(~(subset(X3,X4))|element(X3,powerset(X4)))),inference(variable_rename,[status(thm)],[91])).
% cnf(94,plain,(subset(X1,X2)|~element(X1,powerset(X2))),inference(split_conjunct,[status(thm)],[92])).
% fof(95, plain,![X2]:preboolean(finite_subsets(X2)),inference(variable_rename,[status(thm)],[13])).
% cnf(96,plain,(preboolean(finite_subsets(X1))),inference(split_conjunct,[status(thm)],[95])).
% fof(114, plain,![X1]:![X2]:(~(in(X1,X2))|element(X1,X2)),inference(fof_nnf,[status(thm)],[20])).
% fof(115, plain,![X3]:![X4]:(~(in(X3,X4))|element(X3,X4)),inference(variable_rename,[status(thm)],[114])).
% cnf(116,plain,(element(X1,X2)|~in(X1,X2)),inference(split_conjunct,[status(thm)],[115])).
% fof(134, plain,![X1]:![X2]:(~(preboolean(X2))|((~(X2=finite_subsets(X1))|![X3]:((~(in(X3,X2))|(subset(X3,X1)&finite(X3)))&((~(subset(X3,X1))|~(finite(X3)))|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|(~(subset(X3,X1))|~(finite(X3))))&(in(X3,X2)|(subset(X3,X1)&finite(X3))))|X2=finite_subsets(X1)))),inference(fof_nnf,[status(thm)],[26])).
% fof(135, plain,![X4]:![X5]:(~(preboolean(X5))|((~(X5=finite_subsets(X4))|![X6]:((~(in(X6,X5))|(subset(X6,X4)&finite(X6)))&((~(subset(X6,X4))|~(finite(X6)))|in(X6,X5))))&(?[X7]:((~(in(X7,X5))|(~(subset(X7,X4))|~(finite(X7))))&(in(X7,X5)|(subset(X7,X4)&finite(X7))))|X5=finite_subsets(X4)))),inference(variable_rename,[status(thm)],[134])).
% fof(136, plain,![X4]:![X5]:(~(preboolean(X5))|((~(X5=finite_subsets(X4))|![X6]:((~(in(X6,X5))|(subset(X6,X4)&finite(X6)))&((~(subset(X6,X4))|~(finite(X6)))|in(X6,X5))))&(((~(in(esk9_2(X4,X5),X5))|(~(subset(esk9_2(X4,X5),X4))|~(finite(esk9_2(X4,X5)))))&(in(esk9_2(X4,X5),X5)|(subset(esk9_2(X4,X5),X4)&finite(esk9_2(X4,X5)))))|X5=finite_subsets(X4)))),inference(skolemize,[status(esa)],[135])).
% fof(137, plain,![X4]:![X5]:![X6]:(((((~(in(X6,X5))|(subset(X6,X4)&finite(X6)))&((~(subset(X6,X4))|~(finite(X6)))|in(X6,X5)))|~(X5=finite_subsets(X4)))&(((~(in(esk9_2(X4,X5),X5))|(~(subset(esk9_2(X4,X5),X4))|~(finite(esk9_2(X4,X5)))))&(in(esk9_2(X4,X5),X5)|(subset(esk9_2(X4,X5),X4)&finite(esk9_2(X4,X5)))))|X5=finite_subsets(X4)))|~(preboolean(X5))),inference(shift_quantors,[status(thm)],[136])).
% fof(138, plain,![X4]:![X5]:![X6]:((((((subset(X6,X4)|~(in(X6,X5)))|~(X5=finite_subsets(X4)))|~(preboolean(X5)))&(((finite(X6)|~(in(X6,X5)))|~(X5=finite_subsets(X4)))|~(preboolean(X5))))&((((~(subset(X6,X4))|~(finite(X6)))|in(X6,X5))|~(X5=finite_subsets(X4)))|~(preboolean(X5))))&((((~(in(esk9_2(X4,X5),X5))|(~(subset(esk9_2(X4,X5),X4))|~(finite(esk9_2(X4,X5)))))|X5=finite_subsets(X4))|~(preboolean(X5)))&((((subset(esk9_2(X4,X5),X4)|in(esk9_2(X4,X5),X5))|X5=finite_subsets(X4))|~(preboolean(X5)))&(((finite(esk9_2(X4,X5))|in(esk9_2(X4,X5),X5))|X5=finite_subsets(X4))|~(preboolean(X5)))))),inference(distribute,[status(thm)],[137])).
% cnf(142,plain,(in(X3,X1)|~preboolean(X1)|X1!=finite_subsets(X2)|~finite(X3)|~subset(X3,X2)),inference(split_conjunct,[status(thm)],[138])).
% fof(178, negated_conjecture,?[X1]:?[X2]:(element(X2,powerset(X1))&(finite(X1)&~(element(X2,finite_subsets(X1))))),inference(fof_nnf,[status(thm)],[34])).
% fof(179, negated_conjecture,?[X3]:?[X4]:(element(X4,powerset(X3))&(finite(X3)&~(element(X4,finite_subsets(X3))))),inference(variable_rename,[status(thm)],[178])).
% fof(180, negated_conjecture,(element(esk13_0,powerset(esk12_0))&(finite(esk12_0)&~(element(esk13_0,finite_subsets(esk12_0))))),inference(skolemize,[status(esa)],[179])).
% cnf(181,negated_conjecture,(~element(esk13_0,finite_subsets(esk12_0))),inference(split_conjunct,[status(thm)],[180])).
% cnf(182,negated_conjecture,(finite(esk12_0)),inference(split_conjunct,[status(thm)],[180])).
% cnf(183,negated_conjecture,(element(esk13_0,powerset(esk12_0))),inference(split_conjunct,[status(thm)],[180])).
% cnf(219,negated_conjecture,(finite(esk13_0)|~finite(esk12_0)),inference(pm,[status(thm)],[48,183,theory(equality)])).
% cnf(221,negated_conjecture,(finite(esk13_0)|$false),inference(rw,[status(thm)],[219,182,theory(equality)])).
% cnf(222,negated_conjecture,(finite(esk13_0)),inference(cn,[status(thm)],[221,theory(equality)])).
% cnf(226,negated_conjecture,(subset(esk13_0,esk12_0)),inference(pm,[status(thm)],[94,183,theory(equality)])).
% cnf(333,negated_conjecture,(in(esk13_0,X1)|finite_subsets(esk12_0)!=X1|~preboolean(X1)|~finite(esk13_0)),inference(pm,[status(thm)],[142,226,theory(equality)])).
% cnf(338,negated_conjecture,(in(esk13_0,X1)|finite_subsets(esk12_0)!=X1|~preboolean(X1)|$false),inference(rw,[status(thm)],[333,222,theory(equality)])).
% cnf(339,negated_conjecture,(in(esk13_0,X1)|finite_subsets(esk12_0)!=X1|~preboolean(X1)),inference(cn,[status(thm)],[338,theory(equality)])).
% cnf(493,negated_conjecture,(in(esk13_0,finite_subsets(esk12_0))|~preboolean(finite_subsets(esk12_0))),inference(er,[status(thm)],[339,theory(equality)])).
% cnf(494,negated_conjecture,(in(esk13_0,finite_subsets(esk12_0))|$false),inference(rw,[status(thm)],[493,96,theory(equality)])).
% cnf(495,negated_conjecture,(in(esk13_0,finite_subsets(esk12_0))),inference(cn,[status(thm)],[494,theory(equality)])).
% cnf(497,negated_conjecture,(element(esk13_0,finite_subsets(esk12_0))),inference(pm,[status(thm)],[116,495,theory(equality)])).
% cnf(501,negated_conjecture,($false),inference(sr,[status(thm)],[497,181,theory(equality)])).
% cnf(502,negated_conjecture,($false),501,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 176
% # ...of these trivial : 6
% # ...subsumed : 25
% # ...remaining for further processing: 145
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 25
% # Generated clauses : 195
% # ...of the previous two non-trivial : 169
% # Contextual simplify-reflections : 0
% # Paramodulations : 185
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 120
% # Positive orientable unit clauses: 48
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 12
% # Non-unit-clauses : 60
% # Current number of unprocessed clauses: 46
% # ...number of literals in the above : 118
% # Clause-clause subsumption calls (NU) : 137
% # Rec. Clause-clause subsumption calls : 107
% # Unit Clause-clause subsumption calls : 241
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 41
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 132 leaves, 1.20+/-0.668 terms/leaf
% # Paramod-from index: 59 leaves, 1.07+/-0.516 terms/leaf
% # Paramod-into index: 121 leaves, 1.13+/-0.545 terms/leaf
% # -------------------------------------------------
% # User time : 0.022 s
% # System time : 0.004 s
% # Total time : 0.026 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP14153/SEU118+1.tptp
%
%------------------------------------------------------------------------------