TSTP Solution File: SET764+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET764+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:01:13 EST 2010
% Result : Theorem 1.16s
% Output : Solution 1.16s
% 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/SystemOnTPTP25871/SET764+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP25871/SET764+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25871/SET764+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 25967
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.025 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:~(member(X1,empty_set)),file('/tmp/SRASS.s.p', empty_set)).
% fof(2, axiom,![X2]:![X3]:![X1]:(member(X1,inverse_image2(X2,X3))<=>?[X4]:(member(X4,X3)&apply(X2,X1,X4))),file('/tmp/SRASS.s.p', inverse_image2)).
% fof(3, axiom,![X5]:![X3]:(equal_set(X5,X3)<=>(subset(X5,X3)&subset(X3,X5))),file('/tmp/SRASS.s.p', equal_set)).
% fof(4, axiom,![X5]:![X3]:(subset(X5,X3)<=>![X1]:(member(X1,X5)=>member(X1,X3))),file('/tmp/SRASS.s.p', subset)).
% fof(29, conjecture,![X2]:![X5]:![X3]:(maps(X2,X5,X3)=>equal_set(inverse_image2(X2,empty_set),empty_set)),file('/tmp/SRASS.s.p', thIIa14)).
% fof(30, negated_conjecture,~(![X2]:![X5]:![X3]:(maps(X2,X5,X3)=>equal_set(inverse_image2(X2,empty_set),empty_set))),inference(assume_negation,[status(cth)],[29])).
% fof(31, plain,![X1]:~(member(X1,empty_set)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(33, plain,![X2]:~(member(X2,empty_set)),inference(variable_rename,[status(thm)],[31])).
% cnf(34,plain,(~member(X1,empty_set)),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X2]:![X3]:![X1]:((~(member(X1,inverse_image2(X2,X3)))|?[X4]:(member(X4,X3)&apply(X2,X1,X4)))&(![X4]:(~(member(X4,X3))|~(apply(X2,X1,X4)))|member(X1,inverse_image2(X2,X3)))),inference(fof_nnf,[status(thm)],[2])).
% fof(36, plain,![X5]:![X6]:![X7]:((~(member(X7,inverse_image2(X5,X6)))|?[X8]:(member(X8,X6)&apply(X5,X7,X8)))&(![X9]:(~(member(X9,X6))|~(apply(X5,X7,X9)))|member(X7,inverse_image2(X5,X6)))),inference(variable_rename,[status(thm)],[35])).
% fof(37, plain,![X5]:![X6]:![X7]:((~(member(X7,inverse_image2(X5,X6)))|(member(esk1_3(X5,X6,X7),X6)&apply(X5,X7,esk1_3(X5,X6,X7))))&(![X9]:(~(member(X9,X6))|~(apply(X5,X7,X9)))|member(X7,inverse_image2(X5,X6)))),inference(skolemize,[status(esa)],[36])).
% fof(38, plain,![X5]:![X6]:![X7]:![X9]:(((~(member(X9,X6))|~(apply(X5,X7,X9)))|member(X7,inverse_image2(X5,X6)))&(~(member(X7,inverse_image2(X5,X6)))|(member(esk1_3(X5,X6,X7),X6)&apply(X5,X7,esk1_3(X5,X6,X7))))),inference(shift_quantors,[status(thm)],[37])).
% fof(39, plain,![X5]:![X6]:![X7]:![X9]:(((~(member(X9,X6))|~(apply(X5,X7,X9)))|member(X7,inverse_image2(X5,X6)))&((member(esk1_3(X5,X6,X7),X6)|~(member(X7,inverse_image2(X5,X6))))&(apply(X5,X7,esk1_3(X5,X6,X7))|~(member(X7,inverse_image2(X5,X6)))))),inference(distribute,[status(thm)],[38])).
% cnf(41,plain,(member(esk1_3(X2,X3,X1),X3)|~member(X1,inverse_image2(X2,X3))),inference(split_conjunct,[status(thm)],[39])).
% fof(43, plain,![X5]:![X3]:((~(equal_set(X5,X3))|(subset(X5,X3)&subset(X3,X5)))&((~(subset(X5,X3))|~(subset(X3,X5)))|equal_set(X5,X3))),inference(fof_nnf,[status(thm)],[3])).
% fof(44, plain,![X6]:![X7]:((~(equal_set(X6,X7))|(subset(X6,X7)&subset(X7,X6)))&((~(subset(X6,X7))|~(subset(X7,X6)))|equal_set(X6,X7))),inference(variable_rename,[status(thm)],[43])).
% fof(45, plain,![X6]:![X7]:(((subset(X6,X7)|~(equal_set(X6,X7)))&(subset(X7,X6)|~(equal_set(X6,X7))))&((~(subset(X6,X7))|~(subset(X7,X6)))|equal_set(X6,X7))),inference(distribute,[status(thm)],[44])).
% cnf(46,plain,(equal_set(X1,X2)|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[45])).
% fof(49, plain,![X5]:![X3]:((~(subset(X5,X3))|![X1]:(~(member(X1,X5))|member(X1,X3)))&(?[X1]:(member(X1,X5)&~(member(X1,X3)))|subset(X5,X3))),inference(fof_nnf,[status(thm)],[4])).
% fof(50, plain,![X6]:![X7]:((~(subset(X6,X7))|![X8]:(~(member(X8,X6))|member(X8,X7)))&(?[X9]:(member(X9,X6)&~(member(X9,X7)))|subset(X6,X7))),inference(variable_rename,[status(thm)],[49])).
% fof(51, plain,![X6]:![X7]:((~(subset(X6,X7))|![X8]:(~(member(X8,X6))|member(X8,X7)))&((member(esk2_2(X6,X7),X6)&~(member(esk2_2(X6,X7),X7)))|subset(X6,X7))),inference(skolemize,[status(esa)],[50])).
% fof(52, plain,![X6]:![X7]:![X8]:(((~(member(X8,X6))|member(X8,X7))|~(subset(X6,X7)))&((member(esk2_2(X6,X7),X6)&~(member(esk2_2(X6,X7),X7)))|subset(X6,X7))),inference(shift_quantors,[status(thm)],[51])).
% fof(53, plain,![X6]:![X7]:![X8]:(((~(member(X8,X6))|member(X8,X7))|~(subset(X6,X7)))&((member(esk2_2(X6,X7),X6)|subset(X6,X7))&(~(member(esk2_2(X6,X7),X7))|subset(X6,X7)))),inference(distribute,[status(thm)],[52])).
% cnf(55,plain,(subset(X1,X2)|member(esk2_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[53])).
% fof(283, negated_conjecture,?[X2]:?[X5]:?[X3]:(maps(X2,X5,X3)&~(equal_set(inverse_image2(X2,empty_set),empty_set))),inference(fof_nnf,[status(thm)],[30])).
% fof(284, negated_conjecture,?[X6]:?[X7]:?[X8]:(maps(X6,X7,X8)&~(equal_set(inverse_image2(X6,empty_set),empty_set))),inference(variable_rename,[status(thm)],[283])).
% fof(285, negated_conjecture,(maps(esk41_0,esk42_0,esk43_0)&~(equal_set(inverse_image2(esk41_0,empty_set),empty_set))),inference(skolemize,[status(esa)],[284])).
% cnf(286,negated_conjecture,(~equal_set(inverse_image2(esk41_0,empty_set),empty_set)),inference(split_conjunct,[status(thm)],[285])).
% cnf(294,plain,(subset(empty_set,X1)),inference(spm,[status(thm)],[34,55,theory(equality)])).
% cnf(339,plain,(member(esk1_3(X1,X2,esk2_2(inverse_image2(X1,X2),X3)),X2)|subset(inverse_image2(X1,X2),X3)),inference(spm,[status(thm)],[41,55,theory(equality)])).
% cnf(1235,plain,(equal_set(X1,empty_set)|~subset(X1,empty_set)),inference(spm,[status(thm)],[46,294,theory(equality)])).
% cnf(4018,plain,(subset(inverse_image2(X1,empty_set),X2)),inference(spm,[status(thm)],[34,339,theory(equality)])).
% cnf(4027,plain,(equal_set(inverse_image2(X1,empty_set),empty_set)),inference(spm,[status(thm)],[1235,4018,theory(equality)])).
% cnf(4033,negated_conjecture,($false),inference(rw,[status(thm)],[286,4027,theory(equality)])).
% cnf(4034,negated_conjecture,($false),inference(cn,[status(thm)],[4033,theory(equality)])).
% cnf(4035,negated_conjecture,($false),4034,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 623
% # ...of these trivial : 26
% # ...subsumed : 6
% # ...remaining for further processing: 591
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 3444
% # ...of the previous two non-trivial : 3167
% # Contextual simplify-reflections : 0
% # Paramodulations : 3429
% # Factorizations : 6
% # Equation resolutions : 9
% # Current number of processed clauses: 449
% # Positive orientable unit clauses: 266
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 182
% # Current number of unprocessed clauses: 2690
% # ...number of literals in the above : 5854
% # Clause-clause subsumption calls (NU) : 2040
% # Rec. Clause-clause subsumption calls : 774
% # Unit Clause-clause subsumption calls : 4066
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 306
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 482 leaves, 1.73+/-2.297 terms/leaf
% # Paramod-from index: 235 leaves, 1.50+/-0.933 terms/leaf
% # Paramod-into index: 423 leaves, 1.60+/-1.031 terms/leaf
% # -------------------------------------------------
% # User time : 0.157 s
% # System time : 0.007 s
% # Total time : 0.164 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.33 CPU 0.42 WC
% FINAL PrfWatch: 0.33 CPU 0.42 WC
% SZS output end Solution for /tmp/SystemOnTPTP25871/SET764+4.tptp
%
%------------------------------------------------------------------------------