TSTP Solution File: SEU114+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU114+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 : art07.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:08:40 EST 2010
% Result : Theorem 1.51s
% Output : Solution 1.51s
% 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/SystemOnTPTP15535/SEU114+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15535/SEU114+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15535/SEU114+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 15631
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(finite(X1)=>![X2]:(element(X2,powerset(X1))=>finite(X2))),file('/tmp/SRASS.s.p', cc2_finset_1)).
% fof(4, axiom,![X1]:subset(finite_subsets(X1),powerset(X1)),file('/tmp/SRASS.s.p', t26_finsub_1)).
% fof(10, axiom,![X1]:![X2]:(X1=X2<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', d10_xboole_0)).
% fof(11, axiom,![X1]:preboolean(finite_subsets(X1)),file('/tmp/SRASS.s.p', dt_k5_finsub_1)).
% fof(12, 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(14, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(22, axiom,![X1]:![X2]:(element(X1,powerset(X2))<=>subset(X1,X2)),file('/tmp/SRASS.s.p', t3_subset)).
% fof(31, axiom,![X1]:![X2]:(in(X1,X2)=>element(X1,X2)),file('/tmp/SRASS.s.p', t1_subset)).
% fof(36, conjecture,![X1]:(finite(X1)=>finite_subsets(X1)=powerset(X1)),file('/tmp/SRASS.s.p', t27_finsub_1)).
% fof(37, negated_conjecture,~(![X1]:(finite(X1)=>finite_subsets(X1)=powerset(X1))),inference(assume_negation,[status(cth)],[36])).
% fof(51, plain,![X1]:(~(finite(X1))|![X2]:(~(element(X2,powerset(X1)))|finite(X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(52, plain,![X3]:(~(finite(X3))|![X4]:(~(element(X4,powerset(X3)))|finite(X4))),inference(variable_rename,[status(thm)],[51])).
% fof(53, plain,![X3]:![X4]:((~(element(X4,powerset(X3)))|finite(X4))|~(finite(X3))),inference(shift_quantors,[status(thm)],[52])).
% cnf(54,plain,(finite(X2)|~finite(X1)|~element(X2,powerset(X1))),inference(split_conjunct,[status(thm)],[53])).
% fof(58, plain,![X2]:subset(finite_subsets(X2),powerset(X2)),inference(variable_rename,[status(thm)],[4])).
% cnf(59,plain,(subset(finite_subsets(X1),powerset(X1))),inference(split_conjunct,[status(thm)],[58])).
% fof(83, plain,![X1]:![X2]:((~(X1=X2)|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[10])).
% fof(84, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[83])).
% fof(85, plain,![X3]:![X4]:(((subset(X3,X4)|~(X3=X4))&(subset(X4,X3)|~(X3=X4)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(distribute,[status(thm)],[84])).
% cnf(86,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[85])).
% fof(89, plain,![X2]:preboolean(finite_subsets(X2)),inference(variable_rename,[status(thm)],[11])).
% cnf(90,plain,(preboolean(finite_subsets(X1))),inference(split_conjunct,[status(thm)],[89])).
% fof(91, 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)],[12])).
% fof(92, 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)],[91])).
% fof(93, 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(esk4_2(X4,X5),X5))|(~(subset(esk4_2(X4,X5),X4))|~(finite(esk4_2(X4,X5)))))&(in(esk4_2(X4,X5),X5)|(subset(esk4_2(X4,X5),X4)&finite(esk4_2(X4,X5)))))|X5=finite_subsets(X4)))),inference(skolemize,[status(esa)],[92])).
% fof(94, 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(esk4_2(X4,X5),X5))|(~(subset(esk4_2(X4,X5),X4))|~(finite(esk4_2(X4,X5)))))&(in(esk4_2(X4,X5),X5)|(subset(esk4_2(X4,X5),X4)&finite(esk4_2(X4,X5)))))|X5=finite_subsets(X4)))|~(preboolean(X5))),inference(shift_quantors,[status(thm)],[93])).
% fof(95, 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(esk4_2(X4,X5),X5))|(~(subset(esk4_2(X4,X5),X4))|~(finite(esk4_2(X4,X5)))))|X5=finite_subsets(X4))|~(preboolean(X5)))&((((subset(esk4_2(X4,X5),X4)|in(esk4_2(X4,X5),X5))|X5=finite_subsets(X4))|~(preboolean(X5)))&(((finite(esk4_2(X4,X5))|in(esk4_2(X4,X5),X5))|X5=finite_subsets(X4))|~(preboolean(X5)))))),inference(distribute,[status(thm)],[94])).
% cnf(99,plain,(in(X3,X1)|~preboolean(X1)|X1!=finite_subsets(X2)|~finite(X3)|~subset(X3,X2)),inference(split_conjunct,[status(thm)],[95])).
% fof(105, 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)],[14])).
% fof(106, 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)],[105])).
% fof(107, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk5_2(X4,X5),X4)&~(in(esk5_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[106])).
% fof(108, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk5_2(X4,X5),X4)&~(in(esk5_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[107])).
% fof(109, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk5_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk5_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[108])).
% cnf(110,plain,(subset(X1,X2)|~in(esk5_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[109])).
% cnf(111,plain,(subset(X1,X2)|in(esk5_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[109])).
% fof(137, plain,![X1]:![X2]:((~(element(X1,powerset(X2)))|subset(X1,X2))&(~(subset(X1,X2))|element(X1,powerset(X2)))),inference(fof_nnf,[status(thm)],[22])).
% fof(138, plain,![X3]:![X4]:((~(element(X3,powerset(X4)))|subset(X3,X4))&(~(subset(X3,X4))|element(X3,powerset(X4)))),inference(variable_rename,[status(thm)],[137])).
% cnf(140,plain,(subset(X1,X2)|~element(X1,powerset(X2))),inference(split_conjunct,[status(thm)],[138])).
% fof(165, plain,![X1]:![X2]:(~(in(X1,X2))|element(X1,X2)),inference(fof_nnf,[status(thm)],[31])).
% fof(166, plain,![X3]:![X4]:(~(in(X3,X4))|element(X3,X4)),inference(variable_rename,[status(thm)],[165])).
% cnf(167,plain,(element(X1,X2)|~in(X1,X2)),inference(split_conjunct,[status(thm)],[166])).
% fof(197, negated_conjecture,?[X1]:(finite(X1)&~(finite_subsets(X1)=powerset(X1))),inference(fof_nnf,[status(thm)],[37])).
% fof(198, negated_conjecture,?[X2]:(finite(X2)&~(finite_subsets(X2)=powerset(X2))),inference(variable_rename,[status(thm)],[197])).
% fof(199, negated_conjecture,(finite(esk13_0)&~(finite_subsets(esk13_0)=powerset(esk13_0))),inference(skolemize,[status(esa)],[198])).
% cnf(200,negated_conjecture,(finite_subsets(esk13_0)!=powerset(esk13_0)),inference(split_conjunct,[status(thm)],[199])).
% cnf(201,negated_conjecture,(finite(esk13_0)),inference(split_conjunct,[status(thm)],[199])).
% cnf(276,plain,(element(esk5_2(X1,X2),X1)|subset(X1,X2)),inference(pm,[status(thm)],[167,111,theory(equality)])).
% cnf(547,plain,(finite(esk5_2(powerset(X1),X2))|subset(powerset(X1),X2)|~finite(X1)),inference(pm,[status(thm)],[54,276,theory(equality)])).
% cnf(548,plain,(subset(esk5_2(powerset(X1),X2),X1)|subset(powerset(X1),X2)),inference(pm,[status(thm)],[140,276,theory(equality)])).
% cnf(1660,negated_conjecture,(subset(powerset(esk13_0),X1)|finite(esk5_2(powerset(esk13_0),X1))),inference(pm,[status(thm)],[547,201,theory(equality)])).
% cnf(1716,plain,(in(esk5_2(powerset(X1),X2),X3)|subset(powerset(X1),X2)|finite_subsets(X1)!=X3|~preboolean(X3)|~finite(esk5_2(powerset(X1),X2))),inference(pm,[status(thm)],[99,548,theory(equality)])).
% cnf(12949,negated_conjecture,(in(esk5_2(powerset(esk13_0),X1),X2)|subset(powerset(esk13_0),X1)|finite_subsets(esk13_0)!=X2|~preboolean(X2)),inference(pm,[status(thm)],[1716,1660,theory(equality)])).
% cnf(13013,negated_conjecture,(in(esk5_2(powerset(esk13_0),X1),finite_subsets(esk13_0))|subset(powerset(esk13_0),X1)|~preboolean(finite_subsets(esk13_0))),inference(er,[status(thm)],[12949,theory(equality)])).
% cnf(13014,negated_conjecture,(in(esk5_2(powerset(esk13_0),X1),finite_subsets(esk13_0))|subset(powerset(esk13_0),X1)|$false),inference(rw,[status(thm)],[13013,90,theory(equality)])).
% cnf(13015,negated_conjecture,(in(esk5_2(powerset(esk13_0),X1),finite_subsets(esk13_0))|subset(powerset(esk13_0),X1)),inference(cn,[status(thm)],[13014,theory(equality)])).
% cnf(13023,negated_conjecture,(subset(powerset(esk13_0),finite_subsets(esk13_0))),inference(pm,[status(thm)],[110,13015,theory(equality)])).
% cnf(13028,negated_conjecture,(finite_subsets(esk13_0)=powerset(esk13_0)|~subset(finite_subsets(esk13_0),powerset(esk13_0))),inference(pm,[status(thm)],[86,13023,theory(equality)])).
% cnf(13034,negated_conjecture,(finite_subsets(esk13_0)=powerset(esk13_0)|$false),inference(rw,[status(thm)],[13028,59,theory(equality)])).
% cnf(13035,negated_conjecture,(finite_subsets(esk13_0)=powerset(esk13_0)),inference(cn,[status(thm)],[13034,theory(equality)])).
% cnf(13036,negated_conjecture,($false),inference(sr,[status(thm)],[13035,200,theory(equality)])).
% cnf(13037,negated_conjecture,($false),13036,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2198
% # ...of these trivial : 31
% # ...subsumed : 913
% # ...remaining for further processing: 1254
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 10
% # Backward-rewritten : 65
% # Generated clauses : 9932
% # ...of the previous two non-trivial : 9037
% # Contextual simplify-reflections : 0
% # Paramodulations : 9765
% # Factorizations : 2
% # Equation resolutions : 153
% # Current number of processed clauses: 1177
% # Positive orientable unit clauses: 144
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 55
% # Non-unit-clauses : 978
% # Current number of unprocessed clauses: 6415
% # ...number of literals in the above : 20364
% # Clause-clause subsumption calls (NU) : 9088
% # Rec. Clause-clause subsumption calls : 7287
% # Unit Clause-clause subsumption calls : 776
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 752
% # Indexed BW rewrite successes : 16
% # Backwards rewriting index: 648 leaves, 2.62+/-5.105 terms/leaf
% # Paramod-from index: 245 leaves, 2.15+/-5.093 terms/leaf
% # Paramod-into index: 538 leaves, 2.28+/-4.433 terms/leaf
% # -------------------------------------------------
% # User time : 0.415 s
% # System time : 0.017 s
% # Total time : 0.432 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.68 CPU 0.77 WC
% FINAL PrfWatch: 0.68 CPU 0.77 WC
% SZS output end Solution for /tmp/SystemOnTPTP15535/SEU114+1.tptp
%
%------------------------------------------------------------------------------