TSTP Solution File: SET798+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET798+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:08:53 EST 2010
% Result : Theorem 1.09s
% Output : Solution 1.09s
% 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/SystemOnTPTP29991/SET798+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29991/SET798+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29991/SET798+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 30087
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.023 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(2, 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(22, conjecture,![X4]:![X5]:(order(X4,X5)=>![X3]:![X7]:(((subset(X3,X5)&subset(X7,X5))&subset(X3,X7))=>![X6]:(lower_bound(X6,X4,X7)=>lower_bound(X6,X4,X3)))),file('/tmp/SRASS.s.p', thIV10)).
% fof(23, negated_conjecture,~(![X4]:![X5]:(order(X4,X5)=>![X3]:![X7]:(((subset(X3,X5)&subset(X7,X5))&subset(X3,X7))=>![X6]:(lower_bound(X6,X4,X7)=>lower_bound(X6,X4,X3))))),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(36, 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)],[2])).
% fof(37, 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)],[36])).
% fof(38, plain,![X7]:![X8]:![X9]:((~(lower_bound(X9,X7,X8))|![X10]:(~(member(X10,X8))|apply(X7,X9,X10)))&((member(esk2_3(X7,X8,X9),X8)&~(apply(X7,X9,esk2_3(X7,X8,X9))))|lower_bound(X9,X7,X8))),inference(skolemize,[status(esa)],[37])).
% fof(39, plain,![X7]:![X8]:![X9]:![X10]:(((~(member(X10,X8))|apply(X7,X9,X10))|~(lower_bound(X9,X7,X8)))&((member(esk2_3(X7,X8,X9),X8)&~(apply(X7,X9,esk2_3(X7,X8,X9))))|lower_bound(X9,X7,X8))),inference(shift_quantors,[status(thm)],[38])).
% fof(40, plain,![X7]:![X8]:![X9]:![X10]:(((~(member(X10,X8))|apply(X7,X9,X10))|~(lower_bound(X9,X7,X8)))&((member(esk2_3(X7,X8,X9),X8)|lower_bound(X9,X7,X8))&(~(apply(X7,X9,esk2_3(X7,X8,X9)))|lower_bound(X9,X7,X8)))),inference(distribute,[status(thm)],[39])).
% cnf(41,plain,(lower_bound(X1,X2,X3)|~apply(X2,X1,esk2_3(X2,X3,X1))),inference(split_conjunct,[status(thm)],[40])).
% cnf(42,plain,(lower_bound(X1,X2,X3)|member(esk2_3(X2,X3,X1),X3)),inference(split_conjunct,[status(thm)],[40])).
% cnf(43,plain,(apply(X2,X1,X4)|~lower_bound(X1,X2,X3)|~member(X4,X3)),inference(split_conjunct,[status(thm)],[40])).
% fof(183, negated_conjecture,?[X4]:?[X5]:(order(X4,X5)&?[X3]:?[X7]:(((subset(X3,X5)&subset(X7,X5))&subset(X3,X7))&?[X6]:(lower_bound(X6,X4,X7)&~(lower_bound(X6,X4,X3))))),inference(fof_nnf,[status(thm)],[23])).
% fof(184, negated_conjecture,?[X8]:?[X9]:(order(X8,X9)&?[X10]:?[X11]:(((subset(X10,X9)&subset(X11,X9))&subset(X10,X11))&?[X12]:(lower_bound(X12,X8,X11)&~(lower_bound(X12,X8,X10))))),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))&(lower_bound(esk18_0,esk14_0,esk17_0)&~(lower_bound(esk18_0,esk14_0,esk16_0))))),inference(skolemize,[status(esa)],[184])).
% cnf(186,negated_conjecture,(~lower_bound(esk18_0,esk14_0,esk16_0)),inference(split_conjunct,[status(thm)],[185])).
% cnf(187,negated_conjecture,(lower_bound(esk18_0,esk14_0,esk17_0)),inference(split_conjunct,[status(thm)],[185])).
% cnf(188,negated_conjecture,(subset(esk16_0,esk17_0)),inference(split_conjunct,[status(thm)],[185])).
% cnf(283,negated_conjecture,(member(X1,esk17_0)|~member(X1,esk16_0)),inference(spm,[status(thm)],[35,188,theory(equality)])).
% cnf(307,negated_conjecture,(apply(esk14_0,esk18_0,X1)|~member(X1,esk17_0)),inference(spm,[status(thm)],[43,187,theory(equality)])).
% cnf(823,negated_conjecture,(lower_bound(esk18_0,esk14_0,X1)|~member(esk2_3(esk14_0,X1,esk18_0),esk17_0)),inference(spm,[status(thm)],[41,307,theory(equality)])).
% cnf(2783,negated_conjecture,(lower_bound(esk18_0,esk14_0,X1)|~member(esk2_3(esk14_0,X1,esk18_0),esk16_0)),inference(spm,[status(thm)],[823,283,theory(equality)])).
% cnf(2871,negated_conjecture,(lower_bound(esk18_0,esk14_0,esk16_0)),inference(spm,[status(thm)],[2783,42,theory(equality)])).
% cnf(2872,negated_conjecture,($false),inference(sr,[status(thm)],[2871,186,theory(equality)])).
% cnf(2873,negated_conjecture,($false),2872,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 734
% # ...of these trivial : 85
% # ...subsumed : 16
% # ...remaining for further processing: 633
% # Other redundant clauses eliminated : 9
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 2235
% # ...of the previous two non-trivial : 2177
% # Contextual simplify-reflections : 0
% # Paramodulations : 2220
% # Factorizations : 6
% # Equation resolutions : 9
% # Current number of processed clauses: 487
% # Positive orientable unit clauses: 264
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 18
% # Non-unit-clauses : 205
% # Current number of unprocessed clauses: 1655
% # ...number of literals in the above : 4250
% # Clause-clause subsumption calls (NU) : 2163
% # Rec. Clause-clause subsumption calls : 676
% # Unit Clause-clause subsumption calls : 2820
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2607
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 351 leaves, 2.33+/-3.827 terms/leaf
% # Paramod-from index: 136 leaves, 2.57+/-4.868 terms/leaf
% # Paramod-into index: 310 leaves, 2.34+/-3.504 terms/leaf
% # -------------------------------------------------
% # User time : 0.145 s
% # System time : 0.008 s
% # Total time : 0.153 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.27 CPU 0.36 WC
% FINAL PrfWatch: 0.27 CPU 0.36 WC
% SZS output end Solution for /tmp/SystemOnTPTP29991/SET798+4.tptp
%
%------------------------------------------------------------------------------