TSTP Solution File: SET811+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET811+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 : 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 00:10:47 EST 2010
% Result : Theorem 82.43s
% Output : Solution 82.95s
% 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/SystemOnTPTP30006/SET811+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~thV5:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... equal_set: CSA axiom equal_set found
% Looking for CSA axiom ... initial_segment:
% CSA axiom initial_segment found
% Looking for CSA axiom ... rel_member:
% CSA axiom rel_member 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 ... subset:
% CSA axiom subset found
% Looking for CSA axiom ... ordinal_number:
% CSA axiom ordinal_number found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :ordinal_number:subset:set_member:rel_member:initial_segment:equal_set (6)
% Unselected axioms are ... :strict_well_order:strict_order:power_set:union:singleton:unordered_pair:least:successor:intersection:empty_set:difference:sum:product (13)
% SZS status THM for /tmp/SystemOnTPTP30006/SET811+4.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP30006/SET811+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 31419
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:(member(X1,on)<=>((set(X1)&strict_well_order(member_predicate,X1))&![X2]:(member(X2,X1)=>subset(X2,X1)))),file('/tmp/SRASS.s.p', ordinal_number)).
% fof(2, axiom,![X1]:![X3]:(subset(X1,X3)<=>![X2]:(member(X2,X1)=>member(X2,X3))),file('/tmp/SRASS.s.p', subset)).
% fof(4, axiom,![X2]:![X4]:(apply(member_predicate,X2,X4)<=>member(X2,X4)),file('/tmp/SRASS.s.p', rel_member)).
% fof(5, axiom,![X2]:![X5]:![X1]:![X4]:(member(X4,initial_segment(X2,X5,X1))<=>(member(X4,X1)&apply(X5,X4,X2))),file('/tmp/SRASS.s.p', initial_segment)).
% fof(6, axiom,![X1]:![X3]:(equal_set(X1,X3)<=>(subset(X1,X3)&subset(X3,X1))),file('/tmp/SRASS.s.p', equal_set)).
% fof(7, conjecture,![X1]:(member(X1,on)=>![X2]:(member(X2,X1)=>equal_set(X2,initial_segment(X2,member_predicate,X1)))),file('/tmp/SRASS.s.p', thV5)).
% fof(8, negated_conjecture,~(![X1]:(member(X1,on)=>![X2]:(member(X2,X1)=>equal_set(X2,initial_segment(X2,member_predicate,X1))))),inference(assume_negation,[status(cth)],[7])).
% fof(9, plain,![X1]:((~(member(X1,on))|((set(X1)&strict_well_order(member_predicate,X1))&![X2]:(~(member(X2,X1))|subset(X2,X1))))&(((~(set(X1))|~(strict_well_order(member_predicate,X1)))|?[X2]:(member(X2,X1)&~(subset(X2,X1))))|member(X1,on))),inference(fof_nnf,[status(thm)],[1])).
% fof(10, 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)))|?[X5]:(member(X5,X3)&~(subset(X5,X3))))|member(X3,on))),inference(variable_rename,[status(thm)],[9])).
% fof(11, 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)))|(member(esk1_1(X3),X3)&~(subset(esk1_1(X3),X3))))|member(X3,on))),inference(skolemize,[status(esa)],[10])).
% fof(12, plain,![X3]:![X4]:((((~(member(X4,X3))|subset(X4,X3))&(set(X3)&strict_well_order(member_predicate,X3)))|~(member(X3,on)))&(((~(set(X3))|~(strict_well_order(member_predicate,X3)))|(member(esk1_1(X3),X3)&~(subset(esk1_1(X3),X3))))|member(X3,on))),inference(shift_quantors,[status(thm)],[11])).
% fof(13, plain,![X3]:![X4]:((((~(member(X4,X3))|subset(X4,X3))|~(member(X3,on)))&((set(X3)|~(member(X3,on)))&(strict_well_order(member_predicate,X3)|~(member(X3,on)))))&(((member(esk1_1(X3),X3)|(~(set(X3))|~(strict_well_order(member_predicate,X3))))|member(X3,on))&((~(subset(esk1_1(X3),X3))|(~(set(X3))|~(strict_well_order(member_predicate,X3))))|member(X3,on)))),inference(distribute,[status(thm)],[12])).
% cnf(18,plain,(subset(X2,X1)|~member(X1,on)|~member(X2,X1)),inference(split_conjunct,[status(thm)],[13])).
% fof(19, plain,![X1]:![X3]:((~(subset(X1,X3))|![X2]:(~(member(X2,X1))|member(X2,X3)))&(?[X2]:(member(X2,X1)&~(member(X2,X3)))|subset(X1,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(20, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&(?[X7]:(member(X7,X4)&~(member(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[19])).
% fof(21, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&((member(esk2_2(X4,X5),X4)&~(member(esk2_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[20])).
% fof(22, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk2_2(X4,X5),X4)&~(member(esk2_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[21])).
% fof(23, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk2_2(X4,X5),X4)|subset(X4,X5))&(~(member(esk2_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[22])).
% cnf(24,plain,(subset(X1,X2)|~member(esk2_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[23])).
% cnf(25,plain,(subset(X1,X2)|member(esk2_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[23])).
% cnf(26,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[23])).
% fof(31, plain,![X2]:![X4]:((~(apply(member_predicate,X2,X4))|member(X2,X4))&(~(member(X2,X4))|apply(member_predicate,X2,X4))),inference(fof_nnf,[status(thm)],[4])).
% fof(32, plain,![X5]:![X6]:((~(apply(member_predicate,X5,X6))|member(X5,X6))&(~(member(X5,X6))|apply(member_predicate,X5,X6))),inference(variable_rename,[status(thm)],[31])).
% cnf(33,plain,(apply(member_predicate,X1,X2)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[32])).
% cnf(34,plain,(member(X1,X2)|~apply(member_predicate,X1,X2)),inference(split_conjunct,[status(thm)],[32])).
% fof(35, plain,![X2]:![X5]:![X1]:![X4]:((~(member(X4,initial_segment(X2,X5,X1)))|(member(X4,X1)&apply(X5,X4,X2)))&((~(member(X4,X1))|~(apply(X5,X4,X2)))|member(X4,initial_segment(X2,X5,X1)))),inference(fof_nnf,[status(thm)],[5])).
% fof(36, plain,![X6]:![X7]:![X8]:![X9]:((~(member(X9,initial_segment(X6,X7,X8)))|(member(X9,X8)&apply(X7,X9,X6)))&((~(member(X9,X8))|~(apply(X7,X9,X6)))|member(X9,initial_segment(X6,X7,X8)))),inference(variable_rename,[status(thm)],[35])).
% fof(37, plain,![X6]:![X7]:![X8]:![X9]:(((member(X9,X8)|~(member(X9,initial_segment(X6,X7,X8))))&(apply(X7,X9,X6)|~(member(X9,initial_segment(X6,X7,X8)))))&((~(member(X9,X8))|~(apply(X7,X9,X6)))|member(X9,initial_segment(X6,X7,X8)))),inference(distribute,[status(thm)],[36])).
% cnf(38,plain,(member(X1,initial_segment(X2,X3,X4))|~apply(X3,X1,X2)|~member(X1,X4)),inference(split_conjunct,[status(thm)],[37])).
% cnf(39,plain,(apply(X3,X1,X2)|~member(X1,initial_segment(X2,X3,X4))),inference(split_conjunct,[status(thm)],[37])).
% fof(41, plain,![X1]:![X3]:((~(equal_set(X1,X3))|(subset(X1,X3)&subset(X3,X1)))&((~(subset(X1,X3))|~(subset(X3,X1)))|equal_set(X1,X3))),inference(fof_nnf,[status(thm)],[6])).
% fof(42, plain,![X4]:![X5]:((~(equal_set(X4,X5))|(subset(X4,X5)&subset(X5,X4)))&((~(subset(X4,X5))|~(subset(X5,X4)))|equal_set(X4,X5))),inference(variable_rename,[status(thm)],[41])).
% fof(43, plain,![X4]:![X5]:(((subset(X4,X5)|~(equal_set(X4,X5)))&(subset(X5,X4)|~(equal_set(X4,X5))))&((~(subset(X4,X5))|~(subset(X5,X4)))|equal_set(X4,X5))),inference(distribute,[status(thm)],[42])).
% cnf(44,plain,(equal_set(X1,X2)|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[43])).
% fof(47, negated_conjecture,?[X1]:(member(X1,on)&?[X2]:(member(X2,X1)&~(equal_set(X2,initial_segment(X2,member_predicate,X1))))),inference(fof_nnf,[status(thm)],[8])).
% fof(48, negated_conjecture,?[X3]:(member(X3,on)&?[X4]:(member(X4,X3)&~(equal_set(X4,initial_segment(X4,member_predicate,X3))))),inference(variable_rename,[status(thm)],[47])).
% fof(49, negated_conjecture,(member(esk3_0,on)&(member(esk4_0,esk3_0)&~(equal_set(esk4_0,initial_segment(esk4_0,member_predicate,esk3_0))))),inference(skolemize,[status(esa)],[48])).
% cnf(50,negated_conjecture,(~equal_set(esk4_0,initial_segment(esk4_0,member_predicate,esk3_0))),inference(split_conjunct,[status(thm)],[49])).
% cnf(51,negated_conjecture,(member(esk4_0,esk3_0)),inference(split_conjunct,[status(thm)],[49])).
% cnf(52,negated_conjecture,(member(esk3_0,on)),inference(split_conjunct,[status(thm)],[49])).
% cnf(54,negated_conjecture,(~subset(initial_segment(esk4_0,member_predicate,esk3_0),esk4_0)|~subset(esk4_0,initial_segment(esk4_0,member_predicate,esk3_0))),inference(spm,[status(thm)],[50,44,theory(equality)])).
% cnf(62,plain,(member(X1,X2)|~member(X1,X3)|~member(X2,on)|~member(X3,X2)),inference(spm,[status(thm)],[26,18,theory(equality)])).
% cnf(63,plain,(apply(X1,esk2_2(initial_segment(X2,X1,X3),X4),X2)|subset(initial_segment(X2,X1,X3),X4)),inference(spm,[status(thm)],[39,25,theory(equality)])).
% cnf(64,plain,(subset(X1,initial_segment(X2,X3,X4))|~apply(X3,esk2_2(X1,initial_segment(X2,X3,X4)),X2)|~member(esk2_2(X1,initial_segment(X2,X3,X4)),X4)),inference(spm,[status(thm)],[24,38,theory(equality)])).
% cnf(84,negated_conjecture,(member(X1,esk3_0)|~member(X1,X2)|~member(X2,esk3_0)),inference(spm,[status(thm)],[62,52,theory(equality)])).
% cnf(88,negated_conjecture,(member(X1,esk3_0)|~member(X1,esk4_0)),inference(spm,[status(thm)],[84,51,theory(equality)])).
% cnf(93,negated_conjecture,(subset(X1,esk3_0)|~member(esk2_2(X1,esk3_0),esk4_0)),inference(spm,[status(thm)],[24,88,theory(equality)])).
% cnf(113,plain,(member(esk2_2(initial_segment(X1,member_predicate,X2),X3),X1)|subset(initial_segment(X1,member_predicate,X2),X3)),inference(spm,[status(thm)],[34,63,theory(equality)])).
% cnf(126,negated_conjecture,(subset(initial_segment(esk4_0,member_predicate,X1),esk3_0)),inference(spm,[status(thm)],[93,113,theory(equality)])).
% cnf(127,plain,(subset(initial_segment(X1,member_predicate,X2),X1)),inference(spm,[status(thm)],[24,113,theory(equality)])).
% cnf(128,negated_conjecture,(member(X1,esk3_0)|~member(X1,initial_segment(esk4_0,member_predicate,X2))),inference(spm,[status(thm)],[26,126,theory(equality)])).
% cnf(130,negated_conjecture,($false|~subset(esk4_0,initial_segment(esk4_0,member_predicate,esk3_0))),inference(rw,[status(thm)],[54,127,theory(equality)])).
% cnf(131,negated_conjecture,(~subset(esk4_0,initial_segment(esk4_0,member_predicate,esk3_0))),inference(cn,[status(thm)],[130,theory(equality)])).
% cnf(134,negated_conjecture,(member(esk2_2(initial_segment(esk4_0,member_predicate,X1),X2),esk3_0)|subset(initial_segment(esk4_0,member_predicate,X1),X2)),inference(spm,[status(thm)],[128,25,theory(equality)])).
% cnf(143,plain,(subset(X1,initial_segment(X2,member_predicate,X3))|~member(esk2_2(X1,initial_segment(X2,member_predicate,X3)),X3)|~member(esk2_2(X1,initial_segment(X2,member_predicate,X3)),X2)),inference(spm,[status(thm)],[64,33,theory(equality)])).
% cnf(144,plain,(subset(initial_segment(X1,X2,X3),initial_segment(X1,X2,X4))|~member(esk2_2(initial_segment(X1,X2,X3),initial_segment(X1,X2,X4)),X4)),inference(spm,[status(thm)],[64,63,theory(equality)])).
% cnf(607,plain,(subset(X1,initial_segment(X2,member_predicate,X1))|~member(esk2_2(X1,initial_segment(X2,member_predicate,X1)),X2)),inference(spm,[status(thm)],[143,25,theory(equality)])).
% cnf(630,plain,(subset(X1,initial_segment(X1,member_predicate,X1))),inference(spm,[status(thm)],[607,25,theory(equality)])).
% cnf(631,plain,(member(X1,initial_segment(X2,member_predicate,X2))|~member(X1,X2)),inference(spm,[status(thm)],[26,630,theory(equality)])).
% cnf(664,negated_conjecture,(subset(initial_segment(esk4_0,member_predicate,X1),initial_segment(esk4_0,member_predicate,esk3_0))),inference(spm,[status(thm)],[144,134,theory(equality)])).
% cnf(678,negated_conjecture,(member(X1,initial_segment(esk4_0,member_predicate,esk3_0))|~member(X1,initial_segment(esk4_0,member_predicate,X2))),inference(spm,[status(thm)],[26,664,theory(equality)])).
% cnf(708,negated_conjecture,(member(X1,initial_segment(esk4_0,member_predicate,esk3_0))|~member(X1,esk4_0)),inference(spm,[status(thm)],[678,631,theory(equality)])).
% cnf(712,negated_conjecture,(subset(X1,initial_segment(esk4_0,member_predicate,esk3_0))|~member(esk2_2(X1,initial_segment(esk4_0,member_predicate,esk3_0)),esk4_0)),inference(spm,[status(thm)],[24,708,theory(equality)])).
% cnf(1490,negated_conjecture,(subset(esk4_0,initial_segment(esk4_0,member_predicate,esk3_0))),inference(spm,[status(thm)],[712,25,theory(equality)])).
% cnf(1492,negated_conjecture,($false),inference(sr,[status(thm)],[1490,131,theory(equality)])).
% cnf(1493,negated_conjecture,($false),1492,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 537
% # ...of these trivial : 0
% # ...subsumed : 257
% # ...remaining for further processing: 280
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 9
% # Backward-rewritten : 3
% # Generated clauses : 1386
% # ...of the previous two non-trivial : 1345
% # Contextual simplify-reflections : 28
% # Paramodulations : 1386
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 248
% # Positive orientable unit clauses: 53
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 193
% # Current number of unprocessed clauses: 804
% # ...number of literals in the above : 2798
% # Clause-clause subsumption calls (NU) : 3108
% # Rec. Clause-clause subsumption calls : 2130
% # Unit Clause-clause subsumption calls : 268
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 275
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 175 leaves, 3.09+/-4.419 terms/leaf
% # Paramod-from index: 59 leaves, 2.56+/-2.757 terms/leaf
% # Paramod-into index: 138 leaves, 2.88+/-4.256 terms/leaf
% # -------------------------------------------------
% # User time : 0.094 s
% # System time : 0.003 s
% # Total time : 0.097 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.28 WC
% FINAL PrfWatch: 0.20 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP30006/SET811+4.tptp
%
%------------------------------------------------------------------------------