TSTP Solution File: SET802+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET802+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 : art05.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:09:27 EST 2010
% Result : Theorem 3.62s
% Output : Solution 3.62s
% 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/SystemOnTPTP30250/SET802+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30250/SET802+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30250/SET802+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 30346
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.91 CPU 2.01 WC
% # Preprocessing time : 0.022 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X4]:![X5]:![X6]:(least(X6,X4,X5)<=>(member(X6,X5)&![X3]:(member(X3,X5)=>apply(X4,X6,X3)))),file('/tmp/SRASS.s.p', least)).
% fof(3, axiom,![X4]:![X5]:![X6]:(lower_bound(X6,X4,X5)<=>![X3]:(member(X3,X5)=>apply(X4,X6,X3))),file('/tmp/SRASS.s.p', lower_bound)).
% fof(7, axiom,![X1]:![X3]:![X4]:![X5]:(greatest_lower_bound(X1,X3,X4,X5)<=>((member(X1,X3)&lower_bound(X1,X4,X3))&![X6]:((member(X6,X5)&lower_bound(X6,X4,X3))=>apply(X4,X6,X1)))),file('/tmp/SRASS.s.p', greatest_lower_bound)).
% fof(22, conjecture,![X4]:![X5]:(order(X4,X5)=>![X3]:(subset(X3,X5)=>![X6]:(least(X6,X4,X3)<=>(member(X6,X3)&greatest_lower_bound(X6,X3,X4,X5))))),file('/tmp/SRASS.s.p', thIV14)).
% fof(23, negated_conjecture,~(![X4]:![X5]:(order(X4,X5)=>![X3]:(subset(X3,X5)=>![X6]:(least(X6,X4,X3)<=>(member(X6,X3)&greatest_lower_bound(X6,X3,X4,X5)))))),inference(assume_negation,[status(cth)],[22])).
% fof(36, plain,![X4]:![X5]:![X6]:((~(least(X6,X4,X5))|(member(X6,X5)&![X3]:(~(member(X3,X5))|apply(X4,X6,X3))))&((~(member(X6,X5))|?[X3]:(member(X3,X5)&~(apply(X4,X6,X3))))|least(X6,X4,X5))),inference(fof_nnf,[status(thm)],[2])).
% fof(37, plain,![X7]:![X8]:![X9]:((~(least(X9,X7,X8))|(member(X9,X8)&![X10]:(~(member(X10,X8))|apply(X7,X9,X10))))&((~(member(X9,X8))|?[X11]:(member(X11,X8)&~(apply(X7,X9,X11))))|least(X9,X7,X8))),inference(variable_rename,[status(thm)],[36])).
% fof(38, plain,![X7]:![X8]:![X9]:((~(least(X9,X7,X8))|(member(X9,X8)&![X10]:(~(member(X10,X8))|apply(X7,X9,X10))))&((~(member(X9,X8))|(member(esk2_3(X7,X8,X9),X8)&~(apply(X7,X9,esk2_3(X7,X8,X9)))))|least(X9,X7,X8))),inference(skolemize,[status(esa)],[37])).
% fof(39, plain,![X7]:![X8]:![X9]:![X10]:((((~(member(X10,X8))|apply(X7,X9,X10))&member(X9,X8))|~(least(X9,X7,X8)))&((~(member(X9,X8))|(member(esk2_3(X7,X8,X9),X8)&~(apply(X7,X9,esk2_3(X7,X8,X9)))))|least(X9,X7,X8))),inference(shift_quantors,[status(thm)],[38])).
% fof(40, plain,![X7]:![X8]:![X9]:![X10]:((((~(member(X10,X8))|apply(X7,X9,X10))|~(least(X9,X7,X8)))&(member(X9,X8)|~(least(X9,X7,X8))))&(((member(esk2_3(X7,X8,X9),X8)|~(member(X9,X8)))|least(X9,X7,X8))&((~(apply(X7,X9,esk2_3(X7,X8,X9)))|~(member(X9,X8)))|least(X9,X7,X8)))),inference(distribute,[status(thm)],[39])).
% cnf(41,plain,(least(X1,X2,X3)|~member(X1,X3)|~apply(X2,X1,esk2_3(X2,X3,X1))),inference(split_conjunct,[status(thm)],[40])).
% cnf(42,plain,(least(X1,X2,X3)|member(esk2_3(X2,X3,X1),X3)|~member(X1,X3)),inference(split_conjunct,[status(thm)],[40])).
% cnf(43,plain,(member(X1,X3)|~least(X1,X2,X3)),inference(split_conjunct,[status(thm)],[40])).
% cnf(44,plain,(apply(X2,X1,X4)|~least(X1,X2,X3)|~member(X4,X3)),inference(split_conjunct,[status(thm)],[40])).
% fof(45, plain,![X4]:![X5]:![X6]:((~(lower_bound(X6,X4,X5))|![X3]:(~(member(X3,X5))|apply(X4,X6,X3)))&(?[X3]:(member(X3,X5)&~(apply(X4,X6,X3)))|lower_bound(X6,X4,X5))),inference(fof_nnf,[status(thm)],[3])).
% fof(46, plain,![X7]:![X8]:![X9]:((~(lower_bound(X9,X7,X8))|![X10]:(~(member(X10,X8))|apply(X7,X9,X10)))&(?[X11]:(member(X11,X8)&~(apply(X7,X9,X11)))|lower_bound(X9,X7,X8))),inference(variable_rename,[status(thm)],[45])).
% fof(47, plain,![X7]:![X8]:![X9]:((~(lower_bound(X9,X7,X8))|![X10]:(~(member(X10,X8))|apply(X7,X9,X10)))&((member(esk3_3(X7,X8,X9),X8)&~(apply(X7,X9,esk3_3(X7,X8,X9))))|lower_bound(X9,X7,X8))),inference(skolemize,[status(esa)],[46])).
% fof(48, plain,![X7]:![X8]:![X9]:![X10]:(((~(member(X10,X8))|apply(X7,X9,X10))|~(lower_bound(X9,X7,X8)))&((member(esk3_3(X7,X8,X9),X8)&~(apply(X7,X9,esk3_3(X7,X8,X9))))|lower_bound(X9,X7,X8))),inference(shift_quantors,[status(thm)],[47])).
% fof(49, plain,![X7]:![X8]:![X9]:![X10]:(((~(member(X10,X8))|apply(X7,X9,X10))|~(lower_bound(X9,X7,X8)))&((member(esk3_3(X7,X8,X9),X8)|lower_bound(X9,X7,X8))&(~(apply(X7,X9,esk3_3(X7,X8,X9)))|lower_bound(X9,X7,X8)))),inference(distribute,[status(thm)],[48])).
% cnf(50,plain,(lower_bound(X1,X2,X3)|~apply(X2,X1,esk3_3(X2,X3,X1))),inference(split_conjunct,[status(thm)],[49])).
% cnf(51,plain,(lower_bound(X1,X2,X3)|member(esk3_3(X2,X3,X1),X3)),inference(split_conjunct,[status(thm)],[49])).
% cnf(52,plain,(apply(X2,X1,X4)|~lower_bound(X1,X2,X3)|~member(X4,X3)),inference(split_conjunct,[status(thm)],[49])).
% fof(67, plain,![X1]:![X3]:![X4]:![X5]:((~(greatest_lower_bound(X1,X3,X4,X5))|((member(X1,X3)&lower_bound(X1,X4,X3))&![X6]:((~(member(X6,X5))|~(lower_bound(X6,X4,X3)))|apply(X4,X6,X1))))&(((~(member(X1,X3))|~(lower_bound(X1,X4,X3)))|?[X6]:((member(X6,X5)&lower_bound(X6,X4,X3))&~(apply(X4,X6,X1))))|greatest_lower_bound(X1,X3,X4,X5))),inference(fof_nnf,[status(thm)],[7])).
% fof(68, plain,![X7]:![X8]:![X9]:![X10]:((~(greatest_lower_bound(X7,X8,X9,X10))|((member(X7,X8)&lower_bound(X7,X9,X8))&![X11]:((~(member(X11,X10))|~(lower_bound(X11,X9,X8)))|apply(X9,X11,X7))))&(((~(member(X7,X8))|~(lower_bound(X7,X9,X8)))|?[X12]:((member(X12,X10)&lower_bound(X12,X9,X8))&~(apply(X9,X12,X7))))|greatest_lower_bound(X7,X8,X9,X10))),inference(variable_rename,[status(thm)],[67])).
% fof(69, plain,![X7]:![X8]:![X9]:![X10]:((~(greatest_lower_bound(X7,X8,X9,X10))|((member(X7,X8)&lower_bound(X7,X9,X8))&![X11]:((~(member(X11,X10))|~(lower_bound(X11,X9,X8)))|apply(X9,X11,X7))))&(((~(member(X7,X8))|~(lower_bound(X7,X9,X8)))|((member(esk4_4(X7,X8,X9,X10),X10)&lower_bound(esk4_4(X7,X8,X9,X10),X9,X8))&~(apply(X9,esk4_4(X7,X8,X9,X10),X7))))|greatest_lower_bound(X7,X8,X9,X10))),inference(skolemize,[status(esa)],[68])).
% fof(70, plain,![X7]:![X8]:![X9]:![X10]:![X11]:(((((~(member(X11,X10))|~(lower_bound(X11,X9,X8)))|apply(X9,X11,X7))&(member(X7,X8)&lower_bound(X7,X9,X8)))|~(greatest_lower_bound(X7,X8,X9,X10)))&(((~(member(X7,X8))|~(lower_bound(X7,X9,X8)))|((member(esk4_4(X7,X8,X9,X10),X10)&lower_bound(esk4_4(X7,X8,X9,X10),X9,X8))&~(apply(X9,esk4_4(X7,X8,X9,X10),X7))))|greatest_lower_bound(X7,X8,X9,X10))),inference(shift_quantors,[status(thm)],[69])).
% fof(71, plain,![X7]:![X8]:![X9]:![X10]:![X11]:(((((~(member(X11,X10))|~(lower_bound(X11,X9,X8)))|apply(X9,X11,X7))|~(greatest_lower_bound(X7,X8,X9,X10)))&((member(X7,X8)|~(greatest_lower_bound(X7,X8,X9,X10)))&(lower_bound(X7,X9,X8)|~(greatest_lower_bound(X7,X8,X9,X10)))))&((((member(esk4_4(X7,X8,X9,X10),X10)|(~(member(X7,X8))|~(lower_bound(X7,X9,X8))))|greatest_lower_bound(X7,X8,X9,X10))&((lower_bound(esk4_4(X7,X8,X9,X10),X9,X8)|(~(member(X7,X8))|~(lower_bound(X7,X9,X8))))|greatest_lower_bound(X7,X8,X9,X10)))&((~(apply(X9,esk4_4(X7,X8,X9,X10),X7))|(~(member(X7,X8))|~(lower_bound(X7,X9,X8))))|greatest_lower_bound(X7,X8,X9,X10)))),inference(distribute,[status(thm)],[70])).
% cnf(72,plain,(greatest_lower_bound(X1,X2,X3,X4)|~lower_bound(X1,X3,X2)|~member(X1,X2)|~apply(X3,esk4_4(X1,X2,X3,X4),X1)),inference(split_conjunct,[status(thm)],[71])).
% cnf(73,plain,(greatest_lower_bound(X1,X2,X3,X4)|lower_bound(esk4_4(X1,X2,X3,X4),X3,X2)|~lower_bound(X1,X3,X2)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[71])).
% cnf(75,plain,(lower_bound(X1,X3,X2)|~greatest_lower_bound(X1,X2,X3,X4)),inference(split_conjunct,[status(thm)],[71])).
% cnf(76,plain,(member(X1,X2)|~greatest_lower_bound(X1,X2,X3,X4)),inference(split_conjunct,[status(thm)],[71])).
% fof(183, negated_conjecture,?[X4]:?[X5]:(order(X4,X5)&?[X3]:(subset(X3,X5)&?[X6]:((~(least(X6,X4,X3))|(~(member(X6,X3))|~(greatest_lower_bound(X6,X3,X4,X5))))&(least(X6,X4,X3)|(member(X6,X3)&greatest_lower_bound(X6,X3,X4,X5)))))),inference(fof_nnf,[status(thm)],[23])).
% fof(184, negated_conjecture,?[X7]:?[X8]:(order(X7,X8)&?[X9]:(subset(X9,X8)&?[X10]:((~(least(X10,X7,X9))|(~(member(X10,X9))|~(greatest_lower_bound(X10,X9,X7,X8))))&(least(X10,X7,X9)|(member(X10,X9)&greatest_lower_bound(X10,X9,X7,X8)))))),inference(variable_rename,[status(thm)],[183])).
% fof(185, negated_conjecture,(order(esk14_0,esk15_0)&(subset(esk16_0,esk15_0)&((~(least(esk17_0,esk14_0,esk16_0))|(~(member(esk17_0,esk16_0))|~(greatest_lower_bound(esk17_0,esk16_0,esk14_0,esk15_0))))&(least(esk17_0,esk14_0,esk16_0)|(member(esk17_0,esk16_0)&greatest_lower_bound(esk17_0,esk16_0,esk14_0,esk15_0)))))),inference(skolemize,[status(esa)],[184])).
% fof(186, negated_conjecture,(order(esk14_0,esk15_0)&(subset(esk16_0,esk15_0)&((~(least(esk17_0,esk14_0,esk16_0))|(~(member(esk17_0,esk16_0))|~(greatest_lower_bound(esk17_0,esk16_0,esk14_0,esk15_0))))&((member(esk17_0,esk16_0)|least(esk17_0,esk14_0,esk16_0))&(greatest_lower_bound(esk17_0,esk16_0,esk14_0,esk15_0)|least(esk17_0,esk14_0,esk16_0)))))),inference(distribute,[status(thm)],[185])).
% cnf(187,negated_conjecture,(least(esk17_0,esk14_0,esk16_0)|greatest_lower_bound(esk17_0,esk16_0,esk14_0,esk15_0)),inference(split_conjunct,[status(thm)],[186])).
% cnf(188,negated_conjecture,(least(esk17_0,esk14_0,esk16_0)|member(esk17_0,esk16_0)),inference(split_conjunct,[status(thm)],[186])).
% cnf(189,negated_conjecture,(~greatest_lower_bound(esk17_0,esk16_0,esk14_0,esk15_0)|~member(esk17_0,esk16_0)|~least(esk17_0,esk14_0,esk16_0)),inference(split_conjunct,[status(thm)],[186])).
% cnf(263,negated_conjecture,(~greatest_lower_bound(esk17_0,esk16_0,esk14_0,esk15_0)|~least(esk17_0,esk14_0,esk16_0)),inference(csr,[status(thm)],[189,76])).
% cnf(264,negated_conjecture,(member(esk17_0,esk16_0)),inference(spm,[status(thm)],[43,188,theory(equality)])).
% cnf(384,negated_conjecture,(apply(esk14_0,esk17_0,X1)|greatest_lower_bound(esk17_0,esk16_0,esk14_0,esk15_0)|~member(X1,esk16_0)),inference(spm,[status(thm)],[44,187,theory(equality)])).
% cnf(554,plain,(apply(X1,esk4_4(X2,X3,X1,X4),X5)|greatest_lower_bound(X2,X3,X1,X4)|~member(X5,X3)|~lower_bound(X2,X1,X3)|~member(X2,X3)),inference(spm,[status(thm)],[52,73,theory(equality)])).
% cnf(1958,negated_conjecture,(greatest_lower_bound(esk17_0,esk16_0,esk14_0,esk15_0)|apply(esk14_0,esk17_0,esk3_3(X1,esk16_0,X2))|lower_bound(X2,X1,esk16_0)),inference(spm,[status(thm)],[384,51,theory(equality)])).
% cnf(33109,plain,(greatest_lower_bound(X1,X2,X3,X4)|~lower_bound(X1,X3,X2)|~member(X1,X2)),inference(spm,[status(thm)],[72,554,theory(equality)])).
% cnf(43069,negated_conjecture,(lower_bound(esk17_0,esk14_0,esk16_0)|greatest_lower_bound(esk17_0,esk16_0,esk14_0,esk15_0)),inference(spm,[status(thm)],[50,1958,theory(equality)])).
% cnf(43072,negated_conjecture,(lower_bound(esk17_0,esk14_0,esk16_0)),inference(csr,[status(thm)],[43069,75])).
% cnf(43073,negated_conjecture,(apply(esk14_0,esk17_0,X1)|~member(X1,esk16_0)),inference(spm,[status(thm)],[52,43072,theory(equality)])).
% cnf(43075,negated_conjecture,(least(esk17_0,esk14_0,X1)|~member(esk17_0,X1)|~member(esk2_3(esk14_0,X1,esk17_0),esk16_0)),inference(spm,[status(thm)],[41,43073,theory(equality)])).
% cnf(43090,negated_conjecture,(least(esk17_0,esk14_0,esk16_0)|~member(esk17_0,esk16_0)),inference(spm,[status(thm)],[43075,42,theory(equality)])).
% cnf(43091,negated_conjecture,(least(esk17_0,esk14_0,esk16_0)|$false),inference(rw,[status(thm)],[43090,264,theory(equality)])).
% cnf(43092,negated_conjecture,(least(esk17_0,esk14_0,esk16_0)),inference(cn,[status(thm)],[43091,theory(equality)])).
% cnf(43095,negated_conjecture,(~greatest_lower_bound(esk17_0,esk16_0,esk14_0,esk15_0)|$false),inference(rw,[status(thm)],[263,43092,theory(equality)])).
% cnf(43096,negated_conjecture,(~greatest_lower_bound(esk17_0,esk16_0,esk14_0,esk15_0)),inference(cn,[status(thm)],[43095,theory(equality)])).
% cnf(43098,negated_conjecture,(~lower_bound(esk17_0,esk14_0,esk16_0)|~member(esk17_0,esk16_0)),inference(spm,[status(thm)],[43096,33109,theory(equality)])).
% cnf(43103,negated_conjecture,($false|~member(esk17_0,esk16_0)),inference(rw,[status(thm)],[43098,43072,theory(equality)])).
% cnf(43104,negated_conjecture,($false|$false),inference(rw,[status(thm)],[43103,264,theory(equality)])).
% cnf(43105,negated_conjecture,($false),inference(cn,[status(thm)],[43104,theory(equality)])).
% cnf(43106,negated_conjecture,($false),43105,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2762
% # ...of these trivial : 279
% # ...subsumed : 336
% # ...remaining for further processing: 2147
% # Other redundant clauses eliminated : 11
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 44
% # Backward-rewritten : 154
% # Generated clauses : 36039
% # ...of the previous two non-trivial : 35548
% # Contextual simplify-reflections : 70
% # Paramodulations : 36008
% # Factorizations : 16
% # Equation resolutions : 11
% # Current number of processed clauses: 1801
% # Positive orientable unit clauses: 1150
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 77
% # Non-unit-clauses : 574
% # Current number of unprocessed clauses: 27192
% # ...number of literals in the above : 92555
% # Clause-clause subsumption calls (NU) : 51482
% # Rec. Clause-clause subsumption calls : 20013
% # Unit Clause-clause subsumption calls : 23077
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 27134
% # Indexed BW rewrite successes : 25
% # Backwards rewriting index: 770 leaves, 4.11+/-9.195 terms/leaf
% # Paramod-from index: 264 leaves, 5.11+/-13.037 terms/leaf
% # Paramod-into index: 643 leaves, 4.46+/-9.674 terms/leaf
% # -------------------------------------------------
% # User time : 2.027 s
% # System time : 0.062 s
% # Total time : 2.089 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.81 CPU 2.91 WC
% FINAL PrfWatch: 2.81 CPU 2.91 WC
% SZS output end Solution for /tmp/SystemOnTPTP30250/SET802+4.tptp
%
%------------------------------------------------------------------------------