TSTP Solution File: LAT381+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LAT381+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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 13:17:17 EST 2010
% Result : Theorem 1.08s
% Output : Solution 1.08s
% 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/SystemOnTPTP26036/LAT381+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26036/LAT381+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26036/LAT381+1.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 26132
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,aSet0(xT),file('/tmp/SRASS.s.p', m__725)).
% fof(2, axiom,aSubsetOf0(xS,xT),file('/tmp/SRASS.s.p', m__725_01)).
% fof(3, axiom,(aSupremumOfIn0(xu,xS,xT)&aSupremumOfIn0(xv,xS,xT)),file('/tmp/SRASS.s.p', m__744)).
% fof(5, axiom,![X1]:(aSet0(X1)=>![X2]:(aSubsetOf0(X2,X1)=>![X3]:(aSupremumOfIn0(X3,X2,X1)<=>((aElementOf0(X3,X1)&aUpperBoundOfIn0(X3,X2,X1))&![X4]:(aUpperBoundOfIn0(X4,X2,X1)=>sdtlseqdt0(X3,X4)))))),file('/tmp/SRASS.s.p', mDefSup)).
% fof(7, axiom,![X1]:![X2]:((aElement0(X1)&aElement0(X2))=>((sdtlseqdt0(X1,X2)&sdtlseqdt0(X2,X1))=>X1=X2)),file('/tmp/SRASS.s.p', mASymm)).
% fof(12, axiom,![X1]:(aSet0(X1)=>![X2]:(aElementOf0(X2,X1)=>aElement0(X2))),file('/tmp/SRASS.s.p', mEOfElem)).
% fof(17, conjecture,xu=xv,file('/tmp/SRASS.s.p', m__)).
% fof(18, negated_conjecture,~(xu=xv),inference(assume_negation,[status(cth)],[17])).
% fof(22, negated_conjecture,~(xu=xv),inference(fof_simplification,[status(thm)],[18,theory(equality)])).
% cnf(23,plain,(aSet0(xT)),inference(split_conjunct,[status(thm)],[1])).
% cnf(24,plain,(aSubsetOf0(xS,xT)),inference(split_conjunct,[status(thm)],[2])).
% cnf(25,plain,(aSupremumOfIn0(xv,xS,xT)),inference(split_conjunct,[status(thm)],[3])).
% cnf(26,plain,(aSupremumOfIn0(xu,xS,xT)),inference(split_conjunct,[status(thm)],[3])).
% fof(36, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aSubsetOf0(X2,X1))|![X3]:((~(aSupremumOfIn0(X3,X2,X1))|((aElementOf0(X3,X1)&aUpperBoundOfIn0(X3,X2,X1))&![X4]:(~(aUpperBoundOfIn0(X4,X2,X1))|sdtlseqdt0(X3,X4))))&(((~(aElementOf0(X3,X1))|~(aUpperBoundOfIn0(X3,X2,X1)))|?[X4]:(aUpperBoundOfIn0(X4,X2,X1)&~(sdtlseqdt0(X3,X4))))|aSupremumOfIn0(X3,X2,X1))))),inference(fof_nnf,[status(thm)],[5])).
% fof(37, plain,![X5]:(~(aSet0(X5))|![X6]:(~(aSubsetOf0(X6,X5))|![X7]:((~(aSupremumOfIn0(X7,X6,X5))|((aElementOf0(X7,X5)&aUpperBoundOfIn0(X7,X6,X5))&![X8]:(~(aUpperBoundOfIn0(X8,X6,X5))|sdtlseqdt0(X7,X8))))&(((~(aElementOf0(X7,X5))|~(aUpperBoundOfIn0(X7,X6,X5)))|?[X9]:(aUpperBoundOfIn0(X9,X6,X5)&~(sdtlseqdt0(X7,X9))))|aSupremumOfIn0(X7,X6,X5))))),inference(variable_rename,[status(thm)],[36])).
% fof(38, plain,![X5]:(~(aSet0(X5))|![X6]:(~(aSubsetOf0(X6,X5))|![X7]:((~(aSupremumOfIn0(X7,X6,X5))|((aElementOf0(X7,X5)&aUpperBoundOfIn0(X7,X6,X5))&![X8]:(~(aUpperBoundOfIn0(X8,X6,X5))|sdtlseqdt0(X7,X8))))&(((~(aElementOf0(X7,X5))|~(aUpperBoundOfIn0(X7,X6,X5)))|(aUpperBoundOfIn0(esk2_3(X5,X6,X7),X6,X5)&~(sdtlseqdt0(X7,esk2_3(X5,X6,X7)))))|aSupremumOfIn0(X7,X6,X5))))),inference(skolemize,[status(esa)],[37])).
% fof(39, plain,![X5]:![X6]:![X7]:![X8]:((((((~(aUpperBoundOfIn0(X8,X6,X5))|sdtlseqdt0(X7,X8))&(aElementOf0(X7,X5)&aUpperBoundOfIn0(X7,X6,X5)))|~(aSupremumOfIn0(X7,X6,X5)))&(((~(aElementOf0(X7,X5))|~(aUpperBoundOfIn0(X7,X6,X5)))|(aUpperBoundOfIn0(esk2_3(X5,X6,X7),X6,X5)&~(sdtlseqdt0(X7,esk2_3(X5,X6,X7)))))|aSupremumOfIn0(X7,X6,X5)))|~(aSubsetOf0(X6,X5)))|~(aSet0(X5))),inference(shift_quantors,[status(thm)],[38])).
% fof(40, plain,![X5]:![X6]:![X7]:![X8]:((((((~(aUpperBoundOfIn0(X8,X6,X5))|sdtlseqdt0(X7,X8))|~(aSupremumOfIn0(X7,X6,X5)))|~(aSubsetOf0(X6,X5)))|~(aSet0(X5)))&((((aElementOf0(X7,X5)|~(aSupremumOfIn0(X7,X6,X5)))|~(aSubsetOf0(X6,X5)))|~(aSet0(X5)))&(((aUpperBoundOfIn0(X7,X6,X5)|~(aSupremumOfIn0(X7,X6,X5)))|~(aSubsetOf0(X6,X5)))|~(aSet0(X5)))))&(((((aUpperBoundOfIn0(esk2_3(X5,X6,X7),X6,X5)|(~(aElementOf0(X7,X5))|~(aUpperBoundOfIn0(X7,X6,X5))))|aSupremumOfIn0(X7,X6,X5))|~(aSubsetOf0(X6,X5)))|~(aSet0(X5)))&((((~(sdtlseqdt0(X7,esk2_3(X5,X6,X7)))|(~(aElementOf0(X7,X5))|~(aUpperBoundOfIn0(X7,X6,X5))))|aSupremumOfIn0(X7,X6,X5))|~(aSubsetOf0(X6,X5)))|~(aSet0(X5))))),inference(distribute,[status(thm)],[39])).
% cnf(43,plain,(aUpperBoundOfIn0(X3,X2,X1)|~aSet0(X1)|~aSubsetOf0(X2,X1)|~aSupremumOfIn0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[40])).
% cnf(44,plain,(aElementOf0(X3,X1)|~aSet0(X1)|~aSubsetOf0(X2,X1)|~aSupremumOfIn0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[40])).
% cnf(45,plain,(sdtlseqdt0(X3,X4)|~aSet0(X1)|~aSubsetOf0(X2,X1)|~aSupremumOfIn0(X3,X2,X1)|~aUpperBoundOfIn0(X4,X2,X1)),inference(split_conjunct,[status(thm)],[40])).
% fof(49, plain,![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|((~(sdtlseqdt0(X1,X2))|~(sdtlseqdt0(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[7])).
% fof(50, plain,![X3]:![X4]:((~(aElement0(X3))|~(aElement0(X4)))|((~(sdtlseqdt0(X3,X4))|~(sdtlseqdt0(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[49])).
% cnf(51,plain,(X1=X2|~sdtlseqdt0(X2,X1)|~sdtlseqdt0(X1,X2)|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[50])).
% fof(75, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|aElement0(X2))),inference(fof_nnf,[status(thm)],[12])).
% fof(76, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|aElement0(X4))),inference(variable_rename,[status(thm)],[75])).
% fof(77, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|aElement0(X4))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[76])).
% cnf(78,plain,(aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[77])).
% cnf(100,negated_conjecture,(xu!=xv),inference(split_conjunct,[status(thm)],[22])).
% cnf(109,plain,(aElementOf0(xv,xT)|~aSubsetOf0(xS,xT)|~aSet0(xT)),inference(spm,[status(thm)],[44,25,theory(equality)])).
% cnf(110,plain,(aElementOf0(xu,xT)|~aSubsetOf0(xS,xT)|~aSet0(xT)),inference(spm,[status(thm)],[44,26,theory(equality)])).
% cnf(111,plain,(aElementOf0(xv,xT)|$false|~aSet0(xT)),inference(rw,[status(thm)],[109,24,theory(equality)])).
% cnf(112,plain,(aElementOf0(xv,xT)|$false|$false),inference(rw,[status(thm)],[111,23,theory(equality)])).
% cnf(113,plain,(aElementOf0(xv,xT)),inference(cn,[status(thm)],[112,theory(equality)])).
% cnf(114,plain,(aElementOf0(xu,xT)|$false|~aSet0(xT)),inference(rw,[status(thm)],[110,24,theory(equality)])).
% cnf(115,plain,(aElementOf0(xu,xT)|$false|$false),inference(rw,[status(thm)],[114,23,theory(equality)])).
% cnf(116,plain,(aElementOf0(xu,xT)),inference(cn,[status(thm)],[115,theory(equality)])).
% cnf(121,plain,(aUpperBoundOfIn0(xv,xS,xT)|~aSubsetOf0(xS,xT)|~aSet0(xT)),inference(spm,[status(thm)],[43,25,theory(equality)])).
% cnf(122,plain,(aUpperBoundOfIn0(xu,xS,xT)|~aSubsetOf0(xS,xT)|~aSet0(xT)),inference(spm,[status(thm)],[43,26,theory(equality)])).
% cnf(123,plain,(aUpperBoundOfIn0(xv,xS,xT)|$false|~aSet0(xT)),inference(rw,[status(thm)],[121,24,theory(equality)])).
% cnf(124,plain,(aUpperBoundOfIn0(xv,xS,xT)|$false|$false),inference(rw,[status(thm)],[123,23,theory(equality)])).
% cnf(125,plain,(aUpperBoundOfIn0(xv,xS,xT)),inference(cn,[status(thm)],[124,theory(equality)])).
% cnf(126,plain,(aUpperBoundOfIn0(xu,xS,xT)|$false|~aSet0(xT)),inference(rw,[status(thm)],[122,24,theory(equality)])).
% cnf(127,plain,(aUpperBoundOfIn0(xu,xS,xT)|$false|$false),inference(rw,[status(thm)],[126,23,theory(equality)])).
% cnf(128,plain,(aUpperBoundOfIn0(xu,xS,xT)),inference(cn,[status(thm)],[127,theory(equality)])).
% cnf(142,plain,(aElement0(xv)|~aSet0(xT)),inference(spm,[status(thm)],[78,113,theory(equality)])).
% cnf(145,plain,(aElement0(xv)|$false),inference(rw,[status(thm)],[142,23,theory(equality)])).
% cnf(146,plain,(aElement0(xv)),inference(cn,[status(thm)],[145,theory(equality)])).
% cnf(155,plain,(aElement0(xu)|~aSet0(xT)),inference(spm,[status(thm)],[78,116,theory(equality)])).
% cnf(158,plain,(aElement0(xu)|$false),inference(rw,[status(thm)],[155,23,theory(equality)])).
% cnf(159,plain,(aElement0(xu)),inference(cn,[status(thm)],[158,theory(equality)])).
% cnf(166,plain,(sdtlseqdt0(X1,xv)|~aSupremumOfIn0(X1,xS,xT)|~aSubsetOf0(xS,xT)|~aSet0(xT)),inference(spm,[status(thm)],[45,125,theory(equality)])).
% cnf(174,plain,(sdtlseqdt0(X1,xv)|~aSupremumOfIn0(X1,xS,xT)|$false|~aSet0(xT)),inference(rw,[status(thm)],[166,24,theory(equality)])).
% cnf(175,plain,(sdtlseqdt0(X1,xv)|~aSupremumOfIn0(X1,xS,xT)|$false|$false),inference(rw,[status(thm)],[174,23,theory(equality)])).
% cnf(176,plain,(sdtlseqdt0(X1,xv)|~aSupremumOfIn0(X1,xS,xT)),inference(cn,[status(thm)],[175,theory(equality)])).
% cnf(187,plain,(sdtlseqdt0(X1,xu)|~aSupremumOfIn0(X1,xS,xT)|~aSubsetOf0(xS,xT)|~aSet0(xT)),inference(spm,[status(thm)],[45,128,theory(equality)])).
% cnf(195,plain,(sdtlseqdt0(X1,xu)|~aSupremumOfIn0(X1,xS,xT)|$false|~aSet0(xT)),inference(rw,[status(thm)],[187,24,theory(equality)])).
% cnf(196,plain,(sdtlseqdt0(X1,xu)|~aSupremumOfIn0(X1,xS,xT)|$false|$false),inference(rw,[status(thm)],[195,23,theory(equality)])).
% cnf(197,plain,(sdtlseqdt0(X1,xu)|~aSupremumOfIn0(X1,xS,xT)),inference(cn,[status(thm)],[196,theory(equality)])).
% cnf(224,plain,(sdtlseqdt0(xu,xv)),inference(spm,[status(thm)],[176,26,theory(equality)])).
% cnf(227,plain,(xv=xu|~aElement0(xu)|~aElement0(xv)|~sdtlseqdt0(xv,xu)),inference(spm,[status(thm)],[51,224,theory(equality)])).
% cnf(229,plain,(xv=xu|$false|~aElement0(xv)|~sdtlseqdt0(xv,xu)),inference(rw,[status(thm)],[227,159,theory(equality)])).
% cnf(230,plain,(xv=xu|$false|$false|~sdtlseqdt0(xv,xu)),inference(rw,[status(thm)],[229,146,theory(equality)])).
% cnf(231,plain,(xv=xu|~sdtlseqdt0(xv,xu)),inference(cn,[status(thm)],[230,theory(equality)])).
% cnf(232,plain,(~sdtlseqdt0(xv,xu)),inference(sr,[status(thm)],[231,100,theory(equality)])).
% cnf(237,plain,(sdtlseqdt0(xv,xu)),inference(spm,[status(thm)],[197,25,theory(equality)])).
% cnf(239,plain,($false),inference(sr,[status(thm)],[237,232,theory(equality)])).
% cnf(240,plain,($false),239,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 94
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 92
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 60
% # ...of the previous two non-trivial : 50
% # Contextual simplify-reflections : 6
% # Paramodulations : 60
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 59
% # Positive orientable unit clauses: 14
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 41
% # Current number of unprocessed clauses: 22
% # ...number of literals in the above : 103
% # Clause-clause subsumption calls (NU) : 77
% # Rec. Clause-clause subsumption calls : 48
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 59 leaves, 1.53+/-1.140 terms/leaf
% # Paramod-from index: 27 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 55 leaves, 1.24+/-0.503 terms/leaf
% # -------------------------------------------------
% # User time : 0.017 s
% # System time : 0.005 s
% # Total time : 0.022 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.22 WC
% FINAL PrfWatch: 0.12 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP26036/LAT381+1.tptp
%
%------------------------------------------------------------------------------