TSTP Solution File: SET799+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET799+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 : 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 : Thu Dec 30 00:09:05 EST 2010
% Result : Theorem 0.97s
% Output : Solution 0.97s
% 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/SystemOnTPTP24859/SET799+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24859/SET799+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24859/SET799+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 24955
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.022 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # 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(3, axiom,![X1]:![X3]:![X4]:![X5]:(least_upper_bound(X1,X3,X4,X5)<=>((member(X1,X3)&upper_bound(X1,X4,X3))&![X8]:((member(X8,X5)&upper_bound(X8,X4,X3))=>apply(X4,X1,X8)))),file('/tmp/SRASS.s.p', least_upper_bound)).
% fof(5, axiom,![X4]:![X5]:![X8]:(upper_bound(X8,X4,X5)<=>![X3]:(member(X3,X5)=>apply(X4,X3,X8))),file('/tmp/SRASS.s.p', upper_bound)).
% fof(22, conjecture,![X4]:![X5]:(order(X4,X5)=>![X9]:![X10]:(((subset(X9,X5)&subset(X10,X5))&subset(X9,X10))=>![X11]:![X12]:((least_upper_bound(X11,X9,X4,X5)&least_upper_bound(X12,X10,X4,X5))=>apply(X4,X11,X12)))),file('/tmp/SRASS.s.p', thIV11)).
% fof(23, negated_conjecture,~(![X4]:![X5]:(order(X4,X5)=>![X9]:![X10]:(((subset(X9,X5)&subset(X10,X5))&subset(X9,X10))=>![X11]:![X12]:((least_upper_bound(X11,X9,X4,X5)&least_upper_bound(X12,X10,X4,X5))=>apply(X4,X11,X12))))),inference(assume_negation,[status(cth)],[22])).
% fof(28, 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(29, 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)],[28])).
% fof(30, 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)],[29])).
% fof(31, 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)],[30])).
% fof(32, 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)],[31])).
% cnf(35,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(40, plain,![X1]:![X3]:![X4]:![X5]:((~(least_upper_bound(X1,X3,X4,X5))|((member(X1,X3)&upper_bound(X1,X4,X3))&![X8]:((~(member(X8,X5))|~(upper_bound(X8,X4,X3)))|apply(X4,X1,X8))))&(((~(member(X1,X3))|~(upper_bound(X1,X4,X3)))|?[X8]:((member(X8,X5)&upper_bound(X8,X4,X3))&~(apply(X4,X1,X8))))|least_upper_bound(X1,X3,X4,X5))),inference(fof_nnf,[status(thm)],[3])).
% fof(41, plain,![X9]:![X10]:![X11]:![X12]:((~(least_upper_bound(X9,X10,X11,X12))|((member(X9,X10)&upper_bound(X9,X11,X10))&![X13]:((~(member(X13,X12))|~(upper_bound(X13,X11,X10)))|apply(X11,X9,X13))))&(((~(member(X9,X10))|~(upper_bound(X9,X11,X10)))|?[X14]:((member(X14,X12)&upper_bound(X14,X11,X10))&~(apply(X11,X9,X14))))|least_upper_bound(X9,X10,X11,X12))),inference(variable_rename,[status(thm)],[40])).
% fof(42, plain,![X9]:![X10]:![X11]:![X12]:((~(least_upper_bound(X9,X10,X11,X12))|((member(X9,X10)&upper_bound(X9,X11,X10))&![X13]:((~(member(X13,X12))|~(upper_bound(X13,X11,X10)))|apply(X11,X9,X13))))&(((~(member(X9,X10))|~(upper_bound(X9,X11,X10)))|((member(esk2_4(X9,X10,X11,X12),X12)&upper_bound(esk2_4(X9,X10,X11,X12),X11,X10))&~(apply(X11,X9,esk2_4(X9,X10,X11,X12)))))|least_upper_bound(X9,X10,X11,X12))),inference(skolemize,[status(esa)],[41])).
% fof(43, plain,![X9]:![X10]:![X11]:![X12]:![X13]:(((((~(member(X13,X12))|~(upper_bound(X13,X11,X10)))|apply(X11,X9,X13))&(member(X9,X10)&upper_bound(X9,X11,X10)))|~(least_upper_bound(X9,X10,X11,X12)))&(((~(member(X9,X10))|~(upper_bound(X9,X11,X10)))|((member(esk2_4(X9,X10,X11,X12),X12)&upper_bound(esk2_4(X9,X10,X11,X12),X11,X10))&~(apply(X11,X9,esk2_4(X9,X10,X11,X12)))))|least_upper_bound(X9,X10,X11,X12))),inference(shift_quantors,[status(thm)],[42])).
% fof(44, plain,![X9]:![X10]:![X11]:![X12]:![X13]:(((((~(member(X13,X12))|~(upper_bound(X13,X11,X10)))|apply(X11,X9,X13))|~(least_upper_bound(X9,X10,X11,X12)))&((member(X9,X10)|~(least_upper_bound(X9,X10,X11,X12)))&(upper_bound(X9,X11,X10)|~(least_upper_bound(X9,X10,X11,X12)))))&((((member(esk2_4(X9,X10,X11,X12),X12)|(~(member(X9,X10))|~(upper_bound(X9,X11,X10))))|least_upper_bound(X9,X10,X11,X12))&((upper_bound(esk2_4(X9,X10,X11,X12),X11,X10)|(~(member(X9,X10))|~(upper_bound(X9,X11,X10))))|least_upper_bound(X9,X10,X11,X12)))&((~(apply(X11,X9,esk2_4(X9,X10,X11,X12)))|(~(member(X9,X10))|~(upper_bound(X9,X11,X10))))|least_upper_bound(X9,X10,X11,X12)))),inference(distribute,[status(thm)],[43])).
% cnf(48,plain,(upper_bound(X1,X3,X2)|~least_upper_bound(X1,X2,X3,X4)),inference(split_conjunct,[status(thm)],[44])).
% cnf(49,plain,(member(X1,X2)|~least_upper_bound(X1,X2,X3,X4)),inference(split_conjunct,[status(thm)],[44])).
% fof(62, plain,![X4]:![X5]:![X8]:((~(upper_bound(X8,X4,X5))|![X3]:(~(member(X3,X5))|apply(X4,X3,X8)))&(?[X3]:(member(X3,X5)&~(apply(X4,X3,X8)))|upper_bound(X8,X4,X5))),inference(fof_nnf,[status(thm)],[5])).
% fof(63, plain,![X9]:![X10]:![X11]:((~(upper_bound(X11,X9,X10))|![X12]:(~(member(X12,X10))|apply(X9,X12,X11)))&(?[X13]:(member(X13,X10)&~(apply(X9,X13,X11)))|upper_bound(X11,X9,X10))),inference(variable_rename,[status(thm)],[62])).
% fof(64, plain,![X9]:![X10]:![X11]:((~(upper_bound(X11,X9,X10))|![X12]:(~(member(X12,X10))|apply(X9,X12,X11)))&((member(esk5_3(X9,X10,X11),X10)&~(apply(X9,esk5_3(X9,X10,X11),X11)))|upper_bound(X11,X9,X10))),inference(skolemize,[status(esa)],[63])).
% fof(65, plain,![X9]:![X10]:![X11]:![X12]:(((~(member(X12,X10))|apply(X9,X12,X11))|~(upper_bound(X11,X9,X10)))&((member(esk5_3(X9,X10,X11),X10)&~(apply(X9,esk5_3(X9,X10,X11),X11)))|upper_bound(X11,X9,X10))),inference(shift_quantors,[status(thm)],[64])).
% fof(66, plain,![X9]:![X10]:![X11]:![X12]:(((~(member(X12,X10))|apply(X9,X12,X11))|~(upper_bound(X11,X9,X10)))&((member(esk5_3(X9,X10,X11),X10)|upper_bound(X11,X9,X10))&(~(apply(X9,esk5_3(X9,X10,X11),X11))|upper_bound(X11,X9,X10)))),inference(distribute,[status(thm)],[65])).
% cnf(69,plain,(apply(X2,X4,X1)|~upper_bound(X1,X2,X3)|~member(X4,X3)),inference(split_conjunct,[status(thm)],[66])).
% fof(183, negated_conjecture,?[X4]:?[X5]:(order(X4,X5)&?[X9]:?[X10]:(((subset(X9,X5)&subset(X10,X5))&subset(X9,X10))&?[X11]:?[X12]:((least_upper_bound(X11,X9,X4,X5)&least_upper_bound(X12,X10,X4,X5))&~(apply(X4,X11,X12))))),inference(fof_nnf,[status(thm)],[23])).
% fof(184, negated_conjecture,?[X13]:?[X14]:(order(X13,X14)&?[X15]:?[X16]:(((subset(X15,X14)&subset(X16,X14))&subset(X15,X16))&?[X17]:?[X18]:((least_upper_bound(X17,X15,X13,X14)&least_upper_bound(X18,X16,X13,X14))&~(apply(X13,X17,X18))))),inference(variable_rename,[status(thm)],[183])).
% fof(185, negated_conjecture,(order(esk14_0,esk15_0)&(((subset(esk16_0,esk15_0)&subset(esk17_0,esk15_0))&subset(esk16_0,esk17_0))&((least_upper_bound(esk18_0,esk16_0,esk14_0,esk15_0)&least_upper_bound(esk19_0,esk17_0,esk14_0,esk15_0))&~(apply(esk14_0,esk18_0,esk19_0))))),inference(skolemize,[status(esa)],[184])).
% cnf(186,negated_conjecture,(~apply(esk14_0,esk18_0,esk19_0)),inference(split_conjunct,[status(thm)],[185])).
% cnf(187,negated_conjecture,(least_upper_bound(esk19_0,esk17_0,esk14_0,esk15_0)),inference(split_conjunct,[status(thm)],[185])).
% cnf(188,negated_conjecture,(least_upper_bound(esk18_0,esk16_0,esk14_0,esk15_0)),inference(split_conjunct,[status(thm)],[185])).
% cnf(189,negated_conjecture,(subset(esk16_0,esk17_0)),inference(split_conjunct,[status(thm)],[185])).
% cnf(268,negated_conjecture,(member(esk18_0,esk16_0)),inference(spm,[status(thm)],[49,188,theory(equality)])).
% cnf(277,negated_conjecture,(member(X1,esk17_0)|~member(X1,esk16_0)),inference(spm,[status(thm)],[35,189,theory(equality)])).
% cnf(280,negated_conjecture,(upper_bound(esk19_0,esk14_0,esk17_0)),inference(spm,[status(thm)],[48,187,theory(equality)])).
% cnf(625,negated_conjecture,(apply(esk14_0,X1,esk19_0)|~member(X1,esk17_0)),inference(spm,[status(thm)],[69,280,theory(equality)])).
% cnf(934,negated_conjecture,(member(esk18_0,esk17_0)),inference(spm,[status(thm)],[277,268,theory(equality)])).
% cnf(1006,negated_conjecture,(apply(esk14_0,esk18_0,esk19_0)),inference(spm,[status(thm)],[625,934,theory(equality)])).
% cnf(1007,negated_conjecture,($false),inference(sr,[status(thm)],[1006,186,theory(equality)])).
% cnf(1008,negated_conjecture,($false),1007,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 204
% # ...of these trivial : 6
% # ...subsumed : 3
% # ...remaining for further processing: 195
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 660
% # ...of the previous two non-trivial : 601
% # Contextual simplify-reflections : 0
% # Paramodulations : 657
% # Factorizations : 0
% # Equation resolutions : 3
% # Current number of processed clauses: 192
% # Positive orientable unit clauses: 48
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 142
% # Current number of unprocessed clauses: 540
% # ...number of literals in the above : 1655
% # Clause-clause subsumption calls (NU) : 873
% # Rec. Clause-clause subsumption calls : 182
% # Unit Clause-clause subsumption calls : 873
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 30
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 168 leaves, 1.37+/-1.203 terms/leaf
% # Paramod-from index: 61 leaves, 1.02+/-0.127 terms/leaf
% # Paramod-into index: 141 leaves, 1.26+/-0.659 terms/leaf
% # -------------------------------------------------
% # User time : 0.047 s
% # System time : 0.006 s
% # Total time : 0.053 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.15 CPU 0.24 WC
% FINAL PrfWatch: 0.15 CPU 0.24 WC
% SZS output end Solution for /tmp/SystemOnTPTP24859/SET799+4.tptp
%
%------------------------------------------------------------------------------