TSTP Solution File: SET807+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET807+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 : art06.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:20 EST 2010
% Result : Theorem 93.35s
% Output : Solution 93.74s
% 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/SystemOnTPTP32122/SET807+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~thIV18a:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... rel_subset: CSA axiom rel_subset found
% Looking for CSA axiom ... pre_order:
% CSA axiom pre_order found
% Looking for CSA axiom ... power_set:
% CSA axiom power_set found
% ---- Iteration 2 (3 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 ... equivalence:
% CSA axiom equivalence found
% Looking for CSA axiom ... equivalence_class:
% CSA axiom equivalence_class found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :equivalence_class:equivalence:subset:power_set:pre_order:rel_subset (6)
% Unselected axioms are ... :equal_set:partition:singleton:unordered_pair:intersection:union:empty_set:difference:sum:product:disjoint (11)
% SZS status THM for /tmp/SystemOnTPTP32122/SET807+4.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP32122/SET807+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 1073
% 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]:![X7]:(subset(X3,X7)<=>![X4]:(member(X4,X3)=>member(X4,X7))),file('/tmp/SRASS.s.p', subset)).
% fof(4, axiom,![X4]:![X3]:(member(X4,power_set(X3))<=>subset(X4,X3)),file('/tmp/SRASS.s.p', power_set)).
% fof(5, axiom,![X1]:![X2]:(pre_order(X1,X2)<=>(![X4]:(member(X4,X2)=>apply(X1,X4,X4))&![X4]:![X5]:![X6]:(((member(X4,X2)&member(X5,X2))&member(X6,X2))=>((apply(X1,X4,X5)&apply(X1,X5,X6))=>apply(X1,X4,X6))))),file('/tmp/SRASS.s.p', pre_order)).
% fof(6, axiom,![X4]:![X5]:(apply(subset_predicate,X4,X5)<=>subset(X4,X5)),file('/tmp/SRASS.s.p', rel_subset)).
% fof(7, conjecture,![X2]:pre_order(subset_predicate,power_set(X2)),file('/tmp/SRASS.s.p', thIV18a)).
% fof(8, negated_conjecture,~(![X2]:pre_order(subset_predicate,power_set(X2))),inference(assume_negation,[status(cth)],[7])).
% fof(21, plain,![X3]:![X7]:((~(subset(X3,X7))|![X4]:(~(member(X4,X3))|member(X4,X7)))&(?[X4]:(member(X4,X3)&~(member(X4,X7)))|subset(X3,X7))),inference(fof_nnf,[status(thm)],[3])).
% fof(22, plain,![X8]:![X9]:((~(subset(X8,X9))|![X10]:(~(member(X10,X8))|member(X10,X9)))&(?[X11]:(member(X11,X8)&~(member(X11,X9)))|subset(X8,X9))),inference(variable_rename,[status(thm)],[21])).
% fof(23, plain,![X8]:![X9]:((~(subset(X8,X9))|![X10]:(~(member(X10,X8))|member(X10,X9)))&((member(esk1_2(X8,X9),X8)&~(member(esk1_2(X8,X9),X9)))|subset(X8,X9))),inference(skolemize,[status(esa)],[22])).
% fof(24, plain,![X8]:![X9]:![X10]:(((~(member(X10,X8))|member(X10,X9))|~(subset(X8,X9)))&((member(esk1_2(X8,X9),X8)&~(member(esk1_2(X8,X9),X9)))|subset(X8,X9))),inference(shift_quantors,[status(thm)],[23])).
% fof(25, plain,![X8]:![X9]:![X10]:(((~(member(X10,X8))|member(X10,X9))|~(subset(X8,X9)))&((member(esk1_2(X8,X9),X8)|subset(X8,X9))&(~(member(esk1_2(X8,X9),X9))|subset(X8,X9)))),inference(distribute,[status(thm)],[24])).
% cnf(26,plain,(subset(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[25])).
% cnf(27,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[25])).
% cnf(28,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[25])).
% fof(29, plain,![X4]:![X3]:((~(member(X4,power_set(X3)))|subset(X4,X3))&(~(subset(X4,X3))|member(X4,power_set(X3)))),inference(fof_nnf,[status(thm)],[4])).
% fof(30, plain,![X5]:![X6]:((~(member(X5,power_set(X6)))|subset(X5,X6))&(~(subset(X5,X6))|member(X5,power_set(X6)))),inference(variable_rename,[status(thm)],[29])).
% cnf(31,plain,(member(X1,power_set(X2))|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[30])).
% cnf(32,plain,(subset(X1,X2)|~member(X1,power_set(X2))),inference(split_conjunct,[status(thm)],[30])).
% fof(33, plain,![X1]:![X2]:((~(pre_order(X1,X2))|(![X4]:(~(member(X4,X2))|apply(X1,X4,X4))&![X4]:![X5]:![X6]:(((~(member(X4,X2))|~(member(X5,X2)))|~(member(X6,X2)))|((~(apply(X1,X4,X5))|~(apply(X1,X5,X6)))|apply(X1,X4,X6)))))&((?[X4]:(member(X4,X2)&~(apply(X1,X4,X4)))|?[X4]:?[X5]:?[X6]:(((member(X4,X2)&member(X5,X2))&member(X6,X2))&((apply(X1,X4,X5)&apply(X1,X5,X6))&~(apply(X1,X4,X6)))))|pre_order(X1,X2))),inference(fof_nnf,[status(thm)],[5])).
% fof(34, plain,![X7]:![X8]:((~(pre_order(X7,X8))|(![X9]:(~(member(X9,X8))|apply(X7,X9,X9))&![X10]:![X11]:![X12]:(((~(member(X10,X8))|~(member(X11,X8)))|~(member(X12,X8)))|((~(apply(X7,X10,X11))|~(apply(X7,X11,X12)))|apply(X7,X10,X12)))))&((?[X13]:(member(X13,X8)&~(apply(X7,X13,X13)))|?[X14]:?[X15]:?[X16]:(((member(X14,X8)&member(X15,X8))&member(X16,X8))&((apply(X7,X14,X15)&apply(X7,X15,X16))&~(apply(X7,X14,X16)))))|pre_order(X7,X8))),inference(variable_rename,[status(thm)],[33])).
% fof(35, plain,![X7]:![X8]:((~(pre_order(X7,X8))|(![X9]:(~(member(X9,X8))|apply(X7,X9,X9))&![X10]:![X11]:![X12]:(((~(member(X10,X8))|~(member(X11,X8)))|~(member(X12,X8)))|((~(apply(X7,X10,X11))|~(apply(X7,X11,X12)))|apply(X7,X10,X12)))))&(((member(esk2_2(X7,X8),X8)&~(apply(X7,esk2_2(X7,X8),esk2_2(X7,X8))))|(((member(esk3_2(X7,X8),X8)&member(esk4_2(X7,X8),X8))&member(esk5_2(X7,X8),X8))&((apply(X7,esk3_2(X7,X8),esk4_2(X7,X8))&apply(X7,esk4_2(X7,X8),esk5_2(X7,X8)))&~(apply(X7,esk3_2(X7,X8),esk5_2(X7,X8))))))|pre_order(X7,X8))),inference(skolemize,[status(esa)],[34])).
% fof(36, plain,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:((((((~(member(X10,X8))|~(member(X11,X8)))|~(member(X12,X8)))|((~(apply(X7,X10,X11))|~(apply(X7,X11,X12)))|apply(X7,X10,X12)))&(~(member(X9,X8))|apply(X7,X9,X9)))|~(pre_order(X7,X8)))&(((member(esk2_2(X7,X8),X8)&~(apply(X7,esk2_2(X7,X8),esk2_2(X7,X8))))|(((member(esk3_2(X7,X8),X8)&member(esk4_2(X7,X8),X8))&member(esk5_2(X7,X8),X8))&((apply(X7,esk3_2(X7,X8),esk4_2(X7,X8))&apply(X7,esk4_2(X7,X8),esk5_2(X7,X8)))&~(apply(X7,esk3_2(X7,X8),esk5_2(X7,X8))))))|pre_order(X7,X8))),inference(shift_quantors,[status(thm)],[35])).
% fof(37, plain,![X7]:![X8]:![X9]:![X10]:![X11]:![X12]:((((((~(member(X10,X8))|~(member(X11,X8)))|~(member(X12,X8)))|((~(apply(X7,X10,X11))|~(apply(X7,X11,X12)))|apply(X7,X10,X12)))|~(pre_order(X7,X8)))&((~(member(X9,X8))|apply(X7,X9,X9))|~(pre_order(X7,X8))))&((((((member(esk3_2(X7,X8),X8)|member(esk2_2(X7,X8),X8))|pre_order(X7,X8))&((member(esk4_2(X7,X8),X8)|member(esk2_2(X7,X8),X8))|pre_order(X7,X8)))&((member(esk5_2(X7,X8),X8)|member(esk2_2(X7,X8),X8))|pre_order(X7,X8)))&((((apply(X7,esk3_2(X7,X8),esk4_2(X7,X8))|member(esk2_2(X7,X8),X8))|pre_order(X7,X8))&((apply(X7,esk4_2(X7,X8),esk5_2(X7,X8))|member(esk2_2(X7,X8),X8))|pre_order(X7,X8)))&((~(apply(X7,esk3_2(X7,X8),esk5_2(X7,X8)))|member(esk2_2(X7,X8),X8))|pre_order(X7,X8))))&(((((member(esk3_2(X7,X8),X8)|~(apply(X7,esk2_2(X7,X8),esk2_2(X7,X8))))|pre_order(X7,X8))&((member(esk4_2(X7,X8),X8)|~(apply(X7,esk2_2(X7,X8),esk2_2(X7,X8))))|pre_order(X7,X8)))&((member(esk5_2(X7,X8),X8)|~(apply(X7,esk2_2(X7,X8),esk2_2(X7,X8))))|pre_order(X7,X8)))&((((apply(X7,esk3_2(X7,X8),esk4_2(X7,X8))|~(apply(X7,esk2_2(X7,X8),esk2_2(X7,X8))))|pre_order(X7,X8))&((apply(X7,esk4_2(X7,X8),esk5_2(X7,X8))|~(apply(X7,esk2_2(X7,X8),esk2_2(X7,X8))))|pre_order(X7,X8)))&((~(apply(X7,esk3_2(X7,X8),esk5_2(X7,X8)))|~(apply(X7,esk2_2(X7,X8),esk2_2(X7,X8))))|pre_order(X7,X8)))))),inference(distribute,[status(thm)],[36])).
% cnf(38,plain,(pre_order(X1,X2)|~apply(X1,esk2_2(X1,X2),esk2_2(X1,X2))|~apply(X1,esk3_2(X1,X2),esk5_2(X1,X2))),inference(split_conjunct,[status(thm)],[37])).
% cnf(39,plain,(pre_order(X1,X2)|apply(X1,esk4_2(X1,X2),esk5_2(X1,X2))|~apply(X1,esk2_2(X1,X2),esk2_2(X1,X2))),inference(split_conjunct,[status(thm)],[37])).
% cnf(40,plain,(pre_order(X1,X2)|apply(X1,esk3_2(X1,X2),esk4_2(X1,X2))|~apply(X1,esk2_2(X1,X2),esk2_2(X1,X2))),inference(split_conjunct,[status(thm)],[37])).
% fof(52, plain,![X4]:![X5]:((~(apply(subset_predicate,X4,X5))|subset(X4,X5))&(~(subset(X4,X5))|apply(subset_predicate,X4,X5))),inference(fof_nnf,[status(thm)],[6])).
% fof(53, plain,![X6]:![X7]:((~(apply(subset_predicate,X6,X7))|subset(X6,X7))&(~(subset(X6,X7))|apply(subset_predicate,X6,X7))),inference(variable_rename,[status(thm)],[52])).
% cnf(54,plain,(apply(subset_predicate,X1,X2)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,plain,(subset(X1,X2)|~apply(subset_predicate,X1,X2)),inference(split_conjunct,[status(thm)],[53])).
% fof(56, negated_conjecture,?[X2]:~(pre_order(subset_predicate,power_set(X2))),inference(fof_nnf,[status(thm)],[8])).
% fof(57, negated_conjecture,?[X3]:~(pre_order(subset_predicate,power_set(X3))),inference(variable_rename,[status(thm)],[56])).
% fof(58, negated_conjecture,~(pre_order(subset_predicate,power_set(esk6_0))),inference(skolemize,[status(esa)],[57])).
% cnf(59,negated_conjecture,(~pre_order(subset_predicate,power_set(esk6_0))),inference(split_conjunct,[status(thm)],[58])).
% cnf(118,plain,(subset(esk1_2(power_set(X1),X2),X1)|subset(power_set(X1),X2)),inference(spm,[status(thm)],[32,27,theory(equality)])).
% cnf(120,plain,(subset(X1,power_set(X2))|~subset(esk1_2(X1,power_set(X2)),X2)),inference(spm,[status(thm)],[26,31,theory(equality)])).
% cnf(121,plain,(subset(X1,X1)),inference(spm,[status(thm)],[26,27,theory(equality)])).
% cnf(123,plain,(member(X1,X2)|~member(X1,X3)|~apply(subset_predicate,X3,X2)),inference(spm,[status(thm)],[28,55,theory(equality)])).
% cnf(233,plain,(apply(subset_predicate,X1,X1)),inference(spm,[status(thm)],[54,121,theory(equality)])).
% cnf(258,plain,(member(X1,X2)|subset(power_set(X2),X3)|~member(X1,esk1_2(power_set(X2),X3))),inference(spm,[status(thm)],[28,118,theory(equality)])).
% cnf(338,plain,(member(X1,esk5_2(subset_predicate,X2))|pre_order(subset_predicate,X2)|~member(X1,esk4_2(subset_predicate,X2))|~apply(subset_predicate,esk2_2(subset_predicate,X2),esk2_2(subset_predicate,X2))),inference(spm,[status(thm)],[123,39,theory(equality)])).
% cnf(340,plain,(member(X1,esk4_2(subset_predicate,X2))|pre_order(subset_predicate,X2)|~member(X1,esk3_2(subset_predicate,X2))|~apply(subset_predicate,esk2_2(subset_predicate,X2),esk2_2(subset_predicate,X2))),inference(spm,[status(thm)],[123,40,theory(equality)])).
% cnf(369,plain,(member(X1,esk5_2(subset_predicate,X2))|pre_order(subset_predicate,X2)|~member(X1,esk4_2(subset_predicate,X2))|$false),inference(rw,[status(thm)],[338,233,theory(equality)])).
% cnf(370,plain,(member(X1,esk5_2(subset_predicate,X2))|pre_order(subset_predicate,X2)|~member(X1,esk4_2(subset_predicate,X2))),inference(cn,[status(thm)],[369,theory(equality)])).
% cnf(371,plain,(member(X1,esk4_2(subset_predicate,X2))|pre_order(subset_predicate,X2)|~member(X1,esk3_2(subset_predicate,X2))|$false),inference(rw,[status(thm)],[340,233,theory(equality)])).
% cnf(372,plain,(member(X1,esk4_2(subset_predicate,X2))|pre_order(subset_predicate,X2)|~member(X1,esk3_2(subset_predicate,X2))),inference(cn,[status(thm)],[371,theory(equality)])).
% cnf(477,plain,(subset(X1,esk5_2(subset_predicate,X2))|pre_order(subset_predicate,X2)|~member(esk1_2(X1,esk5_2(subset_predicate,X2)),esk4_2(subset_predicate,X2))),inference(spm,[status(thm)],[26,370,theory(equality)])).
% cnf(479,plain,(subset(X1,esk4_2(subset_predicate,X2))|pre_order(subset_predicate,X2)|~member(esk1_2(X1,esk4_2(subset_predicate,X2)),esk3_2(subset_predicate,X2))),inference(spm,[status(thm)],[26,372,theory(equality)])).
% cnf(557,plain,(subset(power_set(X1),X2)|member(esk1_2(esk1_2(power_set(X1),X2),X3),X1)|subset(esk1_2(power_set(X1),X2),X3)),inference(spm,[status(thm)],[258,27,theory(equality)])).
% cnf(863,plain,(pre_order(subset_predicate,X1)|subset(esk3_2(subset_predicate,X1),esk4_2(subset_predicate,X1))),inference(spm,[status(thm)],[479,27,theory(equality)])).
% cnf(1023,plain,(pre_order(subset_predicate,X1)|subset(esk1_2(power_set(esk4_2(subset_predicate,X1)),X2),esk5_2(subset_predicate,X1))|subset(power_set(esk4_2(subset_predicate,X1)),X2)),inference(spm,[status(thm)],[477,557,theory(equality)])).
% cnf(1028,plain,(subset(power_set(esk4_2(subset_predicate,X1)),power_set(esk5_2(subset_predicate,X1)))|pre_order(subset_predicate,X1)),inference(spm,[status(thm)],[120,1023,theory(equality)])).
% cnf(1030,plain,(member(X1,power_set(esk5_2(subset_predicate,X2)))|pre_order(subset_predicate,X2)|~member(X1,power_set(esk4_2(subset_predicate,X2)))),inference(spm,[status(thm)],[28,1028,theory(equality)])).
% cnf(1036,plain,(subset(X1,esk5_2(subset_predicate,X2))|pre_order(subset_predicate,X2)|~member(X1,power_set(esk4_2(subset_predicate,X2)))),inference(spm,[status(thm)],[32,1030,theory(equality)])).
% cnf(1093,plain,(pre_order(subset_predicate,X1)|subset(X2,esk5_2(subset_predicate,X1))|~subset(X2,esk4_2(subset_predicate,X1))),inference(spm,[status(thm)],[1036,31,theory(equality)])).
% cnf(1095,plain,(apply(subset_predicate,X1,esk5_2(subset_predicate,X2))|pre_order(subset_predicate,X2)|~subset(X1,esk4_2(subset_predicate,X2))),inference(spm,[status(thm)],[54,1093,theory(equality)])).
% cnf(1133,plain,(pre_order(subset_predicate,X1)|apply(subset_predicate,esk3_2(subset_predicate,X1),esk5_2(subset_predicate,X1))),inference(spm,[status(thm)],[1095,863,theory(equality)])).
% cnf(1150,plain,(pre_order(subset_predicate,X1)|~apply(subset_predicate,esk2_2(subset_predicate,X1),esk2_2(subset_predicate,X1))),inference(spm,[status(thm)],[38,1133,theory(equality)])).
% cnf(1152,plain,(pre_order(subset_predicate,X1)|$false),inference(rw,[status(thm)],[1150,233,theory(equality)])).
% cnf(1153,plain,(pre_order(subset_predicate,X1)),inference(cn,[status(thm)],[1152,theory(equality)])).
% cnf(1248,negated_conjecture,($false),inference(rw,[status(thm)],[59,1153,theory(equality)])).
% cnf(1249,negated_conjecture,($false),inference(cn,[status(thm)],[1248,theory(equality)])).
% cnf(1250,negated_conjecture,($false),1249,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 365
% # ...of these trivial : 0
% # ...subsumed : 26
% # ...remaining for further processing: 339
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 106
% # Generated clauses : 1004
% # ...of the previous two non-trivial : 989
% # Contextual simplify-reflections : 2
% # Paramodulations : 1004
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 155
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 0
% # Non-unit-clauses : 150
% # Current number of unprocessed clauses: 244
% # ...number of literals in the above : 1397
% # Clause-clause subsumption calls (NU) : 762
% # Rec. Clause-clause subsumption calls : 473
% # Unit Clause-clause subsumption calls : 15
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 21
% # Indexed BW rewrite successes : 17
% # Backwards rewriting index: 146 leaves, 1.29+/-1.314 terms/leaf
% # Paramod-from index: 54 leaves, 1.02+/-0.135 terms/leaf
% # Paramod-into index: 100 leaves, 1.17+/-0.601 terms/leaf
% # -------------------------------------------------
% # User time : 0.084 s
% # System time : 0.004 s
% # Total time : 0.088 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.19 CPU 0.27 WC
% FINAL PrfWatch: 0.19 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP32122/SET807+4.tptp
%
%------------------------------------------------------------------------------