TSTP Solution File: LAT382+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LAT382+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:45 EST 2010
% Result : Theorem 1.07s
% Output : Solution 1.07s
% 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/SystemOnTPTP26554/LAT382+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26554/LAT382+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26554/LAT382+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 26650
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.016 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__773)).
% fof(2, axiom,aSubsetOf0(xS,xT),file('/tmp/SRASS.s.p', m__773_01)).
% fof(3, axiom,(aInfimumOfIn0(xu,xS,xT)&aInfimumOfIn0(xv,xS,xT)),file('/tmp/SRASS.s.p', m__792)).
% fof(6, axiom,![X1]:(aSet0(X1)=>![X2]:(aSubsetOf0(X2,X1)=>![X3]:(aInfimumOfIn0(X3,X2,X1)<=>((aElementOf0(X3,X1)&aLowerBoundOfIn0(X3,X2,X1))&![X4]:(aLowerBoundOfIn0(X4,X2,X1)=>sdtlseqdt0(X4,X3)))))),file('/tmp/SRASS.s.p', mDefInf)).
% fof(9, axiom,![X1]:![X2]:((aElement0(X1)&aElement0(X2))=>((sdtlseqdt0(X1,X2)&sdtlseqdt0(X2,X1))=>X1=X2)),file('/tmp/SRASS.s.p', mASymm)).
% fof(11, 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(23, negated_conjecture,~(xu=xv),inference(fof_simplification,[status(thm)],[19,theory(equality)])).
% cnf(24,plain,(aSet0(xT)),inference(split_conjunct,[status(thm)],[1])).
% cnf(25,plain,(aSubsetOf0(xS,xT)),inference(split_conjunct,[status(thm)],[2])).
% cnf(26,plain,(aInfimumOfIn0(xv,xS,xT)),inference(split_conjunct,[status(thm)],[3])).
% cnf(27,plain,(aInfimumOfIn0(xu,xS,xT)),inference(split_conjunct,[status(thm)],[3])).
% fof(41, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aSubsetOf0(X2,X1))|![X3]:((~(aInfimumOfIn0(X3,X2,X1))|((aElementOf0(X3,X1)&aLowerBoundOfIn0(X3,X2,X1))&![X4]:(~(aLowerBoundOfIn0(X4,X2,X1))|sdtlseqdt0(X4,X3))))&(((~(aElementOf0(X3,X1))|~(aLowerBoundOfIn0(X3,X2,X1)))|?[X4]:(aLowerBoundOfIn0(X4,X2,X1)&~(sdtlseqdt0(X4,X3))))|aInfimumOfIn0(X3,X2,X1))))),inference(fof_nnf,[status(thm)],[6])).
% fof(42, plain,![X5]:(~(aSet0(X5))|![X6]:(~(aSubsetOf0(X6,X5))|![X7]:((~(aInfimumOfIn0(X7,X6,X5))|((aElementOf0(X7,X5)&aLowerBoundOfIn0(X7,X6,X5))&![X8]:(~(aLowerBoundOfIn0(X8,X6,X5))|sdtlseqdt0(X8,X7))))&(((~(aElementOf0(X7,X5))|~(aLowerBoundOfIn0(X7,X6,X5)))|?[X9]:(aLowerBoundOfIn0(X9,X6,X5)&~(sdtlseqdt0(X9,X7))))|aInfimumOfIn0(X7,X6,X5))))),inference(variable_rename,[status(thm)],[41])).
% fof(43, plain,![X5]:(~(aSet0(X5))|![X6]:(~(aSubsetOf0(X6,X5))|![X7]:((~(aInfimumOfIn0(X7,X6,X5))|((aElementOf0(X7,X5)&aLowerBoundOfIn0(X7,X6,X5))&![X8]:(~(aLowerBoundOfIn0(X8,X6,X5))|sdtlseqdt0(X8,X7))))&(((~(aElementOf0(X7,X5))|~(aLowerBoundOfIn0(X7,X6,X5)))|(aLowerBoundOfIn0(esk2_3(X5,X6,X7),X6,X5)&~(sdtlseqdt0(esk2_3(X5,X6,X7),X7))))|aInfimumOfIn0(X7,X6,X5))))),inference(skolemize,[status(esa)],[42])).
% fof(44, plain,![X5]:![X6]:![X7]:![X8]:((((((~(aLowerBoundOfIn0(X8,X6,X5))|sdtlseqdt0(X8,X7))&(aElementOf0(X7,X5)&aLowerBoundOfIn0(X7,X6,X5)))|~(aInfimumOfIn0(X7,X6,X5)))&(((~(aElementOf0(X7,X5))|~(aLowerBoundOfIn0(X7,X6,X5)))|(aLowerBoundOfIn0(esk2_3(X5,X6,X7),X6,X5)&~(sdtlseqdt0(esk2_3(X5,X6,X7),X7))))|aInfimumOfIn0(X7,X6,X5)))|~(aSubsetOf0(X6,X5)))|~(aSet0(X5))),inference(shift_quantors,[status(thm)],[43])).
% fof(45, plain,![X5]:![X6]:![X7]:![X8]:((((((~(aLowerBoundOfIn0(X8,X6,X5))|sdtlseqdt0(X8,X7))|~(aInfimumOfIn0(X7,X6,X5)))|~(aSubsetOf0(X6,X5)))|~(aSet0(X5)))&((((aElementOf0(X7,X5)|~(aInfimumOfIn0(X7,X6,X5)))|~(aSubsetOf0(X6,X5)))|~(aSet0(X5)))&(((aLowerBoundOfIn0(X7,X6,X5)|~(aInfimumOfIn0(X7,X6,X5)))|~(aSubsetOf0(X6,X5)))|~(aSet0(X5)))))&(((((aLowerBoundOfIn0(esk2_3(X5,X6,X7),X6,X5)|(~(aElementOf0(X7,X5))|~(aLowerBoundOfIn0(X7,X6,X5))))|aInfimumOfIn0(X7,X6,X5))|~(aSubsetOf0(X6,X5)))|~(aSet0(X5)))&((((~(sdtlseqdt0(esk2_3(X5,X6,X7),X7))|(~(aElementOf0(X7,X5))|~(aLowerBoundOfIn0(X7,X6,X5))))|aInfimumOfIn0(X7,X6,X5))|~(aSubsetOf0(X6,X5)))|~(aSet0(X5))))),inference(distribute,[status(thm)],[44])).
% cnf(48,plain,(aLowerBoundOfIn0(X3,X2,X1)|~aSet0(X1)|~aSubsetOf0(X2,X1)|~aInfimumOfIn0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[45])).
% cnf(49,plain,(aElementOf0(X3,X1)|~aSet0(X1)|~aSubsetOf0(X2,X1)|~aInfimumOfIn0(X3,X2,X1)),inference(split_conjunct,[status(thm)],[45])).
% cnf(50,plain,(sdtlseqdt0(X4,X3)|~aSet0(X1)|~aSubsetOf0(X2,X1)|~aInfimumOfIn0(X3,X2,X1)|~aLowerBoundOfIn0(X4,X2,X1)),inference(split_conjunct,[status(thm)],[45])).
% fof(57, plain,![X1]:![X2]:((~(aElement0(X1))|~(aElement0(X2)))|((~(sdtlseqdt0(X1,X2))|~(sdtlseqdt0(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[9])).
% fof(58, plain,![X3]:![X4]:((~(aElement0(X3))|~(aElement0(X4)))|((~(sdtlseqdt0(X3,X4))|~(sdtlseqdt0(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[57])).
% cnf(59,plain,(X1=X2|~sdtlseqdt0(X2,X1)|~sdtlseqdt0(X1,X2)|~aElement0(X2)|~aElement0(X1)),inference(split_conjunct,[status(thm)],[58])).
% fof(62, plain,![X1]:(~(aSet0(X1))|![X2]:(~(aElementOf0(X2,X1))|aElement0(X2))),inference(fof_nnf,[status(thm)],[11])).
% fof(63, plain,![X3]:(~(aSet0(X3))|![X4]:(~(aElementOf0(X4,X3))|aElement0(X4))),inference(variable_rename,[status(thm)],[62])).
% fof(64, plain,![X3]:![X4]:((~(aElementOf0(X4,X3))|aElement0(X4))|~(aSet0(X3))),inference(shift_quantors,[status(thm)],[63])).
% cnf(65,plain,(aElement0(X2)|~aSet0(X1)|~aElementOf0(X2,X1)),inference(split_conjunct,[status(thm)],[64])).
% cnf(105,negated_conjecture,(xu!=xv),inference(split_conjunct,[status(thm)],[23])).
% cnf(115,plain,(aElementOf0(xv,xT)|~aSubsetOf0(xS,xT)|~aSet0(xT)),inference(spm,[status(thm)],[49,26,theory(equality)])).
% cnf(116,plain,(aElementOf0(xu,xT)|~aSubsetOf0(xS,xT)|~aSet0(xT)),inference(spm,[status(thm)],[49,27,theory(equality)])).
% cnf(117,plain,(aElementOf0(xv,xT)|$false|~aSet0(xT)),inference(rw,[status(thm)],[115,25,theory(equality)])).
% cnf(118,plain,(aElementOf0(xv,xT)|$false|$false),inference(rw,[status(thm)],[117,24,theory(equality)])).
% cnf(119,plain,(aElementOf0(xv,xT)),inference(cn,[status(thm)],[118,theory(equality)])).
% cnf(120,plain,(aElementOf0(xu,xT)|$false|~aSet0(xT)),inference(rw,[status(thm)],[116,25,theory(equality)])).
% cnf(121,plain,(aElementOf0(xu,xT)|$false|$false),inference(rw,[status(thm)],[120,24,theory(equality)])).
% cnf(122,plain,(aElementOf0(xu,xT)),inference(cn,[status(thm)],[121,theory(equality)])).
% cnf(123,plain,(aLowerBoundOfIn0(xv,xS,xT)|~aSubsetOf0(xS,xT)|~aSet0(xT)),inference(spm,[status(thm)],[48,26,theory(equality)])).
% cnf(124,plain,(aLowerBoundOfIn0(xu,xS,xT)|~aSubsetOf0(xS,xT)|~aSet0(xT)),inference(spm,[status(thm)],[48,27,theory(equality)])).
% cnf(125,plain,(aLowerBoundOfIn0(xv,xS,xT)|$false|~aSet0(xT)),inference(rw,[status(thm)],[123,25,theory(equality)])).
% cnf(126,plain,(aLowerBoundOfIn0(xv,xS,xT)|$false|$false),inference(rw,[status(thm)],[125,24,theory(equality)])).
% cnf(127,plain,(aLowerBoundOfIn0(xv,xS,xT)),inference(cn,[status(thm)],[126,theory(equality)])).
% cnf(128,plain,(aLowerBoundOfIn0(xu,xS,xT)|$false|~aSet0(xT)),inference(rw,[status(thm)],[124,25,theory(equality)])).
% cnf(129,plain,(aLowerBoundOfIn0(xu,xS,xT)|$false|$false),inference(rw,[status(thm)],[128,24,theory(equality)])).
% cnf(130,plain,(aLowerBoundOfIn0(xu,xS,xT)),inference(cn,[status(thm)],[129,theory(equality)])).
% cnf(148,plain,(aElement0(xv)|~aSet0(xT)),inference(spm,[status(thm)],[65,119,theory(equality)])).
% cnf(151,plain,(aElement0(xv)|$false),inference(rw,[status(thm)],[148,24,theory(equality)])).
% cnf(152,plain,(aElement0(xv)),inference(cn,[status(thm)],[151,theory(equality)])).
% cnf(157,plain,(aElement0(xu)|~aSet0(xT)),inference(spm,[status(thm)],[65,122,theory(equality)])).
% cnf(160,plain,(aElement0(xu)|$false),inference(rw,[status(thm)],[157,24,theory(equality)])).
% cnf(161,plain,(aElement0(xu)),inference(cn,[status(thm)],[160,theory(equality)])).
% cnf(169,plain,(sdtlseqdt0(xv,X1)|~aInfimumOfIn0(X1,xS,xT)|~aSubsetOf0(xS,xT)|~aSet0(xT)),inference(spm,[status(thm)],[50,127,theory(equality)])).
% cnf(177,plain,(sdtlseqdt0(xv,X1)|~aInfimumOfIn0(X1,xS,xT)|$false|~aSet0(xT)),inference(rw,[status(thm)],[169,25,theory(equality)])).
% cnf(178,plain,(sdtlseqdt0(xv,X1)|~aInfimumOfIn0(X1,xS,xT)|$false|$false),inference(rw,[status(thm)],[177,24,theory(equality)])).
% cnf(179,plain,(sdtlseqdt0(xv,X1)|~aInfimumOfIn0(X1,xS,xT)),inference(cn,[status(thm)],[178,theory(equality)])).
% cnf(185,plain,(sdtlseqdt0(xu,X1)|~aInfimumOfIn0(X1,xS,xT)|~aSubsetOf0(xS,xT)|~aSet0(xT)),inference(spm,[status(thm)],[50,130,theory(equality)])).
% cnf(193,plain,(sdtlseqdt0(xu,X1)|~aInfimumOfIn0(X1,xS,xT)|$false|~aSet0(xT)),inference(rw,[status(thm)],[185,25,theory(equality)])).
% cnf(194,plain,(sdtlseqdt0(xu,X1)|~aInfimumOfIn0(X1,xS,xT)|$false|$false),inference(rw,[status(thm)],[193,24,theory(equality)])).
% cnf(195,plain,(sdtlseqdt0(xu,X1)|~aInfimumOfIn0(X1,xS,xT)),inference(cn,[status(thm)],[194,theory(equality)])).
% cnf(230,plain,(sdtlseqdt0(xv,xu)),inference(spm,[status(thm)],[179,27,theory(equality)])).
% cnf(232,plain,(xu=xv|~aElement0(xv)|~aElement0(xu)|~sdtlseqdt0(xu,xv)),inference(spm,[status(thm)],[59,230,theory(equality)])).
% cnf(234,plain,(xu=xv|$false|~aElement0(xu)|~sdtlseqdt0(xu,xv)),inference(rw,[status(thm)],[232,152,theory(equality)])).
% cnf(235,plain,(xu=xv|$false|$false|~sdtlseqdt0(xu,xv)),inference(rw,[status(thm)],[234,161,theory(equality)])).
% cnf(236,plain,(xu=xv|~sdtlseqdt0(xu,xv)),inference(cn,[status(thm)],[235,theory(equality)])).
% cnf(237,plain,(~sdtlseqdt0(xu,xv)),inference(sr,[status(thm)],[236,105,theory(equality)])).
% cnf(244,plain,(sdtlseqdt0(xu,xv)),inference(spm,[status(thm)],[195,26,theory(equality)])).
% cnf(246,plain,($false),inference(sr,[status(thm)],[244,237,theory(equality)])).
% cnf(247,plain,($false),246,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 97
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 95
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 62
% # ...of the previous two non-trivial : 51
% # Contextual simplify-reflections : 6
% # Paramodulations : 62
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 61
% # Positive orientable unit clauses: 14
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 4
% # Non-unit-clauses : 43
% # Current number of unprocessed clauses: 22
% # ...number of literals in the above : 107
% # Clause-clause subsumption calls (NU) : 77
% # Rec. Clause-clause subsumption calls : 48
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 60 leaves, 1.58+/-1.229 terms/leaf
% # Paramod-from index: 28 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 56 leaves, 1.25+/-0.509 terms/leaf
% # -------------------------------------------------
% # User time : 0.020 s
% # System time : 0.004 s
% # Total time : 0.024 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.22 WC
% FINAL PrfWatch: 0.13 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP26554/LAT382+1.tptp
%
%------------------------------------------------------------------------------