TSTP Solution File: LAT382+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LAT382+3 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.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:18:06 EST 2010
% Result : Theorem 0.91s
% Output : Solution 0.91s
% 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/SystemOnTPTP25203/LAT382+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP25203/LAT382+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25203/LAT382+3.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 25299
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,aSet0(xT),file('/tmp/SRASS.s.p', m__773)).
% fof(6, axiom,(((((((((((aElementOf0(xu,xT)&aElementOf0(xu,xT))&![X1]:(aElementOf0(X1,xS)=>sdtlseqdt0(xu,X1)))&aLowerBoundOfIn0(xu,xS,xT))&![X1]:(((aElementOf0(X1,xT)&![X2]:(aElementOf0(X2,xS)=>sdtlseqdt0(X1,X2)))|aLowerBoundOfIn0(X1,xS,xT))=>sdtlseqdt0(X1,xu)))&aInfimumOfIn0(xu,xS,xT))&aElementOf0(xv,xT))&aElementOf0(xv,xT))&![X1]:(aElementOf0(X1,xS)=>sdtlseqdt0(xv,X1)))&aLowerBoundOfIn0(xv,xS,xT))&![X1]:(((aElementOf0(X1,xT)&![X2]:(aElementOf0(X2,xS)=>sdtlseqdt0(X1,X2)))|aLowerBoundOfIn0(X1,xS,xT))=>sdtlseqdt0(X1,xv)))&aInfimumOfIn0(xv,xS,xT)),file('/tmp/SRASS.s.p', m__792)).
% fof(7, axiom,![X1]:![X2]:((aElement0(X1)&aElement0(X2))=>((sdtlseqdt0(X1,X2)&sdtlseqdt0(X2,X1))=>X1=X2)),file('/tmp/SRASS.s.p', mASymm)).
% fof(10, axiom,![X1]:(aSet0(X1)=>![X2]:(aElementOf0(X2,X1)=>aElement0(X2))),file('/tmp/SRASS.s.p', mEOfElem)).
% fof(18, conjecture,xu=xv,file('/tmp/SRASS.s.p', m__)).
% fof(19, negated_conjecture,~(xu=xv),inference(assume_negation,[status(cth)],[18])).
% fof(20, plain,((((((((((aElementOf0(xu,xT)&![X1]:(aElementOf0(X1,xS)=>sdtlseqdt0(xu,X1)))&aLowerBoundOfIn0(xu,xS,xT))&![X1]:(((aElementOf0(X1,xT)&![X2]:(aElementOf0(X2,xS)=>sdtlseqdt0(X1,X2)))|aLowerBoundOfIn0(X1,xS,xT))=>sdtlseqdt0(X1,xu)))&aInfimumOfIn0(xu,xS,xT))&aElementOf0(xv,xT))&aElementOf0(xv,xT))&![X1]:(aElementOf0(X1,xS)=>sdtlseqdt0(xv,X1)))&aLowerBoundOfIn0(xv,xS,xT))&![X1]:(((aElementOf0(X1,xT)&![X2]:(aElementOf0(X2,xS)=>sdtlseqdt0(X1,X2)))|aLowerBoundOfIn0(X1,xS,xT))=>sdtlseqdt0(X1,xv)))&aInfimumOfIn0(xv,xS,xT)),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(24, negated_conjecture,~(xu=xv),inference(fof_simplification,[status(thm)],[19,theory(equality)])).
% cnf(53,plain,(aSet0(xT)),inference(split_conjunct,[status(thm)],[4])).
% fof(60, plain,((((((((((aElementOf0(xu,xT)&![X1]:(~(aElementOf0(X1,xS))|sdtlseqdt0(xu,X1)))&aLowerBoundOfIn0(xu,xS,xT))&![X1]:(((~(aElementOf0(X1,xT))|?[X2]:(aElementOf0(X2,xS)&~(sdtlseqdt0(X1,X2))))&~(aLowerBoundOfIn0(X1,xS,xT)))|sdtlseqdt0(X1,xu)))&aInfimumOfIn0(xu,xS,xT))&aElementOf0(xv,xT))&aElementOf0(xv,xT))&![X1]:(~(aElementOf0(X1,xS))|sdtlseqdt0(xv,X1)))&aLowerBoundOfIn0(xv,xS,xT))&![X1]:(((~(aElementOf0(X1,xT))|?[X2]:(aElementOf0(X2,xS)&~(sdtlseqdt0(X1,X2))))&~(aLowerBoundOfIn0(X1,xS,xT)))|sdtlseqdt0(X1,xv)))&aInfimumOfIn0(xv,xS,xT)),inference(fof_nnf,[status(thm)],[20])).
% fof(61, plain,((((((((((aElementOf0(xu,xT)&![X3]:(~(aElementOf0(X3,xS))|sdtlseqdt0(xu,X3)))&aLowerBoundOfIn0(xu,xS,xT))&![X4]:(((~(aElementOf0(X4,xT))|?[X5]:(aElementOf0(X5,xS)&~(sdtlseqdt0(X4,X5))))&~(aLowerBoundOfIn0(X4,xS,xT)))|sdtlseqdt0(X4,xu)))&aInfimumOfIn0(xu,xS,xT))&aElementOf0(xv,xT))&aElementOf0(xv,xT))&![X6]:(~(aElementOf0(X6,xS))|sdtlseqdt0(xv,X6)))&aLowerBoundOfIn0(xv,xS,xT))&![X7]:(((~(aElementOf0(X7,xT))|?[X8]:(aElementOf0(X8,xS)&~(sdtlseqdt0(X7,X8))))&~(aLowerBoundOfIn0(X7,xS,xT)))|sdtlseqdt0(X7,xv)))&aInfimumOfIn0(xv,xS,xT)),inference(variable_rename,[status(thm)],[60])).
% fof(62, plain,((((((((((aElementOf0(xu,xT)&![X3]:(~(aElementOf0(X3,xS))|sdtlseqdt0(xu,X3)))&aLowerBoundOfIn0(xu,xS,xT))&![X4]:(((~(aElementOf0(X4,xT))|(aElementOf0(esk4_1(X4),xS)&~(sdtlseqdt0(X4,esk4_1(X4)))))&~(aLowerBoundOfIn0(X4,xS,xT)))|sdtlseqdt0(X4,xu)))&aInfimumOfIn0(xu,xS,xT))&aElementOf0(xv,xT))&aElementOf0(xv,xT))&![X6]:(~(aElementOf0(X6,xS))|sdtlseqdt0(xv,X6)))&aLowerBoundOfIn0(xv,xS,xT))&![X7]:(((~(aElementOf0(X7,xT))|(aElementOf0(esk5_1(X7),xS)&~(sdtlseqdt0(X7,esk5_1(X7)))))&~(aLowerBoundOfIn0(X7,xS,xT)))|sdtlseqdt0(X7,xv)))&aInfimumOfIn0(xv,xS,xT)),inference(skolemize,[status(esa)],[61])).
% fof(63, plain,![X3]:![X4]:![X6]:![X7]:(((((~(aElementOf0(X7,xT))|(aElementOf0(esk5_1(X7),xS)&~(sdtlseqdt0(X7,esk5_1(X7)))))&~(aLowerBoundOfIn0(X7,xS,xT)))|sdtlseqdt0(X7,xv))&(((~(aElementOf0(X6,xS))|sdtlseqdt0(xv,X6))&(((((((~(aElementOf0(X4,xT))|(aElementOf0(esk4_1(X4),xS)&~(sdtlseqdt0(X4,esk4_1(X4)))))&~(aLowerBoundOfIn0(X4,xS,xT)))|sdtlseqdt0(X4,xu))&(((~(aElementOf0(X3,xS))|sdtlseqdt0(xu,X3))&aElementOf0(xu,xT))&aLowerBoundOfIn0(xu,xS,xT)))&aInfimumOfIn0(xu,xS,xT))&aElementOf0(xv,xT))&aElementOf0(xv,xT)))&aLowerBoundOfIn0(xv,xS,xT)))&aInfimumOfIn0(xv,xS,xT)),inference(shift_quantors,[status(thm)],[62])).
% fof(64, plain,![X3]:![X4]:![X6]:![X7]:((((((aElementOf0(esk5_1(X7),xS)|~(aElementOf0(X7,xT)))|sdtlseqdt0(X7,xv))&((~(sdtlseqdt0(X7,esk5_1(X7)))|~(aElementOf0(X7,xT)))|sdtlseqdt0(X7,xv)))&(~(aLowerBoundOfIn0(X7,xS,xT))|sdtlseqdt0(X7,xv)))&(((~(aElementOf0(X6,xS))|sdtlseqdt0(xv,X6))&((((((((aElementOf0(esk4_1(X4),xS)|~(aElementOf0(X4,xT)))|sdtlseqdt0(X4,xu))&((~(sdtlseqdt0(X4,esk4_1(X4)))|~(aElementOf0(X4,xT)))|sdtlseqdt0(X4,xu)))&(~(aLowerBoundOfIn0(X4,xS,xT))|sdtlseqdt0(X4,xu)))&(((~(aElementOf0(X3,xS))|sdtlseqdt0(xu,X3))&aElementOf0(xu,xT))&aLowerBoundOfIn0(xu,xS,xT)))&aInfimumOfIn0(xu,xS,xT))&aElementOf0(xv,xT))&aElementOf0(xv,xT)))&aLowerBoundOfIn0(xv,xS,xT)))&aInfimumOfIn0(xv,xS,xT)),inference(distribute,[status(thm)],[63])).
% cnf(66,plain,(aLowerBoundOfIn0(xv,xS,xT)),inference(split_conjunct,[status(thm)],[64])).
% cnf(67,plain,(aElementOf0(xv,xT)),inference(split_conjunct,[status(thm)],[64])).
% cnf(70,plain,(aLowerBoundOfIn0(xu,xS,xT)),inference(split_conjunct,[status(thm)],[64])).
% cnf(71,plain,(aElementOf0(xu,xT)),inference(split_conjunct,[status(thm)],[64])).
% cnf(73,plain,(sdtlseqdt0(X1,xu)|~aLowerBoundOfIn0(X1,xS,xT)),inference(split_conjunct,[status(thm)],[64])).
% cnf(77,plain,(sdtlseqdt0(X1,xv)|~aLowerBoundOfIn0(X1,xS,xT)),inference(split_conjunct,[status(thm)],[64])).
% fof(80, plain,![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|((~(sdtlseqdt0(X1,X2))|~(sdtlseqdt0(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[7])).
% fof(81, plain,![X3]:![X4]:((~(aElement0(X3))|~(aElement0(X4)))|((~(sdtlseqdt0(X3,X4))|~(sdtlseqdt0(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[80])).
% cnf(82,plain,(X1=X2|~sdtlseqdt0(X2,X1)|~sdtlseqdt0(X1,X2)|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[81])).
% fof(96, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|aElement0(X2))),inference(fof_nnf,[status(thm)],[10])).
% fof(97, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|aElement0(X4))),inference(variable_rename,[status(thm)],[96])).
% fof(98, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|aElement0(X4))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[97])).
% cnf(99,plain,(aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[98])).
% cnf(129,negated_conjecture,(xu!=xv),inference(split_conjunct,[status(thm)],[24])).
% cnf(131,plain,(sdtlseqdt0(xv,xu)),inference(spm,[status(thm)],[73,66,theory(equality)])).
% cnf(134,plain,(sdtlseqdt0(xu,xv)),inference(spm,[status(thm)],[77,70,theory(equality)])).
% cnf(146,plain,(aElement0(xv)|~aSet0(xT)),inference(spm,[status(thm)],[99,67,theory(equality)])).
% cnf(147,plain,(aElement0(xu)|~aSet0(xT)),inference(spm,[status(thm)],[99,71,theory(equality)])).
% cnf(148,plain,(aElement0(xv)|$false),inference(rw,[status(thm)],[146,53,theory(equality)])).
% cnf(149,plain,(aElement0(xv)),inference(cn,[status(thm)],[148,theory(equality)])).
% cnf(150,plain,(aElement0(xu)|$false),inference(rw,[status(thm)],[147,53,theory(equality)])).
% cnf(151,plain,(aElement0(xu)),inference(cn,[status(thm)],[150,theory(equality)])).
% cnf(272,plain,(xv=xu|~aElement0(xu)|~aElement0(xv)|~sdtlseqdt0(xv,xu)),inference(spm,[status(thm)],[82,134,theory(equality)])).
% cnf(274,plain,(xv=xu|~aElement0(xu)|~aElement0(xv)|$false),inference(rw,[status(thm)],[272,131,theory(equality)])).
% cnf(275,plain,(xv=xu|~aElement0(xu)|~aElement0(xv)),inference(cn,[status(thm)],[274,theory(equality)])).
% cnf(276,plain,(~aElement0(xu)|~aElement0(xv)),inference(sr,[status(thm)],[275,129,theory(equality)])).
% cnf(287,plain,($false|~aElement0(xv)),inference(rw,[status(thm)],[276,151,theory(equality)])).
% cnf(288,plain,($false|$false),inference(rw,[status(thm)],[287,149,theory(equality)])).
% cnf(289,plain,($false),inference(cn,[status(thm)],[288,theory(equality)])).
% cnf(290,plain,($false),289,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 59
% # ...of these trivial : 1
% # ...subsumed : 1
% # ...remaining for further processing: 57
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 67
% # ...of the previous two non-trivial : 55
% # Contextual simplify-reflections : 4
% # Paramodulations : 67
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 56
% # Positive orientable unit clauses: 15
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 39
% # Current number of unprocessed clauses: 45
% # ...number of literals in the above : 173
% # Clause-clause subsumption calls (NU) : 33
% # Rec. Clause-clause subsumption calls : 21
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 63 leaves, 1.43+/-1.019 terms/leaf
% # Paramod-from index: 26 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 56 leaves, 1.21+/-0.558 terms/leaf
% # -------------------------------------------------
% # User time : 0.016 s
% # System time : 0.004 s
% # Total time : 0.020 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP25203/LAT382+3.tptp
%
%------------------------------------------------------------------------------