TSTP Solution File: LAT388+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : LAT388+4 : 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:22:41 EST 2010
% Result : Theorem 1.13s
% Output : Solution 1.13s
% 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/SystemOnTPTP1087/LAT388+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP1087/LAT388+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1087/LAT388+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 1184
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.022 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(21, axiom,((((((aElementOf0(xp,szDzozmdt0(xf))&sdtlpdtrp0(xf,xp)=xp)&aFixedPointOf0(xp,xf))&![X1]:(aElementOf0(X1,xT)=>sdtlseqdt0(X1,xp)))&aUpperBoundOfIn0(xp,xT,xS))&![X1]:(((aElementOf0(X1,xS)&![X2]:(aElementOf0(X2,xT)=>sdtlseqdt0(X2,X1)))|aUpperBoundOfIn0(X1,xT,xS))=>sdtlseqdt0(xp,X1)))&aSupremumOfIn0(xp,xT,xS)),file('/tmp/SRASS.s.p', m__1330)).
% fof(31, conjecture,?[X1]:(((aElementOf0(X1,xS)&((aElementOf0(X1,xS)&![X2]:(aElementOf0(X2,xT)=>sdtlseqdt0(X2,X1)))|aUpperBoundOfIn0(X1,xT,xS)))&![X2]:(((aElementOf0(X2,xS)&![X3]:(aElementOf0(X3,xT)=>sdtlseqdt0(X3,X2)))&aUpperBoundOfIn0(X2,xT,xS))=>sdtlseqdt0(X1,X2)))|aSupremumOfIn0(X1,xT,xS)),file('/tmp/SRASS.s.p', m__)).
% fof(32, negated_conjecture,~(?[X1]:(((aElementOf0(X1,xS)&((aElementOf0(X1,xS)&![X2]:(aElementOf0(X2,xT)=>sdtlseqdt0(X2,X1)))|aUpperBoundOfIn0(X1,xT,xS)))&![X2]:(((aElementOf0(X2,xS)&![X3]:(aElementOf0(X3,xT)=>sdtlseqdt0(X3,X2)))&aUpperBoundOfIn0(X2,xT,xS))=>sdtlseqdt0(X1,X2)))|aSupremumOfIn0(X1,xT,xS))),inference(assume_negation,[status(cth)],[31])).
% fof(205, plain,((((((aElementOf0(xp,szDzozmdt0(xf))&sdtlpdtrp0(xf,xp)=xp)&aFixedPointOf0(xp,xf))&![X1]:(~(aElementOf0(X1,xT))|sdtlseqdt0(X1,xp)))&aUpperBoundOfIn0(xp,xT,xS))&![X1]:(((~(aElementOf0(X1,xS))|?[X2]:(aElementOf0(X2,xT)&~(sdtlseqdt0(X2,X1))))&~(aUpperBoundOfIn0(X1,xT,xS)))|sdtlseqdt0(xp,X1)))&aSupremumOfIn0(xp,xT,xS)),inference(fof_nnf,[status(thm)],[21])).
% fof(206, plain,((((((aElementOf0(xp,szDzozmdt0(xf))&sdtlpdtrp0(xf,xp)=xp)&aFixedPointOf0(xp,xf))&![X3]:(~(aElementOf0(X3,xT))|sdtlseqdt0(X3,xp)))&aUpperBoundOfIn0(xp,xT,xS))&![X4]:(((~(aElementOf0(X4,xS))|?[X5]:(aElementOf0(X5,xT)&~(sdtlseqdt0(X5,X4))))&~(aUpperBoundOfIn0(X4,xT,xS)))|sdtlseqdt0(xp,X4)))&aSupremumOfIn0(xp,xT,xS)),inference(variable_rename,[status(thm)],[205])).
% fof(207, plain,((((((aElementOf0(xp,szDzozmdt0(xf))&sdtlpdtrp0(xf,xp)=xp)&aFixedPointOf0(xp,xf))&![X3]:(~(aElementOf0(X3,xT))|sdtlseqdt0(X3,xp)))&aUpperBoundOfIn0(xp,xT,xS))&![X4]:(((~(aElementOf0(X4,xS))|(aElementOf0(esk14_1(X4),xT)&~(sdtlseqdt0(esk14_1(X4),X4))))&~(aUpperBoundOfIn0(X4,xT,xS)))|sdtlseqdt0(xp,X4)))&aSupremumOfIn0(xp,xT,xS)),inference(skolemize,[status(esa)],[206])).
% fof(208, plain,![X3]:![X4]:(((((~(aElementOf0(X4,xS))|(aElementOf0(esk14_1(X4),xT)&~(sdtlseqdt0(esk14_1(X4),X4))))&~(aUpperBoundOfIn0(X4,xT,xS)))|sdtlseqdt0(xp,X4))&(((~(aElementOf0(X3,xT))|sdtlseqdt0(X3,xp))&((aElementOf0(xp,szDzozmdt0(xf))&sdtlpdtrp0(xf,xp)=xp)&aFixedPointOf0(xp,xf)))&aUpperBoundOfIn0(xp,xT,xS)))&aSupremumOfIn0(xp,xT,xS)),inference(shift_quantors,[status(thm)],[207])).
% fof(209, plain,![X3]:![X4]:((((((aElementOf0(esk14_1(X4),xT)|~(aElementOf0(X4,xS)))|sdtlseqdt0(xp,X4))&((~(sdtlseqdt0(esk14_1(X4),X4))|~(aElementOf0(X4,xS)))|sdtlseqdt0(xp,X4)))&(~(aUpperBoundOfIn0(X4,xT,xS))|sdtlseqdt0(xp,X4)))&(((~(aElementOf0(X3,xT))|sdtlseqdt0(X3,xp))&((aElementOf0(xp,szDzozmdt0(xf))&sdtlpdtrp0(xf,xp)=xp)&aFixedPointOf0(xp,xf)))&aUpperBoundOfIn0(xp,xT,xS)))&aSupremumOfIn0(xp,xT,xS)),inference(distribute,[status(thm)],[208])).
% cnf(210,plain,(aSupremumOfIn0(xp,xT,xS)),inference(split_conjunct,[status(thm)],[209])).
% fof(247, negated_conjecture,![X1]:(((~(aElementOf0(X1,xS))|((~(aElementOf0(X1,xS))|?[X2]:(aElementOf0(X2,xT)&~(sdtlseqdt0(X2,X1))))&~(aUpperBoundOfIn0(X1,xT,xS))))|?[X2]:(((aElementOf0(X2,xS)&![X3]:(~(aElementOf0(X3,xT))|sdtlseqdt0(X3,X2)))&aUpperBoundOfIn0(X2,xT,xS))&~(sdtlseqdt0(X1,X2))))&~(aSupremumOfIn0(X1,xT,xS))),inference(fof_nnf,[status(thm)],[32])).
% fof(248, negated_conjecture,![X4]:(((~(aElementOf0(X4,xS))|((~(aElementOf0(X4,xS))|?[X5]:(aElementOf0(X5,xT)&~(sdtlseqdt0(X5,X4))))&~(aUpperBoundOfIn0(X4,xT,xS))))|?[X6]:(((aElementOf0(X6,xS)&![X7]:(~(aElementOf0(X7,xT))|sdtlseqdt0(X7,X6)))&aUpperBoundOfIn0(X6,xT,xS))&~(sdtlseqdt0(X4,X6))))&~(aSupremumOfIn0(X4,xT,xS))),inference(variable_rename,[status(thm)],[247])).
% fof(249, negated_conjecture,![X4]:(((~(aElementOf0(X4,xS))|((~(aElementOf0(X4,xS))|(aElementOf0(esk16_1(X4),xT)&~(sdtlseqdt0(esk16_1(X4),X4))))&~(aUpperBoundOfIn0(X4,xT,xS))))|(((aElementOf0(esk17_1(X4),xS)&![X7]:(~(aElementOf0(X7,xT))|sdtlseqdt0(X7,esk17_1(X4))))&aUpperBoundOfIn0(esk17_1(X4),xT,xS))&~(sdtlseqdt0(X4,esk17_1(X4)))))&~(aSupremumOfIn0(X4,xT,xS))),inference(skolemize,[status(esa)],[248])).
% fof(250, negated_conjecture,![X4]:![X7]:((((((~(aElementOf0(X7,xT))|sdtlseqdt0(X7,esk17_1(X4)))&aElementOf0(esk17_1(X4),xS))&aUpperBoundOfIn0(esk17_1(X4),xT,xS))&~(sdtlseqdt0(X4,esk17_1(X4))))|(~(aElementOf0(X4,xS))|((~(aElementOf0(X4,xS))|(aElementOf0(esk16_1(X4),xT)&~(sdtlseqdt0(esk16_1(X4),X4))))&~(aUpperBoundOfIn0(X4,xT,xS)))))&~(aSupremumOfIn0(X4,xT,xS))),inference(shift_quantors,[status(thm)],[249])).
% fof(251, negated_conjecture,![X4]:![X7]:(((((((((aElementOf0(esk16_1(X4),xT)|~(aElementOf0(X4,xS)))|~(aElementOf0(X4,xS)))|(~(aElementOf0(X7,xT))|sdtlseqdt0(X7,esk17_1(X4))))&(((~(sdtlseqdt0(esk16_1(X4),X4))|~(aElementOf0(X4,xS)))|~(aElementOf0(X4,xS)))|(~(aElementOf0(X7,xT))|sdtlseqdt0(X7,esk17_1(X4)))))&((~(aUpperBoundOfIn0(X4,xT,xS))|~(aElementOf0(X4,xS)))|(~(aElementOf0(X7,xT))|sdtlseqdt0(X7,esk17_1(X4)))))&(((((aElementOf0(esk16_1(X4),xT)|~(aElementOf0(X4,xS)))|~(aElementOf0(X4,xS)))|aElementOf0(esk17_1(X4),xS))&(((~(sdtlseqdt0(esk16_1(X4),X4))|~(aElementOf0(X4,xS)))|~(aElementOf0(X4,xS)))|aElementOf0(esk17_1(X4),xS)))&((~(aUpperBoundOfIn0(X4,xT,xS))|~(aElementOf0(X4,xS)))|aElementOf0(esk17_1(X4),xS))))&(((((aElementOf0(esk16_1(X4),xT)|~(aElementOf0(X4,xS)))|~(aElementOf0(X4,xS)))|aUpperBoundOfIn0(esk17_1(X4),xT,xS))&(((~(sdtlseqdt0(esk16_1(X4),X4))|~(aElementOf0(X4,xS)))|~(aElementOf0(X4,xS)))|aUpperBoundOfIn0(esk17_1(X4),xT,xS)))&((~(aUpperBoundOfIn0(X4,xT,xS))|~(aElementOf0(X4,xS)))|aUpperBoundOfIn0(esk17_1(X4),xT,xS))))&(((((aElementOf0(esk16_1(X4),xT)|~(aElementOf0(X4,xS)))|~(aElementOf0(X4,xS)))|~(sdtlseqdt0(X4,esk17_1(X4))))&(((~(sdtlseqdt0(esk16_1(X4),X4))|~(aElementOf0(X4,xS)))|~(aElementOf0(X4,xS)))|~(sdtlseqdt0(X4,esk17_1(X4)))))&((~(aUpperBoundOfIn0(X4,xT,xS))|~(aElementOf0(X4,xS)))|~(sdtlseqdt0(X4,esk17_1(X4))))))&~(aSupremumOfIn0(X4,xT,xS))),inference(distribute,[status(thm)],[250])).
% cnf(252,negated_conjecture,(~aSupremumOfIn0(X1,xT,xS)),inference(split_conjunct,[status(thm)],[251])).
% cnf(298,plain,($false),inference(sr,[status(thm)],[210,252,theory(equality)])).
% cnf(299,plain,($false),298,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 33
% # ...of these trivial : 1
% # ...subsumed : 0
% # ...remaining for further processing: 32
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 6
% # ...of the previous two non-trivial : 4
% # Contextual simplify-reflections : 0
% # Paramodulations : 6
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 31
% # Positive orientable unit clauses: 18
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 12
% # Current number of unprocessed clauses: 97
% # ...number of literals in the above : 325
% # Clause-clause subsumption calls (NU) : 1
% # Rec. Clause-clause subsumption calls : 0
% # 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: 48 leaves, 1.02+/-0.143 terms/leaf
% # Paramod-from index: 18 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 37 leaves, 1.00+/-0.000 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.23 WC
% FINAL PrfWatch: 0.13 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP1087/LAT388+4.tptp
%
%------------------------------------------------------------------------------