TSTP Solution File: SET755+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET755+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 : art09.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 : Wed Dec 29 23:58:58 EST 2010
% Result : Theorem 5.41s
% Output : Solution 5.41s
% 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/SystemOnTPTP20033/SET755+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20033/SET755+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20033/SET755+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 20129
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.91 CPU 2.01 WC
% # Preprocessing time : 0.024 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.89 CPU 4.01 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset)).
% fof(2, axiom,![X4]:![X2]:![X3]:(member(X3,inverse_image2(X4,X2))<=>?[X5]:(member(X5,X2)&apply(X4,X3,X5))),file('/tmp/SRASS.s.p', inverse_image2)).
% fof(29, conjecture,![X4]:![X1]:![X2]:![X3]:![X5]:((((maps(X4,X1,X2)&subset(X3,X2))&subset(X5,X2))&subset(X3,X5))=>subset(inverse_image2(X4,X3),inverse_image2(X4,X5))),file('/tmp/SRASS.s.p', thIIa05)).
% fof(30, negated_conjecture,~(![X4]:![X1]:![X2]:![X3]:![X5]:((((maps(X4,X1,X2)&subset(X3,X2))&subset(X5,X2))&subset(X3,X5))=>subset(inverse_image2(X4,X3),inverse_image2(X4,X5)))),inference(assume_negation,[status(cth)],[29])).
% fof(33, 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)],[1])).
% fof(34, 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)],[33])).
% fof(35, 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)],[34])).
% fof(36, 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)],[35])).
% fof(37, 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)],[36])).
% cnf(38,plain,(subset(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[37])).
% cnf(39,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[37])).
% cnf(40,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[37])).
% fof(41, plain,![X4]:![X2]:![X3]:((~(member(X3,inverse_image2(X4,X2)))|?[X5]:(member(X5,X2)&apply(X4,X3,X5)))&(![X5]:(~(member(X5,X2))|~(apply(X4,X3,X5)))|member(X3,inverse_image2(X4,X2)))),inference(fof_nnf,[status(thm)],[2])).
% fof(42, plain,![X6]:![X7]:![X8]:((~(member(X8,inverse_image2(X6,X7)))|?[X9]:(member(X9,X7)&apply(X6,X8,X9)))&(![X10]:(~(member(X10,X7))|~(apply(X6,X8,X10)))|member(X8,inverse_image2(X6,X7)))),inference(variable_rename,[status(thm)],[41])).
% fof(43, plain,![X6]:![X7]:![X8]:((~(member(X8,inverse_image2(X6,X7)))|(member(esk2_3(X6,X7,X8),X7)&apply(X6,X8,esk2_3(X6,X7,X8))))&(![X10]:(~(member(X10,X7))|~(apply(X6,X8,X10)))|member(X8,inverse_image2(X6,X7)))),inference(skolemize,[status(esa)],[42])).
% fof(44, plain,![X6]:![X7]:![X8]:![X10]:(((~(member(X10,X7))|~(apply(X6,X8,X10)))|member(X8,inverse_image2(X6,X7)))&(~(member(X8,inverse_image2(X6,X7)))|(member(esk2_3(X6,X7,X8),X7)&apply(X6,X8,esk2_3(X6,X7,X8))))),inference(shift_quantors,[status(thm)],[43])).
% fof(45, plain,![X6]:![X7]:![X8]:![X10]:(((~(member(X10,X7))|~(apply(X6,X8,X10)))|member(X8,inverse_image2(X6,X7)))&((member(esk2_3(X6,X7,X8),X7)|~(member(X8,inverse_image2(X6,X7))))&(apply(X6,X8,esk2_3(X6,X7,X8))|~(member(X8,inverse_image2(X6,X7)))))),inference(distribute,[status(thm)],[44])).
% cnf(46,plain,(apply(X2,X1,esk2_3(X2,X3,X1))|~member(X1,inverse_image2(X2,X3))),inference(split_conjunct,[status(thm)],[45])).
% cnf(47,plain,(member(esk2_3(X2,X3,X1),X3)|~member(X1,inverse_image2(X2,X3))),inference(split_conjunct,[status(thm)],[45])).
% cnf(48,plain,(member(X1,inverse_image2(X2,X3))|~apply(X2,X1,X4)|~member(X4,X3)),inference(split_conjunct,[status(thm)],[45])).
% fof(283, negated_conjecture,?[X4]:?[X1]:?[X2]:?[X3]:?[X5]:((((maps(X4,X1,X2)&subset(X3,X2))&subset(X5,X2))&subset(X3,X5))&~(subset(inverse_image2(X4,X3),inverse_image2(X4,X5)))),inference(fof_nnf,[status(thm)],[30])).
% fof(284, negated_conjecture,?[X6]:?[X7]:?[X8]:?[X9]:?[X10]:((((maps(X6,X7,X8)&subset(X9,X8))&subset(X10,X8))&subset(X9,X10))&~(subset(inverse_image2(X6,X9),inverse_image2(X6,X10)))),inference(variable_rename,[status(thm)],[283])).
% fof(285, negated_conjecture,((((maps(esk41_0,esk42_0,esk43_0)&subset(esk44_0,esk43_0))&subset(esk45_0,esk43_0))&subset(esk44_0,esk45_0))&~(subset(inverse_image2(esk41_0,esk44_0),inverse_image2(esk41_0,esk45_0)))),inference(skolemize,[status(esa)],[284])).
% cnf(286,negated_conjecture,(~subset(inverse_image2(esk41_0,esk44_0),inverse_image2(esk41_0,esk45_0))),inference(split_conjunct,[status(thm)],[285])).
% cnf(287,negated_conjecture,(subset(esk44_0,esk45_0)),inference(split_conjunct,[status(thm)],[285])).
% cnf(298,negated_conjecture,(member(X1,esk45_0)|~member(X1,esk44_0)),inference(spm,[status(thm)],[40,287,theory(equality)])).
% cnf(342,plain,(member(X1,inverse_image2(X2,X3))|~member(esk2_3(X2,X4,X1),X3)|~member(X1,inverse_image2(X2,X4))),inference(spm,[status(thm)],[48,46,theory(equality)])).
% cnf(2809,negated_conjecture,(member(X1,inverse_image2(X2,esk45_0))|~member(X1,inverse_image2(X2,X3))|~member(esk2_3(X2,X3,X1),esk44_0)),inference(spm,[status(thm)],[342,298,theory(equality)])).
% cnf(86805,negated_conjecture,(member(X1,inverse_image2(X2,esk45_0))|~member(X1,inverse_image2(X2,esk44_0))),inference(spm,[status(thm)],[2809,47,theory(equality)])).
% cnf(86948,negated_conjecture,(subset(X1,inverse_image2(X2,esk45_0))|~member(esk1_2(X1,inverse_image2(X2,esk45_0)),inverse_image2(X2,esk44_0))),inference(spm,[status(thm)],[38,86805,theory(equality)])).
% cnf(87009,negated_conjecture,(subset(inverse_image2(X1,esk44_0),inverse_image2(X1,esk45_0))),inference(spm,[status(thm)],[86948,39,theory(equality)])).
% cnf(87012,negated_conjecture,($false),inference(rw,[status(thm)],[286,87009,theory(equality)])).
% cnf(87013,negated_conjecture,($false),inference(cn,[status(thm)],[87012,theory(equality)])).
% cnf(87014,negated_conjecture,($false),87013,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 4550
% # ...of these trivial : 164
% # ...subsumed : 2685
% # ...remaining for further processing: 1701
% # Other redundant clauses eliminated : 51
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 84529
% # ...of the previous two non-trivial : 82659
% # Contextual simplify-reflections : 14
% # Paramodulations : 84378
% # Factorizations : 100
% # Equation resolutions : 51
% # Current number of processed clauses: 1697
% # Positive orientable unit clauses: 649
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 97
% # Non-unit-clauses : 951
% # Current number of unprocessed clauses: 78248
% # ...number of literals in the above : 231236
% # Clause-clause subsumption calls (NU) : 34843
% # Rec. Clause-clause subsumption calls : 9526
% # Unit Clause-clause subsumption calls : 18705
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7883
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 1417 leaves, 2.51+/-5.454 terms/leaf
% # Paramod-from index: 599 leaves, 2.09+/-3.822 terms/leaf
% # Paramod-into index: 1124 leaves, 2.35+/-4.012 terms/leaf
% # -------------------------------------------------
% # User time : 2.673 s
% # System time : 0.106 s
% # Total time : 2.779 s
% # Maximum resident set size: 0 pages
% PrfWatch: 4.58 CPU 4.70 WC
% FINAL PrfWatch: 4.58 CPU 4.70 WC
% SZS output end Solution for /tmp/SystemOnTPTP20033/SET755+4.tptp
%
%------------------------------------------------------------------------------