TSTP Solution File: SET763+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET763+4 : TPTP v5.0.0. Bugfixed v2.2.1.
% 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 00:00:59 EST 2010
% Result : Theorem 1.32s
% Output : Solution 1.32s
% 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/SystemOnTPTP25610/SET763+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP25610/SET763+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25610/SET763+4.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 25706
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.026 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(equal_set(X1,X2)<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', equal_set)).
% fof(2, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset)).
% fof(3, axiom,![X3]:~(member(X3,empty_set)),file('/tmp/SRASS.s.p', empty_set)).
% fof(4, axiom,![X4]:![X1]:![X5]:(member(X5,image2(X4,X1))<=>?[X3]:(member(X3,X1)&apply(X4,X3,X5))),file('/tmp/SRASS.s.p', image2)).
% fof(6, axiom,![X4]:![X1]:![X2]:(maps(X4,X1,X2)<=>(![X3]:(member(X3,X1)=>?[X5]:(member(X5,X2)&apply(X4,X3,X5)))&![X3]:![X6]:![X7]:(((member(X3,X1)&member(X6,X2))&member(X7,X2))=>((apply(X4,X3,X6)&apply(X4,X3,X7))=>X6=X7)))),file('/tmp/SRASS.s.p', maps)).
% fof(29, conjecture,![X4]:![X1]:![X2]:![X3]:(((maps(X4,X1,X2)&subset(X3,X1))&equal_set(image2(X4,X3),empty_set))=>equal_set(X3,empty_set)),file('/tmp/SRASS.s.p', thIIa13)).
% fof(30, negated_conjecture,~(![X4]:![X1]:![X2]:![X3]:(((maps(X4,X1,X2)&subset(X3,X1))&equal_set(image2(X4,X3),empty_set))=>equal_set(X3,empty_set))),inference(assume_negation,[status(cth)],[29])).
% fof(31, plain,![X3]:~(member(X3,empty_set)),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(33, plain,![X1]:![X2]:((~(equal_set(X1,X2))|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|equal_set(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(34, plain,![X3]:![X4]:((~(equal_set(X3,X4))|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|equal_set(X3,X4))),inference(variable_rename,[status(thm)],[33])).
% fof(35, plain,![X3]:![X4]:(((subset(X3,X4)|~(equal_set(X3,X4)))&(subset(X4,X3)|~(equal_set(X3,X4))))&((~(subset(X3,X4))|~(subset(X4,X3)))|equal_set(X3,X4))),inference(distribute,[status(thm)],[34])).
% cnf(36,plain,(equal_set(X1,X2)|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[35])).
% cnf(38,plain,(subset(X1,X2)|~equal_set(X1,X2)),inference(split_conjunct,[status(thm)],[35])).
% fof(39, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(member(X3,X1))|member(X3,X2)))&(?[X3]:(member(X3,X1)&~(member(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(40, 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)],[39])).
% fof(41, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[40])).
% fof(42, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[41])).
% fof(43, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(member(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[42])).
% cnf(45,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[43])).
% cnf(46,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[43])).
% fof(47, plain,![X4]:~(member(X4,empty_set)),inference(variable_rename,[status(thm)],[31])).
% cnf(48,plain,(~member(X1,empty_set)),inference(split_conjunct,[status(thm)],[47])).
% fof(49, plain,![X4]:![X1]:![X5]:((~(member(X5,image2(X4,X1)))|?[X3]:(member(X3,X1)&apply(X4,X3,X5)))&(![X3]:(~(member(X3,X1))|~(apply(X4,X3,X5)))|member(X5,image2(X4,X1)))),inference(fof_nnf,[status(thm)],[4])).
% fof(50, plain,![X6]:![X7]:![X8]:((~(member(X8,image2(X6,X7)))|?[X9]:(member(X9,X7)&apply(X6,X9,X8)))&(![X10]:(~(member(X10,X7))|~(apply(X6,X10,X8)))|member(X8,image2(X6,X7)))),inference(variable_rename,[status(thm)],[49])).
% fof(51, plain,![X6]:![X7]:![X8]:((~(member(X8,image2(X6,X7)))|(member(esk2_3(X6,X7,X8),X7)&apply(X6,esk2_3(X6,X7,X8),X8)))&(![X10]:(~(member(X10,X7))|~(apply(X6,X10,X8)))|member(X8,image2(X6,X7)))),inference(skolemize,[status(esa)],[50])).
% fof(52, plain,![X6]:![X7]:![X8]:![X10]:(((~(member(X10,X7))|~(apply(X6,X10,X8)))|member(X8,image2(X6,X7)))&(~(member(X8,image2(X6,X7)))|(member(esk2_3(X6,X7,X8),X7)&apply(X6,esk2_3(X6,X7,X8),X8)))),inference(shift_quantors,[status(thm)],[51])).
% fof(53, plain,![X6]:![X7]:![X8]:![X10]:(((~(member(X10,X7))|~(apply(X6,X10,X8)))|member(X8,image2(X6,X7)))&((member(esk2_3(X6,X7,X8),X7)|~(member(X8,image2(X6,X7))))&(apply(X6,esk2_3(X6,X7,X8),X8)|~(member(X8,image2(X6,X7)))))),inference(distribute,[status(thm)],[52])).
% cnf(56,plain,(member(X1,image2(X2,X3))|~apply(X2,X4,X1)|~member(X4,X3)),inference(split_conjunct,[status(thm)],[53])).
% fof(61, plain,![X4]:![X1]:![X2]:((~(maps(X4,X1,X2))|(![X3]:(~(member(X3,X1))|?[X5]:(member(X5,X2)&apply(X4,X3,X5)))&![X3]:![X6]:![X7]:(((~(member(X3,X1))|~(member(X6,X2)))|~(member(X7,X2)))|((~(apply(X4,X3,X6))|~(apply(X4,X3,X7)))|X6=X7))))&((?[X3]:(member(X3,X1)&![X5]:(~(member(X5,X2))|~(apply(X4,X3,X5))))|?[X3]:?[X6]:?[X7]:(((member(X3,X1)&member(X6,X2))&member(X7,X2))&((apply(X4,X3,X6)&apply(X4,X3,X7))&~(X6=X7))))|maps(X4,X1,X2))),inference(fof_nnf,[status(thm)],[6])).
% fof(62, plain,![X8]:![X9]:![X10]:((~(maps(X8,X9,X10))|(![X11]:(~(member(X11,X9))|?[X12]:(member(X12,X10)&apply(X8,X11,X12)))&![X13]:![X14]:![X15]:(((~(member(X13,X9))|~(member(X14,X10)))|~(member(X15,X10)))|((~(apply(X8,X13,X14))|~(apply(X8,X13,X15)))|X14=X15))))&((?[X16]:(member(X16,X9)&![X17]:(~(member(X17,X10))|~(apply(X8,X16,X17))))|?[X18]:?[X19]:?[X20]:(((member(X18,X9)&member(X19,X10))&member(X20,X10))&((apply(X8,X18,X19)&apply(X8,X18,X20))&~(X19=X20))))|maps(X8,X9,X10))),inference(variable_rename,[status(thm)],[61])).
% fof(63, plain,![X8]:![X9]:![X10]:((~(maps(X8,X9,X10))|(![X11]:(~(member(X11,X9))|(member(esk3_4(X8,X9,X10,X11),X10)&apply(X8,X11,esk3_4(X8,X9,X10,X11))))&![X13]:![X14]:![X15]:(((~(member(X13,X9))|~(member(X14,X10)))|~(member(X15,X10)))|((~(apply(X8,X13,X14))|~(apply(X8,X13,X15)))|X14=X15))))&(((member(esk4_3(X8,X9,X10),X9)&![X17]:(~(member(X17,X10))|~(apply(X8,esk4_3(X8,X9,X10),X17))))|(((member(esk5_3(X8,X9,X10),X9)&member(esk6_3(X8,X9,X10),X10))&member(esk7_3(X8,X9,X10),X10))&((apply(X8,esk5_3(X8,X9,X10),esk6_3(X8,X9,X10))&apply(X8,esk5_3(X8,X9,X10),esk7_3(X8,X9,X10)))&~(esk6_3(X8,X9,X10)=esk7_3(X8,X9,X10)))))|maps(X8,X9,X10))),inference(skolemize,[status(esa)],[62])).
% fof(64, plain,![X8]:![X9]:![X10]:![X11]:![X13]:![X14]:![X15]:![X17]:(((((~(member(X17,X10))|~(apply(X8,esk4_3(X8,X9,X10),X17)))&member(esk4_3(X8,X9,X10),X9))|(((member(esk5_3(X8,X9,X10),X9)&member(esk6_3(X8,X9,X10),X10))&member(esk7_3(X8,X9,X10),X10))&((apply(X8,esk5_3(X8,X9,X10),esk6_3(X8,X9,X10))&apply(X8,esk5_3(X8,X9,X10),esk7_3(X8,X9,X10)))&~(esk6_3(X8,X9,X10)=esk7_3(X8,X9,X10)))))|maps(X8,X9,X10))&(((((~(member(X13,X9))|~(member(X14,X10)))|~(member(X15,X10)))|((~(apply(X8,X13,X14))|~(apply(X8,X13,X15)))|X14=X15))&(~(member(X11,X9))|(member(esk3_4(X8,X9,X10,X11),X10)&apply(X8,X11,esk3_4(X8,X9,X10,X11)))))|~(maps(X8,X9,X10)))),inference(shift_quantors,[status(thm)],[63])).
% fof(65, plain,![X8]:![X9]:![X10]:![X11]:![X13]:![X14]:![X15]:![X17]:(((((((member(esk5_3(X8,X9,X10),X9)|(~(member(X17,X10))|~(apply(X8,esk4_3(X8,X9,X10),X17))))|maps(X8,X9,X10))&((member(esk6_3(X8,X9,X10),X10)|(~(member(X17,X10))|~(apply(X8,esk4_3(X8,X9,X10),X17))))|maps(X8,X9,X10)))&((member(esk7_3(X8,X9,X10),X10)|(~(member(X17,X10))|~(apply(X8,esk4_3(X8,X9,X10),X17))))|maps(X8,X9,X10)))&((((apply(X8,esk5_3(X8,X9,X10),esk6_3(X8,X9,X10))|(~(member(X17,X10))|~(apply(X8,esk4_3(X8,X9,X10),X17))))|maps(X8,X9,X10))&((apply(X8,esk5_3(X8,X9,X10),esk7_3(X8,X9,X10))|(~(member(X17,X10))|~(apply(X8,esk4_3(X8,X9,X10),X17))))|maps(X8,X9,X10)))&((~(esk6_3(X8,X9,X10)=esk7_3(X8,X9,X10))|(~(member(X17,X10))|~(apply(X8,esk4_3(X8,X9,X10),X17))))|maps(X8,X9,X10))))&(((((member(esk5_3(X8,X9,X10),X9)|member(esk4_3(X8,X9,X10),X9))|maps(X8,X9,X10))&((member(esk6_3(X8,X9,X10),X10)|member(esk4_3(X8,X9,X10),X9))|maps(X8,X9,X10)))&((member(esk7_3(X8,X9,X10),X10)|member(esk4_3(X8,X9,X10),X9))|maps(X8,X9,X10)))&((((apply(X8,esk5_3(X8,X9,X10),esk6_3(X8,X9,X10))|member(esk4_3(X8,X9,X10),X9))|maps(X8,X9,X10))&((apply(X8,esk5_3(X8,X9,X10),esk7_3(X8,X9,X10))|member(esk4_3(X8,X9,X10),X9))|maps(X8,X9,X10)))&((~(esk6_3(X8,X9,X10)=esk7_3(X8,X9,X10))|member(esk4_3(X8,X9,X10),X9))|maps(X8,X9,X10)))))&(((((~(member(X13,X9))|~(member(X14,X10)))|~(member(X15,X10)))|((~(apply(X8,X13,X14))|~(apply(X8,X13,X15)))|X14=X15))|~(maps(X8,X9,X10)))&(((member(esk3_4(X8,X9,X10,X11),X10)|~(member(X11,X9)))|~(maps(X8,X9,X10)))&((apply(X8,X11,esk3_4(X8,X9,X10,X11))|~(member(X11,X9)))|~(maps(X8,X9,X10)))))),inference(distribute,[status(thm)],[64])).
% cnf(66,plain,(apply(X1,X4,esk3_4(X1,X2,X3,X4))|~maps(X1,X2,X3)|~member(X4,X2)),inference(split_conjunct,[status(thm)],[65])).
% fof(283, negated_conjecture,?[X4]:?[X1]:?[X2]:?[X3]:(((maps(X4,X1,X2)&subset(X3,X1))&equal_set(image2(X4,X3),empty_set))&~(equal_set(X3,empty_set))),inference(fof_nnf,[status(thm)],[30])).
% fof(284, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:(((maps(X5,X6,X7)&subset(X8,X6))&equal_set(image2(X5,X8),empty_set))&~(equal_set(X8,empty_set))),inference(variable_rename,[status(thm)],[283])).
% fof(285, negated_conjecture,(((maps(esk41_0,esk42_0,esk43_0)&subset(esk44_0,esk42_0))&equal_set(image2(esk41_0,esk44_0),empty_set))&~(equal_set(esk44_0,empty_set))),inference(skolemize,[status(esa)],[284])).
% cnf(286,negated_conjecture,(~equal_set(esk44_0,empty_set)),inference(split_conjunct,[status(thm)],[285])).
% cnf(287,negated_conjecture,(equal_set(image2(esk41_0,esk44_0),empty_set)),inference(split_conjunct,[status(thm)],[285])).
% cnf(288,negated_conjecture,(subset(esk44_0,esk42_0)),inference(split_conjunct,[status(thm)],[285])).
% cnf(289,negated_conjecture,(maps(esk41_0,esk42_0,esk43_0)),inference(split_conjunct,[status(thm)],[285])).
% cnf(291,negated_conjecture,(subset(image2(esk41_0,esk44_0),empty_set)),inference(spm,[status(thm)],[38,287,theory(equality)])).
% cnf(293,negated_conjecture,(~subset(empty_set,esk44_0)|~subset(esk44_0,empty_set)),inference(spm,[status(thm)],[286,36,theory(equality)])).
% cnf(298,negated_conjecture,(member(X1,esk42_0)|~member(X1,esk44_0)),inference(spm,[status(thm)],[46,288,theory(equality)])).
% cnf(305,plain,(subset(empty_set,X1)),inference(spm,[status(thm)],[48,45,theory(equality)])).
% cnf(360,plain,(member(esk3_4(X1,X2,X3,X4),image2(X1,X5))|~member(X4,X5)|~maps(X1,X2,X3)|~member(X4,X2)),inference(spm,[status(thm)],[56,66,theory(equality)])).
% cnf(1087,negated_conjecture,(member(X1,empty_set)|~member(X1,image2(esk41_0,esk44_0))),inference(spm,[status(thm)],[46,291,theory(equality)])).
% cnf(1088,negated_conjecture,(~member(X1,image2(esk41_0,esk44_0))),inference(sr,[status(thm)],[1087,48,theory(equality)])).
% cnf(1091,negated_conjecture,($false|~subset(esk44_0,empty_set)),inference(rw,[status(thm)],[293,305,theory(equality)])).
% cnf(1092,negated_conjecture,(~subset(esk44_0,empty_set)),inference(cn,[status(thm)],[1091,theory(equality)])).
% cnf(3555,negated_conjecture,(~maps(esk41_0,X1,X2)|~member(X3,esk44_0)|~member(X3,X1)),inference(spm,[status(thm)],[1088,360,theory(equality)])).
% cnf(7276,negated_conjecture,(~member(X1,esk44_0)|~member(X1,esk42_0)),inference(spm,[status(thm)],[3555,289,theory(equality)])).
% cnf(7366,negated_conjecture,(~member(X1,esk44_0)),inference(csr,[status(thm)],[7276,298])).
% cnf(7452,negated_conjecture,(subset(esk44_0,X1)),inference(spm,[status(thm)],[7366,45,theory(equality)])).
% cnf(7456,negated_conjecture,($false),inference(rw,[status(thm)],[1092,7452,theory(equality)])).
% cnf(7457,negated_conjecture,($false),inference(cn,[status(thm)],[7456,theory(equality)])).
% cnf(7458,negated_conjecture,($false),7457,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 758
% # ...of these trivial : 34
% # ...subsumed : 229
% # ...remaining for further processing: 495
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 7070
% # ...of the previous two non-trivial : 7028
% # Contextual simplify-reflections : 1
% # Paramodulations : 7049
% # Factorizations : 12
% # Equation resolutions : 9
% # Current number of processed clauses: 489
% # Positive orientable unit clauses: 212
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 37
% # Non-unit-clauses : 240
% # Current number of unprocessed clauses: 6407
% # ...number of literals in the above : 15954
% # Clause-clause subsumption calls (NU) : 2417
% # Rec. Clause-clause subsumption calls : 1441
% # Unit Clause-clause subsumption calls : 583
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 577
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 511 leaves, 1.92+/-2.938 terms/leaf
% # Paramod-from index: 214 leaves, 1.67+/-1.639 terms/leaf
% # Paramod-into index: 424 leaves, 1.79+/-1.887 terms/leaf
% # -------------------------------------------------
% # User time : 0.224 s
% # System time : 0.010 s
% # Total time : 0.234 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.49 CPU 0.58 WC
% FINAL PrfWatch: 0.49 CPU 0.58 WC
% SZS output end Solution for /tmp/SystemOnTPTP25610/SET763+4.tptp
%
%------------------------------------------------------------------------------