TSTP Solution File: SET814+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET814+4 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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 00:11:28 EST 2010
% Result : Theorem 99.42s
% Output : Solution 99.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/SystemOnTPTP27179/SET814+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~thV14:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... subset:
% CSA axiom subset found
% Looking for CSA axiom ... sum:
% CSA axiom sum found
% Looking for CSA axiom ... thI3:
% CSA axiom thI3 found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... set_member:
% CSA axiom set_member found
% Looking for CSA axiom ... power_set:
% CSA axiom power_set found
% Looking for CSA axiom ... equal_set:
% CSA axiom equal_set found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... ordinal_number:
% CSA axiom ordinal_number found
% Looking for CSA axiom ... rel_member:
% CSA axiom rel_member found
% Looking for CSA axiom ... strict_well_order:
% CSA axiom strict_well_order found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :strict_well_order:rel_member:ordinal_number:equal_set:power_set:set_member:thI3:sum:subset (9)
% Unselected axioms are ... :union:strict_order:initial_segment:singleton:least:unordered_pair:intersection:empty_set:difference:product:successor (11)
% SZS status THM for /tmp/SystemOnTPTP27179/SET814+4.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP27179/SET814+4.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=600 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 600s
% TreeLimitedRun: WC time limit is 1200s
% TreeLimitedRun: PID is 28891
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X3]:(member(X3,on)<=>((set(X3)&strict_well_order(member_predicate,X3))&![X4]:(member(X4,X3)=>subset(X4,X3)))),file('/tmp/SRASS.s.p', ordinal_number)).
% fof(8, axiom,![X4]:![X3]:(member(X4,sum(X3))<=>?[X5]:(member(X5,X3)&member(X4,X5))),file('/tmp/SRASS.s.p', sum)).
% fof(9, axiom,![X3]:![X6]:(subset(X3,X6)<=>![X4]:(member(X4,X3)=>member(X4,X6))),file('/tmp/SRASS.s.p', subset)).
% fof(10, conjecture,![X3]:(member(X3,on)=>subset(sum(X3),X3)),file('/tmp/SRASS.s.p', thV14)).
% fof(11, negated_conjecture,~(![X3]:(member(X3,on)=>subset(sum(X3),X3))),inference(assume_negation,[status(cth)],[10])).
% fof(26, plain,![X3]:((~(member(X3,on))|((set(X3)&strict_well_order(member_predicate,X3))&![X4]:(~(member(X4,X3))|subset(X4,X3))))&(((~(set(X3))|~(strict_well_order(member_predicate,X3)))|?[X4]:(member(X4,X3)&~(subset(X4,X3))))|member(X3,on))),inference(fof_nnf,[status(thm)],[3])).
% fof(27, plain,![X5]:((~(member(X5,on))|((set(X5)&strict_well_order(member_predicate,X5))&![X6]:(~(member(X6,X5))|subset(X6,X5))))&(((~(set(X5))|~(strict_well_order(member_predicate,X5)))|?[X7]:(member(X7,X5)&~(subset(X7,X5))))|member(X5,on))),inference(variable_rename,[status(thm)],[26])).
% fof(28, plain,![X5]:((~(member(X5,on))|((set(X5)&strict_well_order(member_predicate,X5))&![X6]:(~(member(X6,X5))|subset(X6,X5))))&(((~(set(X5))|~(strict_well_order(member_predicate,X5)))|(member(esk4_1(X5),X5)&~(subset(esk4_1(X5),X5))))|member(X5,on))),inference(skolemize,[status(esa)],[27])).
% fof(29, plain,![X5]:![X6]:((((~(member(X6,X5))|subset(X6,X5))&(set(X5)&strict_well_order(member_predicate,X5)))|~(member(X5,on)))&(((~(set(X5))|~(strict_well_order(member_predicate,X5)))|(member(esk4_1(X5),X5)&~(subset(esk4_1(X5),X5))))|member(X5,on))),inference(shift_quantors,[status(thm)],[28])).
% fof(30, plain,![X5]:![X6]:((((~(member(X6,X5))|subset(X6,X5))|~(member(X5,on)))&((set(X5)|~(member(X5,on)))&(strict_well_order(member_predicate,X5)|~(member(X5,on)))))&(((member(esk4_1(X5),X5)|(~(set(X5))|~(strict_well_order(member_predicate,X5))))|member(X5,on))&((~(subset(esk4_1(X5),X5))|(~(set(X5))|~(strict_well_order(member_predicate,X5))))|member(X5,on)))),inference(distribute,[status(thm)],[29])).
% cnf(35,plain,(subset(X2,X1)|~member(X1,on)|~member(X2,X1)),inference(split_conjunct,[status(thm)],[30])).
% fof(53, plain,![X4]:![X3]:((~(member(X4,sum(X3)))|?[X5]:(member(X5,X3)&member(X4,X5)))&(![X5]:(~(member(X5,X3))|~(member(X4,X5)))|member(X4,sum(X3)))),inference(fof_nnf,[status(thm)],[8])).
% fof(54, plain,![X6]:![X7]:((~(member(X6,sum(X7)))|?[X8]:(member(X8,X7)&member(X6,X8)))&(![X9]:(~(member(X9,X7))|~(member(X6,X9)))|member(X6,sum(X7)))),inference(variable_rename,[status(thm)],[53])).
% fof(55, plain,![X6]:![X7]:((~(member(X6,sum(X7)))|(member(esk5_2(X6,X7),X7)&member(X6,esk5_2(X6,X7))))&(![X9]:(~(member(X9,X7))|~(member(X6,X9)))|member(X6,sum(X7)))),inference(skolemize,[status(esa)],[54])).
% fof(56, plain,![X6]:![X7]:![X9]:(((~(member(X9,X7))|~(member(X6,X9)))|member(X6,sum(X7)))&(~(member(X6,sum(X7)))|(member(esk5_2(X6,X7),X7)&member(X6,esk5_2(X6,X7))))),inference(shift_quantors,[status(thm)],[55])).
% fof(57, plain,![X6]:![X7]:![X9]:(((~(member(X9,X7))|~(member(X6,X9)))|member(X6,sum(X7)))&((member(esk5_2(X6,X7),X7)|~(member(X6,sum(X7))))&(member(X6,esk5_2(X6,X7))|~(member(X6,sum(X7)))))),inference(distribute,[status(thm)],[56])).
% cnf(58,plain,(member(X1,esk5_2(X1,X2))|~member(X1,sum(X2))),inference(split_conjunct,[status(thm)],[57])).
% cnf(59,plain,(member(esk5_2(X1,X2),X2)|~member(X1,sum(X2))),inference(split_conjunct,[status(thm)],[57])).
% fof(61, plain,![X3]:![X6]:((~(subset(X3,X6))|![X4]:(~(member(X4,X3))|member(X4,X6)))&(?[X4]:(member(X4,X3)&~(member(X4,X6)))|subset(X3,X6))),inference(fof_nnf,[status(thm)],[9])).
% fof(62, plain,![X7]:![X8]:((~(subset(X7,X8))|![X9]:(~(member(X9,X7))|member(X9,X8)))&(?[X10]:(member(X10,X7)&~(member(X10,X8)))|subset(X7,X8))),inference(variable_rename,[status(thm)],[61])).
% fof(63, plain,![X7]:![X8]:((~(subset(X7,X8))|![X9]:(~(member(X9,X7))|member(X9,X8)))&((member(esk6_2(X7,X8),X7)&~(member(esk6_2(X7,X8),X8)))|subset(X7,X8))),inference(skolemize,[status(esa)],[62])).
% fof(64, plain,![X7]:![X8]:![X9]:(((~(member(X9,X7))|member(X9,X8))|~(subset(X7,X8)))&((member(esk6_2(X7,X8),X7)&~(member(esk6_2(X7,X8),X8)))|subset(X7,X8))),inference(shift_quantors,[status(thm)],[63])).
% fof(65, plain,![X7]:![X8]:![X9]:(((~(member(X9,X7))|member(X9,X8))|~(subset(X7,X8)))&((member(esk6_2(X7,X8),X7)|subset(X7,X8))&(~(member(esk6_2(X7,X8),X8))|subset(X7,X8)))),inference(distribute,[status(thm)],[64])).
% cnf(66,plain,(subset(X1,X2)|~member(esk6_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[65])).
% cnf(67,plain,(subset(X1,X2)|member(esk6_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[65])).
% cnf(68,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[65])).
% fof(69, negated_conjecture,?[X3]:(member(X3,on)&~(subset(sum(X3),X3))),inference(fof_nnf,[status(thm)],[11])).
% fof(70, negated_conjecture,?[X4]:(member(X4,on)&~(subset(sum(X4),X4))),inference(variable_rename,[status(thm)],[69])).
% fof(71, negated_conjecture,(member(esk7_0,on)&~(subset(sum(esk7_0),esk7_0))),inference(skolemize,[status(esa)],[70])).
% cnf(72,negated_conjecture,(~subset(sum(esk7_0),esk7_0)),inference(split_conjunct,[status(thm)],[71])).
% cnf(73,negated_conjecture,(member(esk7_0,on)),inference(split_conjunct,[status(thm)],[71])).
% cnf(85,plain,(member(X1,X2)|~member(X1,X3)|~member(X2,on)|~member(X3,X2)),inference(spm,[status(thm)],[68,35,theory(equality)])).
% cnf(197,negated_conjecture,(member(X1,esk7_0)|~member(X1,X2)|~member(X2,esk7_0)),inference(spm,[status(thm)],[85,73,theory(equality)])).
% cnf(204,negated_conjecture,(member(X1,esk7_0)|~member(X1,esk5_2(X2,esk7_0))|~member(X2,sum(esk7_0))),inference(spm,[status(thm)],[197,59,theory(equality)])).
% cnf(226,negated_conjecture,(member(X1,esk7_0)|~member(X1,sum(esk7_0))),inference(spm,[status(thm)],[204,58,theory(equality)])).
% cnf(227,negated_conjecture,(member(esk6_2(sum(esk7_0),X1),esk7_0)|subset(sum(esk7_0),X1)),inference(spm,[status(thm)],[226,67,theory(equality)])).
% cnf(237,negated_conjecture,(subset(sum(esk7_0),esk7_0)),inference(spm,[status(thm)],[66,227,theory(equality)])).
% cnf(241,negated_conjecture,($false),inference(sr,[status(thm)],[237,72,theory(equality)])).
% cnf(242,negated_conjecture,($false),241,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 104
% # ...of these trivial : 0
% # ...subsumed : 15
% # ...remaining for further processing: 89
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 142
% # ...of the previous two non-trivial : 125
% # Contextual simplify-reflections : 9
% # Paramodulations : 142
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 62
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 57
% # Current number of unprocessed clauses: 75
% # ...number of literals in the above : 274
% # Clause-clause subsumption calls (NU) : 148
% # Rec. Clause-clause subsumption calls : 143
% # Unit Clause-clause subsumption calls : 8
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 73 leaves, 1.23+/-0.731 terms/leaf
% # Paramod-from index: 23 leaves, 1.04+/-0.204 terms/leaf
% # Paramod-into index: 60 leaves, 1.15+/-0.441 terms/leaf
% # -------------------------------------------------
% # User time : 0.017 s
% # System time : 0.006 s
% # Total time : 0.023 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.18 WC
% FINAL PrfWatch: 0.14 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP27179/SET814+4.tptp
%
%------------------------------------------------------------------------------